###### Question 13891 – Software-Engineering

November 21, 2023###### Question 9936 – Algorithms

November 21, 2023# Question 10175 – Algorithms

Let G be the directed, weighted graph shown in below figure.

We are interested in the shortest paths from A.

(a) Output the sequence of vertices identified by the Dijkstra’s algorithm for single source shortest path when the algorithm is started at node A.

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

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

Correct Answer: A

Theory Explanation.

Subscribe

Login

0 Comments