 | Slash.Collections.PriorityQueues Namespace |
[Missing <summary> documentation for "N:Slash.Collections.PriorityQueues"]
Classes| Class | Description | |
|---|---|---|
 | FibonacciHeap<T> |
Very fast priority queue. Provides insertion, finding the minimum,
melding and decreasing keys in constant amortized time, and deleting
from an n-item heap in O(log n) amortized time.
|
| FibonacciHeapItem<T> |
Container for an item that can be inserted into a Fibonacci heap.
Provides a pointer to its heap position and a key for comparing it to
other heap items for order.
|
Interfaces| Interface | Description | |
|---|---|---|
 | IPriorityQueue<T> |
Ordered data structure that is optimized for finding the minimum item.
|
| IPriorityQueueItem<T> |
Container for an item that can be inserted into a priority queue.
Provides a key for comparing it to other items for order.
|