Question: We have two people on the map, one at Arad and the other in Vaslui. They want to meet in some city. Assuming that the

We have two people on the map, one at Arad and the other in Vaslui. They want to meet in some city.
Assuming that the length of a solution is the smallest total number of segments both people have to move.
For example, if they meet in Fagaras then the length of the solution is at least 5 (A: 2 and B: 3). Invent a heuristic to find an optimal solution.
Oradea Neamt Zerind glasi Arad Sibiu Fagaras Vaslui Rimnicu Vilcea Timisoara Pitesti Lugoj Hirsova Mehadia Urziceni Bucharest Dobreta 0 Craiova ciorie Giurgiu Oradea Neamt Zerind glasi Arad Sibiu Fagaras Vaslui Rimnicu Vilcea Timisoara Pitesti Lugoj Hirsova Mehadia Urziceni Bucharest Dobreta 0 Craiova ciorie Giurgiu
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
