GATE CS 2012, Question 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.
A. SDT
B. SBDT
C. SACDT
D. SACET
#algorithms #dijkstra #gatecspyqs
Join our Telegram Group for PDFs: https://t.me/arihantonlineacademy
For Regular Technical Updates Connect on Linked in: https://www.linkedin.com/in/imrahuljain
For feedback on this session Rate Us and Comment Here: https://goo.gl/maps/MXEZuCgRgYq9RRcHA
Let's get social: https://www.facebook.com/iamrahuljain.in/
