DT Q14

Home
DT Q14

14Suppose 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?

Option : B
Explanation :

nodes are include in order
⇒ (P, O, R, U, S, T)

Forgot your password?

I agree with the Terms.