10-20-2011 06:12 PM
Hey folks,
I am working on a dijkstra's algorithm program. So far my program follows the shortest route and tells me the distance. However, I am not sure how I would go about finding the path that it took with the way I have the program set up. I am fairly certain my program finds the shortest route, have ran it numerous times and have been able to verify. If anyone could help it would be much appreciated.
10-20-2011 07:48 PM
I realized one of my errors in the system. It could visit the same node more than once. I believe I have fixed that.
10-20-2011 09:42 PM
Can you post 2010 version ? I can try