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.

gat2012
(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.



pranjal_1

pranjal_2

 

This solution is contributed by Pranjul Ahuja.

 

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

2


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.