Re: [boost] [graph][heap][coroutine] interruptable dijkstra shortest path function

Subject: Re: [boost] [graph][heap][coroutine] interruptable dijkstra shortest path function
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2012-09-23 12:25:00

On Sun, 23 Sep 2012, Tim Blechmann wrote:

>> c. Boost.Heap mutable queues can be used with Boost.Graph via the named
>> parameter interface. It doesn't help performance now,  but may be a good
>> base for experimentation.
>
> afaict, boost.heap should perform worse than the bgl heaps. its
> implementation is much more generic, while bgl heaps are optimized by
> assuming integer keys.

Actually, the BGL heaps can use arbitrary keys, as long as there is a way 
to map them to integers (which might involve some other lookup table).

-- Jeremiah Willcock