Re: [Boost-users] Removing edges using remove_edge in adjacency list

Subject: Re: [Boost-users] Removing edges using remove_edge in adjacency list
From: Cedric Laczny (cedric.laczny_at_[hidden])
Date: 2010-11-02 04:39:38

On Monday, 1. November 2010 22:41:12 Trevor Harmon wrote:
> On Nov 1, 2010, at 12:29 PM, giridhar wrote:
> > Now I want to remove the edges that has been found by Dijkstra's
> > algorithm
> 
> Care must be taken when removing edges during iteration. Have you read
> the section on "Iterator and Descriptor Stability/Invalidation" in
> libs/graph/doc/adjacency_list.html?

For that reason, I would recommend to use a filtered_graph and "hide" the edges 
instead of removing them. If you have questions about using filtered_graph, 
please feel free to ask.

> Trevor
> 

Best,

Cedric

> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users