NIST

monotone priority queue

(data structure)

Definition: A priority queue in which a key being inserted is never higher in priority than a previously deleted node.

Note: The keys deleted from a monotone priority queue form a monotonically increasing or monotonically decreasing sequence -- hence the name. After LK.

Author: PEB


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.
HTML page formatted Fri Feb 23 10:06:08 2018.

Cite this as:
Paul E. Black, "monotone priority queue", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/monotonprioq.html