Boost logo

Boost Users :

From: Douglas Gregor (doug.gregor_at_[hidden])
Date: 2006-09-20 08:17:24


On Sep 19, 2006, at 1:20 PM, Young, Michael wrote:

> I am a newbie to BGL - actually, I'm just beginning to build
> examples with it.
> However, I have read the first 4 chapters of "the book", and I've
> searched the documentation, and I
> haven't seen a way to reverse a specific edge within a directed
> (bidirectional) graph. Is there anyway to do this
> without removing the original edge and then adding the "reversed"
> edge? I have an application that requires
> such a "flip" of particular edges at times, but remove/add seems to
> be a bit "heavyweight" in terms of
> computation, especially when I already have identified the edge and
> have it accessible via an iterator.

Unfortunately, none of the BGL graph types has such a "flip"
operation. I think you might be stuck removing the original edge then
adding the reversed edge.

        Doug


Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net