Q. 9 Dijkstra’s single source shortest path algorithm when run from vertex a in the
above graph, computes the corrects 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
Answer: (D)
Explanation:
