Glossary: Algorithms Beyond the Basics in Rust

Dijkstra's algorithm

Also written: Dijkstra

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