Prioqueue v0.2.0 Prioqueue.Implementations.PairingHeap View Source

An implementation of a Priority Queue built on top of a Pairing Heap.

Pairing Heaps are nearly as simple as Skew Heaps but are in many contexts the fastest kind of priority queue implementation known.

Pairing Heaps have amortized time bounds.

More information about Pairing Heaps can be found in Issue #16 of the Monad.Reader.

Link to this section Summary

Link to this section Functions

Link to this function combine(pairing_heap1, pairing_heap2) View Source