Dijkstra’s shortest-path algorithm what if there are paths with same distance?

user_1821855 0
Viewed 13123

enter image description here

In this network Dijkstra’s shortest-path algorithm is used. The question is which path will A use to reach D because both are equal?

enter image description here

is that table missing?

shortest-path dijkstra algorithm
2 Answers
Related