Package org.jheaps.tree
package org.jheaps.tree
Heaps using an explicit "pointer-based" tree representation
-
ClassesClassDescriptionAn explicit binary tree addressable heap.A binary tree soft addressable heap.A binary tree soft heap.The costless meld variant of the pairing heaps.An explicit d-ary tree addressable heap.FibonacciHeap<K,
V> Fibonacci heaps.FibonacciHeap.Node<K,V> LeftistHeap<K,V> Leftist heaps.PairingHeap<K,V> Pairing heaps.PairingHeap.Node<K,V> RankPairingHeap<K,V> Rank-Pairing heaps.RankPairingHeap.Node<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.SkewHeap.Node<K,V>