Question: Consider the problem of finding a route between two cities on a map using graph search. (a) Compare the solutions you might get if you
Consider the problem of finding a route between two cities on a map using graph search.
(a) Compare the solutions you might get if you start at city1 and end at city2 vs. starting at city2 and ending at city1.
(b) Now consider searching by starting at each city and trying to meet in the middle. Can you guarantee to meet in the middle and get a better solution?
(c) Now consider searching by starting at a middle node and ending at each city. Will this solution be better or worse than the others?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
