Dijkstra, Weighted Graph, Data Structure Algorithm, Algorithms, Graph Data Structure.
a set of all the unvisited nodes called the unvisited set. Assign to every node a tentative distance value: set it to zero our initial node and to infinity for all other nodes. Set the initial node as current. Relaxation: For the current node, consider all of its unvisited neighbours and calculate