[Boost-bugs] [Boost C++ Libraries] #1009: Improper overflow handling in shortest paths algorithms

Subject: [Boost-bugs] [Boost C++ Libraries] #1009: Improper overflow handling in shortest paths algorithms
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2007-05-29 15:18:48

#1009: Improper overflow handling in shortest paths algorithms
----------------------------+-----------------------------------------------
 Reporter:  dgregor         |       Owner:  dgregor
     Type:  Bugs            |      Status:  new    
Milestone:                  |   Component:  graph  
  Version:  release 1.34.0  |    Severity:  Problem
 Keywords:                  |  
----------------------------+-----------------------------------------------
 As reported here

   http://lists.boost.org/boost-users/2007/05/28205.php


 the Bellman-Ford shortest paths algorithm fails to compute correct results
 in some graphs containing negative cycles. The cause of the problem is the
 incorrect overflow handling in closed_plus, which is used to relax edges
 in the graph. The attached patch fixes the problem.

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