Algorithms | Graph Shortest Paths | Question 3

Last Updated :

Discuss

Comments

Dijkstra’s single source shortest path algorithm when run from vertex a in the below graph, computes the correct shortest path distance to

only vertex a

only vertices a, e, f, g, h

only vertices a, b, c, d

all the vertices

This question is part of this quiz :

Tags:

Share your thoughts in the comments

GeeksforGeeks