GATE | GATE CS 2012 | Question 38
Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices S and T. Which one will be reported by Dijstra?s shortest path algorithm? Assume that, in any iteration, the shortest path to a vertex v is updated only when a strictly shorter path to v is discovered.
(A) SDT
(B) SBDT
(C) SACDT
(D) SACET
Answer: (D)
Explanation: Â
Background Required – Â Dijkstra’s Single Source Shortest Path Algorithm
Explanation – Applying  Dijkstra’s algorithm to compute the shortest distances from S and finally generating the Tree as given below in the diagram.
Â
This solution is contributed by Pranjul Ahuja.
Â
Quiz of this Question
Last Updated :
14 Feb, 2018
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...