#Not supported Moved to https://github.com/dshulepov/DataStructures
##ConcurrentPriorityQueue
C# implementation of generic heap-based concurrent priority queue for .NET
Priority queue is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it. In a priority queue, an element with high priority is served before an element with low priority. If two elements have the same priority, they are served according to their order in the queue.
###Features
- Generic
- Concurrent (i.e. supports multi-threading)
- Performant (
O(n) = nlog(n)for enqueue and dequeue ) - Fixed size support (items are dequeued before enqueueing when queue is full)
- Resizing support (queue grows and shrinks depending on the number of items)
- Alter priority of already enqueued item
###NuGet
- Install
PM> Install-Package PriorityQueue - https://www.nuget.org/packages/PriorityQueue
###Applications
- Bandwidth management
- Discrete event simulation
- Huffman coding
- Best-first search algorithms
- ROAM triangulation algorithm
- Dijkstra's algorithm
- Prim's Algorithm for Minimum Spanning Tree
##License Released under the MIT license.