| Interface | Description |
|---|---|
| ExtendedPriorityQueue<T> | |
| Meldable<T> | |
| PriorityQueue<T> |
In contrast to soft priority queues, "standard" priority queues have to be exact.
|
| SoftPriorityQueue<T> |
A soft priority queue is a type of priority queue which is allowed to make mistakes.
|
| Class | Description |
|---|---|
| BinaryHeap<T> | |
| FibonacciHeap<T> | |
| KAryHeap<T> | |
| SoftHeap<T> |
The soft heap, first described by Chazelle, is an approximate data structure similar to a priority queue.
|