Priority queue

In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, a priority queue is an <a href="/facts/Abstract_data_type/BaVGSHNP">abstract data type</a> similar to a regular <a href="/facts/Queue_(abstract_data_type)/hVPjPXus">queue</a> or <a href="/facts/Stack_(abstract_data_type)/bj7l94v1">stack</a> abstract data type.
In a priority queue, each element has an associated priority, which determines its order of service. Priority queue serves highest priority items first. Priority values have to be instances of an ordered data type, and higher priority can be given either to the lesser or to the greater values with respect to the given order relation. For example, in <a href="/facts/Java_(programming_language)/9ScgFyAL">Java</a> standard library, PriorityQueue's the least elements with respect to the order have the highest priority. This implementation detail is without much practical significance, since passing to the <a href="/facts/Converse_relation/EVGlRSz7">opposite order relation</a> turns the least values into the greatest, and vice versa.
While priority queues are often implemented using <a href="/facts/Heap_(data_structure)/A67B0K7L">heaps</a>, they are conceptually distinct. A priority queue can be implemented with a heap or with other methods; just as a list can be implemented with a <a href="/facts/Linked_list/Ik4JTgJW">linked list</a> or with an <a href="/facts/Array_data_structure/BKGvF8AM">array</a>.

Priority queue open-in-new

Priority queue