Shortest Path


Q21.

Dijkstra's single source shortest path algorithm when run from vertex a in the above graph, computes the correct shortest path distance to
GateOverflow

Q22.

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
GateOverflow