13,291,503 members (67,946 online)
alternative version

#### Stats

187K views
55 bookmarked
Posted 28 Mar 2004

# Priority queue

, 28 Mar 2004
 Rate this:
Another addition to the System.Collections namespace - a priority queue, also known as a heap.

## Introduction

Many algorithms - for instance Dijkstra's well-known search for the shortest path - run most efficient with a 'semi-sorted' list, which always has the smallest element up front. The most efficient structure for this purpose is a heap, also called priority queue.

## Usage

The `PriorityQueue` class is built in the guidelines of the `System.Collections` namespace. Comparison is done through the `IComparer` interface, or, if none is specified, through the `IComparable` implementation of the provided objects. The objects in the PQ need not have all the same type but they have to be comparable with each other.

Next to the standard `System.Collections` methods (`Count`, `Contains`, ... you name it), the PQ supports 3 main operations:

• `Push()`: This will add an object to the PQ, reforming the structure so that this element is at the front if it is the currently smallest. The complexity of the operation is O(ld n).
• `Pop()`: This will remove and return the current head of the PQ, which always is the smallest element. Complexity O(ld n).
• `Update()`: It might be necessary to change elements that are already in the queue. Because this is not very common (you need to find the element first), it can only be done by the explicit `IList` implementation (the indexer should not be used in any other case). Once you set the indexer, the PQ will automatically reorder. Complexity O(ld n) (surprise;))

## Example

```/// We create a PQ, add some random numbers and retreive them in sorted order:

IPriorityQueue PQ = new BinaryPriorityQueue();
Random R = new Random();
int i;
for(i=0;i<50;i++)
{
PQ.Push(R.Next(1000));
}
while(PQ.Count>0)
Console.WriteLine(PQ.Pop());```

## History

• 30.3.04 - Inserted.
• 31.3.04 - renamed the main class to `BinaryPriorityQueue`.

Created `IPriorityQueue` interface.

A list of licenses authors might use can be found here

## Share

 Software Developer (Senior) Germany
I did my diploma in Dresden and Sydney where I dealt with algorithms, agents and other cool AI stuff. Now I moved to Frankfurt to work on my PhD dealing with software structures for artificial intelligence systems. If I can, I do things in C# and ASP.NET, but if I have to, my C++, Java and SQL are not that bad.
Long Live .NET.

## You may also be interested in...

 FirstPrev Next
 Re: What is wrong with Queue? sandeman2-Apr-04 15:00 sandeman 2-Apr-04 15:00
 Re: What is wrong with Queue? BenDi2-Apr-04 22:57 BenDi 2-Apr-04 22:57
 Your PriorityQueue code converted to Visual Basic Enigmativity30-Mar-04 23:51 Enigmativity 30-Mar-04 23:51
 Re: Your PriorityQueue code converted to Visual Basic BenDi31-Mar-04 1:14 BenDi 31-Mar-04 1:14
 Care to join a "all collection" project ? Jonathan de Halleux30-Mar-04 3:20 Jonathan de Halleux 30-Mar-04 3:20
 Re: Care to join a "all collection" project ? Jonathan de Halleux30-Mar-04 3:31 Jonathan de Halleux 30-Mar-04 3:31
 Re: Care to join a "all collection" project ? BenDi30-Mar-04 4:16 BenDi 30-Mar-04 4:16
 Re: Care to join a "all collection" project ? Jonathan de Halleux30-Mar-04 4:27 Jonathan de Halleux 30-Mar-04 4:27
 Re: Care to join a "all collection" project ? BenDi2-Apr-04 23:45 BenDi 2-Apr-04 23:45
 Re: Care to join a "all collection" project ? Jonathan de Halleux3-Apr-04 1:41 Jonathan de Halleux 3-Apr-04 1:41
 Re: Care to join a "all collection" project ? Jonathan de Halleux3-Apr-04 8:51 Jonathan de Halleux 3-Apr-04 8:51
 Re: Care to join a "all collection" project ? Jonathan de Halleux2-Apr-04 4:46 Jonathan de Halleux 2-Apr-04 4:46
 Which heap ? Jonathan de Halleux29-Mar-04 12:15 Jonathan de Halleux 29-Mar-04 12:15
 Re: Which heap ? BenDi30-Mar-04 3:55 BenDi 30-Mar-04 3:55
 Re: Which heap ? Jonathan de Halleux30-Mar-04 4:00 Jonathan de Halleux 30-Mar-04 4:00
 Re: Which heap ? BenDi30-Mar-04 4:24 BenDi 30-Mar-04 4:24
 Last Visit: 31-Dec-99 19:00     Last Update: 12-Dec-17 19:45 Refresh « Prev12