An abstract data type that serves its elements not in arrival order but in order of an assigned priority, most commonly implemented with a heap; used wherever the next item to process is the most urgent one rather than the oldest one.
Facts
Core PrincipleAn abstract data type to efficiently support finding the item with the highest priority across a series of operations. The basic operations are: insert, find-minimum (or maximum), and delete-minimum (or maximum). 1 Connections
Sources
1. priority queue, Dictionary of Algorithms and Data Structures, NIST
DefinitionQuote, Definition
An abstract data type to efficiently support finding the item with the highest priority across a series of operations. The basic operations are: insert, find-minimum (or maximum), and delete-minimum (or maximum).
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.