Bounded Node Priority Queues

In a Node Priority Queue the node with the minimum priority can be accessed very efficiently.

Example of how to use a bounded node priority queue

Strengths

• even more efficient than node priority queues

Disadvantages

• size of the interval containing all priorities is restricted to at most N
• minimum priority can not be decreased
• every node may be contained in the queue at most once.
• very restricted interface, operations are tailored for Dijkstra's shortest path algorithm

Tips

• Prefer bounded node priority queues to node priority queues if possible.

See also:

Node Priority Queues

Priority Queues

Manual Page Bounded Node Priority Queues