In computer science, a priority queue is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a priority. Items with a higher priority are dequeued before items with a lower priority.

Rank pairing heaps Introduction This is a header-only implementation of rank-pairing heaps (rp-heap) written in C++11. The idea of rp-heap is based on lazy binomial queue with the rank restriction to ensure the balance of half trees. Heap has wide applications like heapsort, k-smallest elements, Prim's algorithm and notably well-known Dijkstra's shortest-path algorithm. We are implementing this data structure because: * std::priority_queue does not support decrease-key * Fibonacci heap