Uses of Package
org.cicirello.ds

Packages that use org.cicirello.ds

Package	Description
org.cicirello.ds	This package includes core data structures used by other of our libraries and projects.

Classes in org.cicirello.ds used by org.cicirello.ds

Class	Description
BinaryHeap	An implementation of a Binary Heap.
BinaryHeapDouble	An implementation of a Binary Heap.
DisjointIntegerSetForest	Disjoint sets of integers from [0, n) implemented with a disjoint set forest.
DoublePriorityQueueNode	Encapsulate an (element, priority) pair for use by the various priority queue classes of the library.
FibonacciHeap	An implementation of a Fibonacci Heap.
FibonacciHeapDouble	An implementation of a Fibonacci Heap.
IntBinaryHeap	An implementation of a Binary Heap of (element, priority) pairs, such that the elements are distinct integers in the interval [0, n), and with priority values also of type int.
IntBinaryHeapDouble	An implementation of a Binary Heap of (element, priority) pairs, such that the elements are distinct integers in the interval [0, n), and with priority values of type double.
IntegerPriorityQueueNode	Encapsulate an (element, priority) pair for use by the various priority queue classes of the library.
IntFibonacciHeap	An implementation of a Fibonacci Heap of (element, priority) pairs, such that the elements are distinct integers in the interval [0, n), and with priority values of type int.
IntFibonacciHeapDouble	An implementation of a Fibonacci Heap of (element, priority) pairs, such that the elements are distinct integers in the interval [0, n), and with priority values of type double.
IntPriorityQueue	Interface common to the classes that provide implementations of a priority queue of (element, priority) pairs, such that the elements are int values in the interval [0, n), and priorities are also ints.
IntPriorityQueueDouble	Interface common to the classes that provide implementations of a priority queue of (element, priority) pairs, such that the elements are int values in the interval [0, n), and priorities are doubles.
MergeablePriorityQueue	A MergeablePriorityQueue is a PriorityQueue that includes a merge method.
MergeablePriorityQueueDouble	A MergeablePriorityQueueDouble is a PriorityQueueDouble that includes a merge method.
PriorityQueue	Interface common to the classes that provide implementations of a priority queue with int valued priorities.
PriorityQueueDouble	Interface common to the classes that provide implementations of a priority queue with double valued priorities.
SimpleBinaryHeap	An implementation of a Binary Heap.
SimpleBinaryHeapDouble	An implementation of a Binary Heap.
SimpleFibonacciHeap	An implementation of a Fibonacci Heap.
SimpleFibonacciHeapDouble	An implementation of a Fibonacci Heap.