GATE Papers >> CSE >> 2012 >> Question No 40

Question No. 40 CSE | GATE 2012

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 Dijkstra’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.

Answer : (D) SACET

No Comments
Leave a comment