Priority Queue in C# with the Help of Heap Data Structure

Alexey Kurakin

Rate me:

4.89/5 (14 votes)

29 May 2011CPOL3 min read

134.3K

This article describes generic priority queue implementation in C#, which uses min-heap as underlying storage.

Alternatives

Members may post updates or alternatives to this current article in order to show different approaches or add new features.

No alternatives have been posted.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Written By

Alexey Kurakin

Russian Federation

My name is Alexey.

I am PhD student at MIPT in the area of Computer Vision. In 2009, I am obtained MS degree in the area of Data Mining and Machine Learning. Besides my scientific interests, I am fond of creating complicated software and solve difficult technical problems.

I am experienced C# developed. Also I have skills in Matlab, C++, Assembler and some other programming languages.

Priority Queue in C# with the Help of Heap Data Structure

Alternatives

License

Comments and Discussions