Dijkstra’s Shortest Path

Finds the shortest path in a graph with non-negative edge weights by repeatedly choosing the closest unvisited node.