The GATE Grind

GATE 2008 CS – Question 45

Algorithms · Graph Algorithms: Traversals, Minimum Spanning Trees, Shortest Paths · 2 marks · Multiple choice

Run Dijkstra’s single-source shortest-path algorithm from a in the shown directed graph. For which vertices does it compute correct shortest distances?

Diagram for GATE 2008 CS question 45
  1. Only a
  2. Only a, e, f, g, h
  3. Only a, b, c, d
  4. All vertices

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (D) All vertices

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Graph Algorithms: Traversals, Minimum Spanning Trees, Shortest Paths questions

All Graph Algorithms: Traversals, Minimum Spanning Trees, Shortest Paths questions →