|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use PriorityQueue | |
---|---|
goldman.collection.positional | A positional collection is a manually positioned collection in which elements are accessed via their position in a line (with 0 being the position of the first element in the line) or via their location relative to other elements in the line. |
goldman.collection.priority | A priority queue is an untagged algorithmically positioned collection of comparable elements in which there can be equivalent elements. |
Uses of PriorityQueue in goldman.collection.positional |
---|
Methods in goldman.collection.positional with parameters of type PriorityQueue | |
---|---|
protected void |
TrackedArray.buildPriorityQueue(PriorityQueue<Object> pq)
|
Uses of PriorityQueue in goldman.collection.priority |
---|
Classes in goldman.collection.priority that implement PriorityQueue | |
---|---|
class |
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). |
class |
FibonacciHeap<E>
The Fibonacci heap is a more complex self-organizing data structure. |
class |
LeftistHeap<E>
The leftist heap is a fairly simple implementation that supports merge in logarithmic time. |
class |
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. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |