Dijkstra's algorithm

Also written: Dijkstra

An algorithm that finds the fastest route from a start to every other place by always handling the closest unhandled place next, using a min-heap. It needs edge weights of zero or more.