engineering recuitment GATE CSE 2023-24 Test Series Algorithms Graphs/Spanning Tree and Shortest Paths Shortest Paths
If we run Dijkstra’s single source shortest path algorithm for the following edge weighted directed graph with vertex ‘5’ as the source.
In what order do the nodes get included into the set of vertices for which the shortest path distances are finalized
1
5, 6, 7, 4, 8, 3, 2, 1
2
5, 6, 7, 8, 4, 3, 2, 1
3
5,6, 7, 4, 8, 2, 3, 1
4
5, 6, 7, 4, 8, 2, 1, 3