Package org.cicirello.ds

package org.cicirello.ds

This package includes core data structures used by other of our libraries and projects.

Class	Description
BinaryHeap<E>	An implementation of a Binary Heap.
BinaryHeapDouble<E>	An implementation of a Binary Heap.
DisjointIntegerSetForest	Disjoint sets of integers from [0, n) implemented with a disjoint set forest.
DisjointSetForest<T>	Represents disjoint sets of objects with a disjoint set forest.
DoublePriorityQueueNode<E>	Encapsulate an (element, priority) pair for use by the various priority queue classes of the library.
FibonacciHeap<E>	An implementation of a Fibonacci Heap.
FibonacciHeapDouble<E>	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<E>	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<E, T extends MergeablePriorityQueue<E,T>>	A MergeablePriorityQueue is a PriorityQueue that includes a merge method.
MergeablePriorityQueueDouble<E, T extends MergeablePriorityQueueDouble<E,T>>	A MergeablePriorityQueueDouble is a PriorityQueueDouble that includes a merge method.
PriorityQueue<E>	Interface common to the classes that provide implementations of a priority queue with int valued priorities.
PriorityQueueDouble<E>	Interface common to the classes that provide implementations of a priority queue with double valued priorities.
SimpleBinaryHeap<E>	An implementation of a Binary Heap.
SimpleBinaryHeapDouble<E>	An implementation of a Binary Heap.
SimpleFibonacciHeap<E>	An implementation of a Fibonacci Heap.
SimpleFibonacciHeapDouble<E>	An implementation of a Fibonacci Heap.