From: David Abrahams (david.abrahams_at_[hidden])
Date: 2002-01-15 21:29:21
----- Original Message -----
From: "Jeremy Siek" <jsiek_at_[hidden]>
> Currently the user-supplied IndexMap is read-only, and for graph types
> that use integers for the vertex_descriptor type, the IndexMap is just an
> identity function on the key. I think it might be better to stick with the
> color map abstraction for this (or the new one that allows generational
Oh, I guess I didn't understand the IndexMap. So what's in the mutable_queue
currently? Just vertex indices? How do you find the entry in the
priority_queue when it comes time to relax?
> > Reducing the size of the queue just makes the case stronger for keeping
> > distances and predecessors in the queue, at least if the user doesn't
> > to make a record of them.
> Yes, I like the idea of storing the distances and predecessors in the
> queue. I'll do a prototype implementation if you're interested.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk