Dijkstra's algorithm - Shortest Path Query

[binbagsss]

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.

 

[Orodruin]

You pick one of them as the current node. The other will be the current node in the next cycle.

 

[binbagsss]

You pick one of them as the current node. The other will be the current node in the next cycle.

ahh makes sense ! thank you :)