Dijkstra, Leetcode Medium, Graph, Cpp.
Dijkstra’s Algorithm now. Consider the following graph: We need to find shortest distance from node=0 to all other nodes. nodes=0,1,2,3 distances: 10,20,50,30,40 [0] --10--[1]--20-- [2] \50 |30 /40 \ | / [3] Answer: Vertex Distance from Source(node=0) 0 0 1 10 2 30 3 40 How we will store Graph?