In computer science, a priority queue is an abstract data type similar to regular queue or stack data structure in which each element additionally has a "priority" associated with it. In a priority queue, an element with high priority is served before an element with low priority. In some implementations, if two elements have the same priority, they are served according to the order in which they were enqueued, while in other implementations, ordering of elements with the same priority is undefined.
|is dbo:wikiPageDisambiguates of|
|is dbo:wikiPageRedirects of|
|is dbo:wikiPageWikiLink of|
|is foaf:primaryTopic of|