Namespace AlgorithmsSW.PriorityQueue
Classes
- FixedCapacityMinBinaryHeap<T>
A container that allows efficient insertions and retrieval of the minimum element.
- IndexPriorityQueue<T>
Represents a generic index-based priority queue where elements are ordered based on their priority determined by an IComparer.
- MedianDoubleHeap<T>
Container that supports efficient insertions and retrieval and removal of the median element in the container.
- ResizeableMinBinaryHeap<T>
A container that allows efficient insertions and retrieval of the minimum element, growing as needed.