Package goldman.collection.priority

A priority queue is an untagged algorithmically positioned collection of comparable elements in which there can be equivalent elements.

See:
          Description

Interface Summary
PriorityQueue<E> A priority queue is an untagged algorithmically positioned collection of comparable elements in which there can be equivalent elements.
PriorityQueueLocator<E> The PriorityQueueLocator interface extends the Locator interface to add methods that are specific to a priority queue.
 

Class Summary
BinaryHeap<E> The binary heap is a very simple data structure that has worst-case logarithmic cost for add, extractMax, and update (through a locator).
FibonacciHeap<E> The Fibonacci heap is a more complex self-organizing data structure.
LeftistHeap<E> The leftist heap is a fairly simple implementation that supports merge in logarithmic time.
PairingHeap<E> The pairing heap is a simple self-organizing data structure in which the amortized cost for add, merge, and remove through a tracker are all logarithmic.
 

Package goldman.collection.priority Description

A priority queue is an untagged algorithmically positioned collection of comparable elements in which there can be equivalent elements.