Re: [Boost-bugs] [Boost C++ Libraries] #1622: Adjacency list needs to handle self-edges correctly

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #1622: Adjacency list needs to handle self-edges correctly
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2008-12-08 19:03:23

#1622: Adjacency list needs to handle self-edges correctly
----------------------------+-----------------------------------------------
  Reporter:  aaron_windsor  |       Owner:  asutton
      Type:  Bugs           |      Status:  closed 
 Milestone:  Boost 1.36.0   |   Component:  graph  
   Version:  Boost 1.34.1   |    Severity:  Problem
Resolution:  fixed          |    Keywords:         
----------------------------+-----------------------------------------------
Changes (by asutton):

  * status:  new => closed
  * resolution:  => fixed

Comment:

 (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.

-- 
Ticket URL: <https://svn.boost.org/trac/boost/ticket/1622#comment:3>
Boost C++ Libraries <http://www.boost.org/>
Boost provides free peer-reviewed portable C++ source libraries.