# All Classes and Interfaces

Class

Description

An implementation of a Binary Heap.

An implementation of a Binary Heap.

A simple interface for objects that can be copied.

Disjoint sets of integers from [0, n) implemented with a disjoint set forest.

Represents disjoint sets of objects with a disjoint set forest.

This class is an implementation of a partially-filled array of
primitive double values.

An implementation of a Fibonacci Heap.

An implementation of a Fibonacci Heap.

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.

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.

This class is an implementation of a partially-filled array of
primitive int values.

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.

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.

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.

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.

A MergeablePriorityQueue is a PriorityQueue that includes a merge
method.

A MergeablePriorityQueueDouble is a PriorityQueueDouble that includes a merge
method.

Interface common to the classes that provide implementations of
a priority queue with int valued priorities.

Interface common to the classes that provide implementations of
a priority queue with double valued priorities.

An instances of the nested subclasses of this class encapsulate an (element, priority) pair
for use by the various priority queue classes of the library.

An instance of this class encapsulates an (element, priority) pair
for a double valued priority.

An instance of this class encapsulates an (element, priority) pair
for an integer valued priority.

An implementation of a Binary Heap.

An implementation of a Binary Heap.

An implementation of a Fibonacci Heap.

An implementation of a Fibonacci Heap.