- Faster (for path-finding, at least) than any other C# priority queue out there!
- Easy to use
- No dependencies on third-party libraries
- Free for both personal and commercial use.
- Implements
IEnumerable<T>for LINQ support! - Is a stable priority queue - that is, if two items are are enqueued with the same priority, they'll be dequeued in the same order they were enqueued.
- Takes advantage of the new forced inline support when compiling under .Net 4.5, for even faster speeds.
- Should work on .Net versions as old as .Net 2.0
Yes! See the license page for more details.
Check out the Getting Started page for a quick tutorial. Or, take a look at the Priority Queue Example project in the repository.