[boost] Graph: remove_edge(g, e)

From: jeremy siek (jsiek_at_[hidden])
Date: 2000-09-27 00:33:30

Hi Doug,

For implementation reasons (and perhaps also for STL similarity
reasons), it would be easier to create the function:

remove_edge(graph, out_edge_iterator)

instead of:

remove_edge(graph, edge_descriptor)

Would the out_edge_iterator version also fulfill your needs?

Cheers,

jeremy

jsiek_at_[hidden] writes:
 > 
 > Forwarded feature request for the graph library...
 > 
 > ggcl_at_[hidden] writes:
 >  > From: doug.larrick_at_[hidden]
 >  > To: ggcl_at_[hidden]
 >  > Subject: suggestion: remove single edge from multigraph
 >  > 
 >  > Hi,
 >  > 
 >  > We're using ggcl for a new project in the VLSI CAD group of Compaq's Alpha
 >  > microprocessor group.  Thanks for making it available!
 >  > 
 >  > The particular application requires a multigraph, and requires the ability to
 >  > remove a single edge without disturbing the other edges between the two vertices
 >  > 
 >  > in question.
 >  > 
 >  > Ggcl's remove_edge function (for adjacency_list) removes all edges between the 
 >  > two vertices specified.  In the code, I notice that remove_edge that takes an
 >  > edge 
 >  > descriptor is not yet implemented.  I would like to request that this function 
 >  > be implemented, with care given to the case of a multigraph.
 >  > 
 >  > I have worked around this shortcoming by saving off the duplicate edges and 
 >  > restoring them after the remove, so my need for a fix is not urgent.
 >  > 
 >  > Thanks for your time.
 >  > 
 >  > Doug Larrick
 >  > Compaq Alpha CAD
 >  > 
 > 
 > 
 > 
 >