[Boost-bugs] [Boost C++ Libraries] #1700: graph/floyd_warshall_shortest.hpp.patch

Subject: [Boost-bugs] [Boost C++ Libraries] #1700: graph/floyd_warshall_shortest.hpp.patch
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2008-03-20 05:59:15

#1700: graph/floyd_warshall_shortest.hpp.patch
------------------------------+---------------------------------------------
 Reporter:  eric80_at_[hidden]  |       Owner:  dgregor
     Type:  Patches           |      Status:  new    
Milestone:  Boost 1.36.0      |   Component:  graph  
  Version:  Boost 1.34.1      |    Severity:  Problem
 Keywords:                    |  
------------------------------+---------------------------------------------
 The "floyd_warshall_dispatch" function sometimes tries to pass in an edge
 weight of infinity into the "combine" function in line 68, resulting in
 the wrong computational result if you use the default "combine" function.
 The correct behavior is to check the edge weights and if either of
 d[*i][*k] or d[*k][*j] is infinity, to skip the distance matrix update.
 Attached is the patch.

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