Bounded Node Priority QueuesThe data type b_node_pq<N> is a priority queue of nodes with integer priorities. The size of the interval containing all priorities is restricted to at most N, that is, the priorities can be in the interval[i,i+N] . b_node_pq<N> is a specialized version of
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
Disadvantages
Tips

See also: 