Hi,I am just wondering what you should do in the case that you have a choice between two nodes to include for the next step, i..e both are equal to the minimal value of the set under consideration Do you need to follow through both cases and then see which way is the shortest, or is there a way of knowing beforehand?Many thanks.
Dijkstra's algorithm - Shortest Path Query Watch
- Thread Starter
- 08-01-2017 21:32
- 08-01-2017 21:37
You can just choose one at random. The algorithm will still give you a shortest path.