CSCI2100 · Method · Chapter 14 · Graph algorithms
Dijkstra's algorithm
3 steps of prerequisites below it
Dijkstra’s algorithm repeatedly settles an unsettled vertex of least tentative distance, using a min-heap, and relaxes its outgoing edges.
Taught in
- 14.2 Weighted graph frontiers: Dijkstra and Prim · introduced
Builds on
- Min-priority queue · used in an argument or worked solution, passage 14.2
- Relaxation · used in an argument or worked solution, passage 14.2
- Lazy heap · used in an argument or worked solution, passage 14.2
Used by
Lenses
- Distance as the arrival time of a fire · Geometric
Everything this builds on, earliest first · 4 steps
Each step comes after its own prerequisites, so reading in this order never needs something you have not met. It is a reading order for these notes, not a diagnosis of what you know.
- Min-priority queue · 3.1
- Relaxation · 14.2
- Binary min-heap · 3.1
- Lazy heap · 14.2
Possible roots and a review route need your own answers on these points. None are recorded yet, so none are suggested.
Longest chain down to a starting point
Each step is used by the one above it, across courses where the notes link them. It ends at a point the notes define without another point.