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-14 15:38:22

#4731: Documentation for dijkstra shortest path is wrong
------------------------------------------------------+---------------------
  Reporter:  Markus Pilman <mpilman@…>                |       Owner:  asutton                                               
      Type:  Bugs                                     |      Status:  reopened                                              
 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):

 It may be the case that such descriptions are more precise, but I feel
 that they are unnecessary. I may consider redefining it as "the tree
 computed by the algorithm" rather than "traversal", but I'm not going to
 try to be more specific.

 The reason is that those specific properties of the tree are imposed by
 the completion of the algorithm--not guaranteed by tree itself. If the
 algorithm fails to complete or is terminated early, by exception for
 example, neither description would be correct. However, a search tree on
 input will still be a search tree on output, regardless of the termination
 state of the algorithm.

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