A custom priority queue implementation using a binary heap in C#. Written for a personal/club project. It (as far as I know) conforms to most .NET standards. Not thread-safe.
This code was converted from a java project into something that takes advantage of C#'s feature set and that is more architecturally sound.
While the original java code was extensively tested for correctness, I have not (yet!) written a comprehensive test suite for this code. All of the algorithms and the logic behind them should be perfectly correct, however.
UPDATE 3/20: I have written a program that tests the PriorityQueue with signed integer inputs. A suite of basic tests has been completed and passed. While more testing - expecially of object types - is needed, I can now confidently say that the core functionality of the PriorityQueue and its associated algorithms has been implemented correctly.
Simply download or fork this repository and add PriorityQueue.cs to your project's solution. For Unity users, copy PriorityQueue.cs into the unity project's Assets folder. Usage instructions can be found in the code's documentation comments. (Also, don't forget to add the using DotNETPriorityQueue directive to the files in which you want to use the PriorityQueue.)
My attempt at an open source contribution. For a Unity game project of mine, one of the algorithms I wanted to implement required the use of a priority queue; however, .NET does not provide a default implementation of one. The result is my very own attempt at writing an efficient, feature-complete, generic, and .NET compliant PriorityQueue using C#. It's probably not perfect, but I intend to improve it with time.
This repository is licensed under the Apache License 2.0.