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

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. tim