|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use PairingHeap | |
---|---|
goldman.collection.priority | A priority queue is an untagged algorithmically positioned collection of comparable elements in which there can be equivalent elements. |
Uses of PairingHeap in goldman.collection.priority |
---|
Subclasses of PairingHeap in goldman.collection.priority | |
---|---|
class |
FibonacciHeap<E>
The Fibonacci heap is a more complex self-organizing data structure. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |