Subject: [boost] [Graph][Parallel][PBGL] Bug deleting self loop edges
From: bminano (bminyano_at_[hidden])
Date: 2013-03-07 05:12:50
I think I found a bug in the graph parallel library.
I have a bidirectional adjacency list which has some self loop edges.
When I try to delete them with remove_edge_if (or remove_out_edge_if or
remove_in_edge_if) the edges are deleted, but it seems that some reference
gets broken in the graph.
If I iterate over the in_edges a reference to a self loop is found. But it
does not happen if I iterate over the out_edges.
If the graph is written in a graphviz file the self loop edges does not
I think there is some broken reference into the adjacency list that keeps
I have two different pieces of code (one with pbgl and the other with bgl).
They do the same, create a graph, delete the self-edges and print the
Could someone have a look at this problem? We want to use this library in
our research but with this problem will not be possible.
-- View this message in context: http://boost.2283326.n4.nabble.com/Graph-Parallel-PBGL-Bug-deleting-self-loop-edges-tp4643903.html Sent from the Boost - Dev mailing list archive at Nabble.com.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk