From: T (scream29125_at_[hidden])
Date: 2003-02-13 06:34:33
I am implementing an algorithm that requires a heap.
In my algorithm, I need to do two operations, similar
to that required by Dijkstra's algorithm:
1. Use a secondary array to index the nodes of the
heap. This is so that a node in the heap can be found
in constant time.
2. Decrease the key (priority) of a node in the heap.
The Boost heap implementation
supports the decrease-key operation. But reading the
documentation, I'm not sure if the first requirement
is satisfied. If I index the nodes using iterators,
then what I require is for these iterators to be valid
even after the heap is changed, eg after insertion,
deletion or decreasing the key. Is that the case?
Do you Yahoo!?
Yahoo! Shopping - Send Flowers for Valentine's Day
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk