CSCI2100 · Definition · Chapter 14 · Graph algorithms
Lazy heap
2 steps of prerequisites below it
A lazy heap pushes a new pair on each strict improvement instead of decreasing a key, and on extraction discards stale entries whose vertex is settled or whose key no longer equals the current label.
Taught in
- 14.2 Weighted graph frontiers: Dijkstra and Prim · introduced
Builds on
- Binary min-heap · used in its definition, passage 14.2
Used by
Everything this builds on, earliest first · 2 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
- Binary min-heap · 3.1
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.