Re: [Boost-users] performance issue with graph edge removal

Doug Gregor writes:

Yes, we can definitely provide a clear_all_edges() function. We can't change the default trade-off that favors smaller memory consumption over efficiency of edge removal, but we might be able to devise a way to tell adjacency_list to favor insert/removal performance over memory consumption.

Maybe a fast answer would be to copy just the vertices to a new graph? Just a thought. -- Dave Abrahams Boost Consulting www.boost-consulting.com