Uses of Class
net.cscott.jutil.AbstractHeap

Uses of AbstractHeap in net.cscott.jutil

Subclasses of AbstractHeap in net.cscott.jutil

Modifier and Type	Class	Description
final 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.