Skip to content
A C# priority queue optimized for pathfinding applications
Branch: master
Clone or download
Latest commit 621d0e2 Nov 18, 2018
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
Priority Queue Benchmarks
Priority Queue Example Renamed PriorityQueueNode to FastPriorityQueueNode Jan 4, 2016
Priority Queue PCL Updated to version 4.2.0 Nov 18, 2018
Priority Queue Tests Added ResetNode() method, 'Queue' variable for debug mode Nov 18, 2018
Priority Queue UWP Updated to version 4.2.0 Nov 18, 2018
Priority Queue Unity Full Updated to version 4.2.0 Nov 18, 2018
Priority Queue Unity Subset Updated to version 4.2.0 Nov 18, 2018
Priority Queue
.gitignore
LICENSE.txt
Priority Queue.sln
README.md Remove extra "are" in text Sep 28, 2016

README.md

High Speed Priority Queue for C#

Features

  • 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!
  • Fully unit-tested
  • Has a stable priority queue implementation (ie. if two items 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
  • Published to NuGet - can easily be added to any project
  • Should work on .Net versions as old as .Net 2.0

Is this software free?

Yes! See the license page for more details.

Getting Started

This project contains two priority queue implementations - one that's super-fast (without thread-safety, safety checks, etc), and one that's easy/safe to use.

See the Getting Started page, or decide what type of queue you want:

You can’t perform that action at this time.