On 3/12/07, Anton A. Patrushev <anton@orkney.co.jp> wrote:

Hi,

I wonder if there is a way to put edge descriptors into Mutable Queue? So far it looks like it can handle only vertex descriptors. Am I right?

The queue can handle everything, as long as you supply it with a compare function and an identity function, so you'd need an edge index as identity and sth that compares two edge descriptors according to their weight (if that's what you want), some functor with a reference to an edge weight map implementing http://www.sgi.com/tech/stl/StrictWeakOrdering.html would do. I don't have the time to construct an example atm, but this should work. hth, moritz -- Moritz Hilger Combinatorial Optimization & Graph Algorithms TU Berlin +49 30 314-25773