Andrew Sutton 9ad0c6a23c 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.


[SVN r50206]

2008-12-08 19:03:20 +00:00

..

boost

Fixed #1622. A viable solution relies on the fact that incident edges in a

2008-12-08 19:03:20 +00:00