Heaps and priority queues

Priority queues: binary, d-ary, binomial, Fibonacci and catenable heaps, indexed min-queues, and their sift, decrease-key and merge operations and costs.

• Binary heap
• Binomial heap
• d-ary heap
• Fibonacci heap
• Indexed minimum priority queue
• Leftist heap

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.