Skip to content

Glossary: Algorithms Beyond the Basics in JavaScript

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 gets Alex to Daybreak in 29 minutes, where BFS's fewest-roads route takes longer.

Where the book teaches it

Related terms

Shortest pathRelaxing an edgeStale entryMin-heapNegative weight