Boost C++ Libraries: Ticket #1622: Adjacency list needs to handle self-edges correctly

status changed

Aaron Windsor — Sun, 10 Feb 2008 21:11:28 GMT

status new → assigned

owner, status changed

Andrew Sutton — Mon, 08 Dec 2008 15:39:54 GMT

owner changed from Aaron Windsor to Andrew Sutton
status assigned → new

Removing the loop using remove_edge(e, g) does not seem to trigger the same segfault.

status changed; resolution set

Andrew Sutton — Mon, 08 Dec 2008 19:03:22 GMT

status new → closed
resolution → fixed

(In [50206]) Fixed #1622. A viable solution relies on the fact that incident edges in a loop are stored adjacently in the out edge list of the vertex. A simple modification of the global edge erasing loop for undirected graphs will skip the next iterator if both the current and next contain the same iterator.