Dijkstra, Leetcode Medium, Graph, Cpp.
neighbour=0 at distance 10 neighbour=2 at distance 20 neighbour=3 at distance 30 .. so on Logic of finding shortest Distance from Node=0 Step-1. Take cost, visited array and initialize. //NOTE: This array always represents cost to reach nodes //from source node(node=0) cost | inf | inf | inf | inf