Let G be the directed, weighted graph shown below. We are interested in the…

PYQ GATE 1996

Let G be the directed, weighted graph shown below.

Directed weighted graph with vertices A, B, C, D, E and F; use the labelled edge directions and weights to find shortest paths from A.

We are interested in the shortest paths from A.

(a) Output the sequence of vertices identified by Dijkstra’s single-source shortest-path algorithm when it starts at A.

(b) Write down the sequence of vertices in a shortest path from A to E.

(c) What is the cost of a shortest path from A to E?

Attempted by 1 students.

Sign up free to check your answer

Sign up free

Explore the full course: Algorithms

Loading lesson…