From: Florian Teichert (floteich_at_[hidden])
Date: 2007-03-15 07:52:53
is there anybody out there using the fibonacci_heap.hpp?
I have a working implementation of dijkstra's shortest path algorithm
and was trying to use fibonacci_heap from boost/pending to optimize its
To me it seems that it is not working properly. A key feature of this
structure is that it should be possible to mix 'pop' and 'update' calls
-- but, unfortunatly, after the first call to pop I get arbitrary
indices from the heap. Some are even popped more than once.
I am using the most recent CVS version.
Can anyone help me here?
Thanks in advance
Boost list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk