A priority queue is a data structure that holds information that has some sort of priority value. When an item is removed from a priority queue, it's always the item with the highest priority.

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real ...

Finally, we demonstrate the potential of our methodology to solve other problems using the M/M/c queue with two priority classes, where the high-priority class is completely impatient. OR ...

Priority queues are used in many important computer algorithms, in particular graph-based shortest-path algorithms. Somewhat surprisingly, the Microsoft .NET Framework doesn't contain a priority queue ...