PriorityQueueK-karasan NuGet Package

The elements of the priority queue are ordered according to their natural ordering, or by a Comparator provided at queue construction time.

A priority queue does not permit null elements. A priority queue relying on natural ordering also does not permit insertion of non-comparable objects.
A priority queue is unbounded, but has an internal capacity governing the size of an array used to store the elements on the queue.

It is always at least as large as the queue size. As elements are added to a priority queue, its capacity grows automatically.