Dijkstra’s single source shortest path algorithm when run from vertex a in the…
PYQ GATE 2008
Dijkstra’s single source shortest path algorithm when run from vertex a in the below graph, computes the correct shortest path distance to
- A.
only vertex a
- B.
only vertices a, e, f, g, h
- C.
only vertices a, b, c, d
- D.
all the vertices
Attempted by 360 students.
Sign up free to check your answer
Sign up freeLoading lesson…