Re: [Boost-bugs] [Boost C++ Libraries] #4731: Documentation for dijkstra shortest path is wrong

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #4731: Documentation for dijkstra shortest path is wrong
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2010-10-13 13:47:57

#4731: Documentation for dijkstra shortest path is wrong
------------------------------------------------------+---------------------
  Reporter:  Markus Pilman <mpilman@…>                |       Owner:  asutton                                               
      Type:  Bugs                                     |      Status:  new                                                   
 Milestone:  To Be Determined                         |   Component:  graph                                                 
   Version:  Boost 1.44.0                             |    Severity:  Problem                                               
Resolution:                                           |    Keywords:  bgl graph dijaksta shortest path minimum spanning tree
------------------------------------------------------+---------------------

Comment (by asutton):

 I agree. The search tree computed by SP algorithm is not guaranteed to be
 a MST. Updated the documentation to describe the results in terms of a
 "search tree" with a statement claiming that it is not guaranteed to be an
 MST.

 Changes in r65939.

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