Heaps using an explicit "pointer-based" tree representation
-
Class Summary
| Class |
Description |
| BinaryTreeAddressableHeap<K,V> |
An explicit binary tree addressable heap.
|
| BinaryTreeSoftAddressableHeap<K,V> |
A binary tree soft addressable heap.
|
| BinaryTreeSoftAddressableHeap.RootList<K,V> |
|
| BinaryTreeSoftAddressableHeap.RootListNode<K,V> |
|
| BinaryTreeSoftAddressableHeap.SoftHandle<K,V> |
|
| BinaryTreeSoftAddressableHeap.TreeNode<K,V> |
|
| BinaryTreeSoftHeap<K> |
A binary tree soft heap.
|
| BinaryTreeSoftHeap.RootList<K> |
|
| BinaryTreeSoftHeap.RootListNode<K> |
|
| BinaryTreeSoftHeap.SoftHandle<K> |
|
| BinaryTreeSoftHeap.TreeNode<K> |
|
| CostlessMeldPairingHeap<K,V> |
The costless meld variant of the pairing heaps.
|
| CostlessMeldPairingHeap.Node<K,V> |
|
| DaryTreeAddressableHeap<K,V> |
An explicit d-ary tree addressable heap.
|
| FibonacciHeap<K,V> |
Fibonacci heaps.
|
| FibonacciHeap.Node<K,V> |
|
| LeftistHeap<K,V> |
Leftist heaps.
|
| LeftistHeap.LeftistNode<K,V> |
|
| PairingHeap<K,V> |
Pairing heaps.
|
| PairingHeap.Node<K,V> |
|
| RankPairingHeap<K,V> |
Rank-Pairing heaps.
|
| RankPairingHeap.Node<K,V> |
|
| ReflectedFibonacciHeap<K,V> |
Reflected double ended heaps based on Fibonacci heaps.
|
| ReflectedFibonacciHeap.Factory<K,V> |
|
| ReflectedHeap<K,V> |
Reflected double ended heaps.
|
| ReflectedHeap.HandleMap<K,V> |
|
| ReflectedHeap.ReflectedHandle<K,V> |
|
| ReflectedPairingHeap<K,V> |
Reflected double ended heaps based on pairing heaps.
|
| ReflectedPairingHeap.Factory<K,V> |
|
| SimpleFibonacciHeap<K,V> |
Simple Fibonacci heaps.
|
| SimpleFibonacciHeap.Node<K,V> |
|
| SkewHeap<K,V> |
Skew heaps.
|
| SkewHeap.Node<K,V> |
|