Re: [Boost-bugs] [Boost C++ Libraries] #5121: planar_face_traversal fails miserably on a planar, 3-connected graph

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #5121: planar_face_traversal fails miserably on a planar, 3-connected graph
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2011-03-06 16:54:22

#5121: planar_face_traversal fails miserably on a planar, 3-connected graph
-------------------------------------+--------------------------------------
  Reporter:  julian.pfeifle@…        |       Owner:  asutton    
      Type:  Bugs                    |      Status:  new        
 Milestone:  To Be Determined        |   Component:  graph      
   Version:  Boost 1.45.0            |    Severity:  Showstopper
Resolution:                          |    Keywords:             
-------------------------------------+--------------------------------------

Comment (by expaler):

 The algorithm requires an edge index map that already associates edges
 with distinct integers.  Simply defining an internal edge index map in the
 adjacency list type is not enough.  You must update the edge index map as
 you add edges to the graph.  The planar_face_traversal_nab.cc file shows
 the fix to your program.  The output is now:

 New face: 1 0 8 9 visitor done.
 New face: 0 1 7 6 visitor done.
 New face: 3 2 4 visitor done.
 New face: 2 3 6 5 visitor done.
 New face: 4 2 5 7 visitor done.
 New face: 3 4 9 8 visitor done.
 New face: 0 6 3 8 visitor done.
 New face: 5 6 7 visitor done.
 New face: 7 1 9 4 visitor done.

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