Dijkstra's algorithm, when combined with a sufficiently efficient heap data structure, is universally optimal for the problem of ordering nodes by their distance from the source.
