Question

b) 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.

          b) 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.

b) 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.

Added by Christopher M.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Jennifer Stoner

Step 1

Dijkstra's algorithm starts at the source vertex S and initializes the distance to all other vertices as infinity, except for S itself which is set to 0. Show more…

Show all steps

Thanks for your feedback!

b) 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. 5+5-10 marks