Opening the paper…
Figure from the original question paper Figure from the original question paper Suppose Dijkstra’s algorithm is run on the graph below, starting at node A. In what order do the shortest distances to the other vertices get finalized? Weighted graph on vertices A to E