[SVN r85813]
[SVN r58554]
[SVN r52403]
[SVN r50314]
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]
