Suppose we run Dijkstra’s single source shortest-path algorithm on the…
GATE · 2004 · CS
Suppose we run Dijkstra’s single source shortest-path algorithm on the following edge weighted directed graph with vertex P as the source. In what order do the nodes get included into the set of vertices for which the shortest path distances are finalized?
- A.
P, Q, R, S, T, U
- B.
P, Q, R, U, S, T
- C.
P, Q, R, U, T, S
- D.
P, Q, T, R, U, S
Attempted by 327 students.
Sign up free to check your answer
Sign up freeLoading lesson…