Dijkstra, Leetcode Medium, Graph, Cpp.
neighbour=node1 Mark node as visited ` visited |1|1|0|0|` Perform step-3. ie if I am sitting on node=1, which all nodes can I see and in what distance? Sitting on Node=1. if ((neighbour is unvisited) { if (assumed cost of reaching neighbour(in vecCost) > Cost to reach myself from node=0(10) + Cost