Dijkstra, Weighted Graph, Data Structure Algorithm, Algorithms, Graph Data Structure.
shortest path between the start node and all the other nodes in the graph. On the process of it, it keeps track of the currently known nodes with shortest distance from source node to other nodes. Once it visits a node it marks the node as visited. Then it goes onto look out for the next unvisited