In the implementation of the HPAir problem (see Programming Problem 10), the search for the next unvisited city adjacent to a cityi always starts at the beginning of thei linked list in the adjacency list. This approach is actually a bit inefficient, because once the search visits a city, the city can never become unvisited. Modify the program so that the search for the next city begins where the last search left off. That is, maintain an array oftryNext references into the adjacency list.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.