|
Boost : |
From: Vladimir Prus (ghost_at_[hidden])
Date: 2004-04-19 08:59:31
Jeremy,
I think your reversion 1.120 of detail/adjacency_list.hpp:
2004-04-01 05:30 jsiek
* detail/adjacency_list.hpp: fixed remove_edge for bidirectional
graphs
actually breaks remove_edge in a different way. Please take a look at
http://zigzag.cs.msu.su:7813/program_graph.cpp
The code there add two vertices, an edge between them, and then removes the
edge. After that 'num_edges' returns 1, not 0 as expected. I seems like now
remove_edge removes elements from out_edges and in_edges storage, but not
from global edges vector.
Is it possible to fix this problem?
TIA,
Volodya
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk