Changeset 50206

Timestamp:

Dec 8, 2008, 7:03:20 PM (14 years ago)

Author:

Andrew Sutton

Message:

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.

(No files)