The Priority Queue

Jun 19, 2008 at 5:25 PM
To run Dijkstra's algorithm, you will need to use a priority queue that uses a min-heap.  You can find a C# implementation online.   Here is an implementation that has been used before.  It needs to be modified so that it uses a min-heap instead of a max-heap.

Also, you will probably need to alter the priority queue so that it can perform the decrease-key operation on non-root nodes as described in the text (p. 135).