Data-Interpretation
October 27, 2023Artificial-Intelligence
October 27, 2023Shortest-Path
|
Question 2
|
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?
|
P, Q, R, S, T, U
|
|
|
P, Q, R, U, S, T
|
|
|
P, Q, R, U, T, S
|
|
|
P, Q, T, R, U, S
|
Question 2 Explanation:
P, Q, R, U, S, T
Correct Answer: B
Question 2 Explanation:
P, Q, R, U, S, T