Heap Structures

The same group on the Doxygen site.

group Heap Structures

Heap structures implemented in LEMON.

This group contains the heap structures implemented in LEMON.

LEMON provides several heap classes. They are efficient implementations of the abstract data type priority queue. They store items with specified values called priorities in such a way that finding and removing the item with minimum priority are efficient. The basic operations are adding and erasing items, changing the priority of an item, etc.

Heaps are crucial in several algorithms, such as Dijkstra and Prim. The heap implementations have the same interface, thus any of them can be used easily in such algorithms.

See also

Heap concept

Classes

Class

Description

BinHeap

Binary heap data structure.

BinomialHeap

Binomial heap data structure.

BucketHeap

Bucket heap data structure.

SimpleBucketHeap

Simplified bucket heap data structure.

DHeap

D-ary heap data structure.

FibHeap

Fibonacci heap data structure.

PairingHeap

Pairing Heap.

QuadHeap

Fourary (quaternary) heap data structure.

RadixHeap

Radix heap data structure.