Why it matters

Pairing heaps often beat Fibonacci in practice. Boost.Heap uses.

Advertisement

The architecture

Multi-way tree.

Two-pass or multi-pass on delete-min.

Fast constants.

Pairing heapMulti-way treechildren as listDelete-mintwo-passPracticalbeats Fibonacci oftenFredman et al. 1986; used in Boost.Heap; simple and fast
Pairing heap.
Advertisement

How it works end to end

Fredman 1986.

Boost.Heap uses.

Simpler than Fibonacci.