File TreePriorityQueue.h
↰ Parent directory (ADS/priority)
The PRIORITYQUEUE [see File PriorityQueue.h] on a tree.
Definition (ADS/priority/TreePriorityQueue.h)
Detailed Description
TreePriorityQueue is a Red-Black tree of the pairs ( priority , number of insertion ) (section 10.1.2): every operation in O( log n ).
The contracts [see File Contract.h]: min() and deleteMin() need a queue that is not empty, decrease() the handle of an item still in the queue and a priority not larger than its own; the invariant is that each item of the tree has the priority recorded for its handle. The operations are defined in TreePriorityQueue.tpp.
Montresor, Algoritmi e Strutture Dati, 2025, section 10.1.2, https://algoritmicamente.it/materiali/libro/capitoli/cap10.pdf
- Donato Meoli
Dipartimento di Informatica Universita’ di Pisa
by Donato Meoli
Includes
ADS/Contract.h(File Contract.h)ADS/Iterators.h(File Iterators.h)ADS/priority/PriorityQueue.h(File PriorityQueue.h)ADS/priority/impl/TreePriorityQueue.tppADS/tree/SearchTree.h(File SearchTree.h)conceptscstddefutilityvector