Boost Users :

Next message: Matthias Kronenberger: "Re: Is bellman_ford_shortest_paths supposed to work for undirected graphs?"
Previous message: joshrose: "BGL and reversing / moving edges"
In reply to: joshrose: "BGL and reversing / moving edges"
Next in thread: joshrose: "Re: BGL and reversing / moving edges"
Reply: joshrose: "Re: BGL and reversing / moving edges"

From: Matthias Kronenberger (mkronen_at_[hidden])
Date: 2002-07-25 09:55:27

You could use hash_setS or setS for the Edge_list.
This will allow you to remove edges and add edges without invalidating edge
iterators or edge descriptors.