Glossary: Algorithms Beyond the Basics in Go

Dijkstra's algorithm

Also written: Dijkstra

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