id,summary,reporter,owner,description,type,status,milestone,component,version,severity,resolution,keywords,cc
1622,Adjacency list needs to handle self-edges correctly,Aaron Windsor,Andrew Sutton,"The following short program crashes as of boost 1.35:


#include <boost/graph/adjacency_list.hpp>

int main()
{
    using namespace boost;
    typedef adjacency_list<vecS, vecS, undirectedS > graph_t;
    graph_t g(5);
    add_edge(2, 2, g);
    remove_edge(2, 2, g);
}

The problem is that (2,2) is stored once in the list of edges in the graph and twice in the list of adjacent edges to the vertex 2. When remove_edge is called, the global graph edge (2,2) is deleted twice, causing a segfault. This problem is discussed in the following thread: http://lists.boost.org/Archives/boost/2007/02/116547.php.",Bugs,closed,Boost 1.36.0,graph,Boost 1.34.1,Problem,fixed,,