language is C++.

DSA

4 thumbs up for correct answer

Q. No. 5: Implement the Dijkstra's algorithm on the below Weighted Directed Graph considering S as the start node. Show steps clearly and no code is required. (Points: 10) 1 A B 10 9 3 S 2 4 6 7 5 5 D N