From: Douglas Gregor (doug.gregor_at_[hidden])
Date: 2007-03-16 09:01:37
On Mar 16, 2007, at 6:00 AM, Florian Teichert wrote:
> At the moment I search an unsorted linear list O(|V|) times -- so I
> would benefit from every other structure ... what would you suggest?
> Some standard binary heap? The mutable_queue looked good to me but
> one is pending, too ...
Both the mutable_queue and the relaxed_heap are well-tested and
should improve performance over your list-based implementation.
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