CSCI2100 · Definition · Chapter 3 · Priority queues
Min-priority queue
0 steps of prerequisites below it
A min-priority queue holds a multiset of comparable keys and supports insertion and removal of one minimum key, reporting underflow when empty.
Taught in
- 3.1 Binary min-heaps and priority queues · introduced
- 14.2 Weighted graph frontiers: Dijkstra and Prim · applied
Builds on
Nothing in the notes sits below this point: it is a starting point.
Used by
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
Nothing is recorded below this point: it is a starting point.