Dijkstra, Weighted Graph, Data Structure Algorithm, Algorithms, Graph Data Structure.
node while computing for the shortest path, this process continues until a path that connects the source node to all other nodes following the shortest path possible to reach each node. Algorithm Let the node at which we are starting be called the start node. Mark all the nodes as unvisited. Create