Dijkstra's algorithm finds the shortest path in a graph from a starting node to all other nodes.

• Use a priority queue to keep track of the shortest distance to each node

• Initialize distances to all node...read more