Dijkstra, Weighted Graph, Data Structure Algorithm, Algorithms, Graph Data Structure.
distance greater than 8 then change it to 8. Otherwise, the current value will be kept. When we are done considering all of the unvisited neighbours of the current node, mark the current node as visited and remove it from the unvisited set. A visited node will never be checked again. If the