Gate CS-2012 Question Paper With Solutions

Q. 40 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.

Gate CS-2012 Question Paper With Solutions

(A) SDT

(B) SBDT

(C) SACDT

(D) SACET

Answer: (D)

Explanation:

Gate CS-2012 Question Paper With Solutions

Gate CS-2012 Question Paper With Solutions Gate CS-2012 Question Paper With Solutions

Learn More:   Gate CS-2014-3 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here