Package org.jheaps.tree

Heaps using an explicit "pointer-based" tree representation

See: Description

Class Summary

Class	Description
BinaryTreeAddressableHeap<K,V>	An explicit binary tree addressable heap.
BinaryTreeSoftAddressableHeap<K,V>	A binary tree soft addressable heap.
BinaryTreeSoftHeap<K>	A binary tree soft heap.
CostlessMeldPairingHeap<K,V>	The costless meld variant of the pairing heaps.
FibonacciHeap<K,V>	Fibonacci heaps.
LeftistHeap<K,V>	Leftist heaps.
PairingHeap<K,V>	Pairing heaps.
ReflectedFibonacciHeap<K,V>	Reflected double ended heaps based on Fibonacci heaps.
ReflectedHeap<K,V>	Reflected double ended heaps.
ReflectedPairingHeap<K,V>	Reflected double ended heaps based on pairing heaps.
SimpleFibonacciHeap<K,V>	Simple Fibonacci heaps.
SkewHeap<K,V>	Skew heaps.

Package org.jheaps.tree Description

Heaps using an explicit "pointer-based" tree representation