|
Boost : |
From: Jeremy Siek (jsiek_at_[hidden])
Date: 2004-06-30 10:30:24
Hi Volodya,
On Apr 19, 2004, at 8:59 AM, Vladimir Prus wrote:
>
> 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 file is no longer there. Can you post it?
> 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
>
> _______________________________________________
> Unsubscribe & other changes:
> http://lists.boost.org/mailman/listinfo.cgi/boost
>
_______________________________________________
Jeremy Siek <jsiek_at_[hidden]>
http://www.osl.iu.edu/~jsiek
Ph.D. Student, Indiana University Bloomington
C++ Booster (http://www.boost.org)
_______________________________________________
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk