(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
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "monotone priority queue", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/monotonprioq.html
