Posted by Yu-Ling Chen on November 08, 19100 at 14:04:57:
In Reply to: Re: a shortest path algorithm posted by Charanjit Singh Ahluwalia on July 18, 19100 at 08:41:17:
: : I need to implement a shortest path algorithm, but I want the algorithm to exhaustively search for all routes that have the optimal shortest distance, not just the first route that reaches the destination via the iteration of the Dijsktra algorithm. Anything come to mind?
I have 20 cities of the United States' need to visit by using Hamiltonian circuit.
Could you please tell me how to do? I have already had the distances between any two cities.
Thank you very much!
Yu-Ling Chen