Dijkstra's Algorithm — Shortest Paths with a Priority Queue

Greedily expand the closest unsettled vertex to find shortest paths in a graph with non-negative weights.