Bug deleting self loop edges in parallel code

[Borja Miñano <bminyano@…>]

Hello,

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 appear.

I think there is some broken reference into the adjacency list that keeps the in_edges.

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 in_edges.

Could someone have a look at this problem?

Thank you

[Borja Miñano <bminyano@…>]

Parallel bgl in_egdes code

[Borja Miñano <bminyano@…>]

bgl monoprocessor in_edge code (working)

[bminyano@…]

Patch for remove_in_edge

[bminyano@…]

I propose a patch for this bug. The problem was in remove_in_edge from the distributed adjacency list. The "while" condition had a problem that deleted always the first in_edge in some cases.