Re: [Boost-bugs] [Boost C++ Libraries] #3506: Graph's Tour / Dijkstra's parent nodes

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #3506: Graph's Tour / Dijkstra's parent nodes
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2009-10-04 01:50:49

#3506: Graph's Tour / Dijkstra's parent nodes
--------------------------------------+-------------------------------------
  Reporter:  JDKunkMailing@…          |       Owner:  asutton
      Type:  Bugs                     |      Status:  closed 
 Milestone:  Boost 1.41.0             |   Component:  graph  
   Version:  Boost 1.40.0             |    Severity:  Problem
Resolution:  fixed                    |    Keywords:         
--------------------------------------+-------------------------------------
Changes (by jewillco):

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

Comment:

 This does appear to be a bug in the example -- there is a special
 null_vertex() value that is used to mark invalid vertices.  I changed the
 code to use that, but it is probably not a good idea to look at the
 predecessor of the start vertex anyway.  I do not believe the visitor ever
 sets the predecessor since it never has an edge coming in that is
 discovering the start vertex.

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