Uses of Interface
net.cscott.jutil.Heap

Uses of Heap in net.cscott.jutil

Classes in net.cscott.jutil that implement Heap

class	AbstractHeap<K,V> AbstractHeap provides a skeletal implementation of the Heap interface, to minimize the effort required to implement this interface.
class	BinaryHeap<K,V> BinaryHeap is an implementation of a binary heap.
class	BinomialHeap<K,V> A BinomialHeap allows O(lg n) time bounds for insert, minimum, extract-min, union, decrease-key, and delete operations.
class	FibonacciHeap<K,V> A FibonacciHeap allows amortized O(1) time bounds for create, insert, minimum, union, and decrease-key operations, and amortized O(lg n) run times for extract-min and delete.

Methods in net.cscott.jutil with parameters of type Heap

void	BinomialHeap.union(Heap<? extends K,? extends V> h) Add all the entries from the given heap to this one.
void	Heap.union(Heap<? extends K,? extends V> h) Merges all of the mappings from the specified Heap into this Heap.
void	FibonacciHeap.union(Heap<? extends K,? extends V> h)
void	BinaryHeap.union(Heap<? extends K,? extends V> h)
void	AbstractHeap.union(Heap<? extends K,? extends V> h)

Constructors in net.cscott.jutil with parameters of type Heap

BinaryHeap(Heap<K,? extends V> h)
Builds a binary heap from the given heap, using the same key comparator as the given heap.

BinomialHeap(Heap<K,? extends V> h)
Constructs a new binomial heap with the same entries as the specified Heap.

FibonacciHeap(Heap<K,? extends V> h)
Constructs a new heap with the same entries as the specified Heap.