Index: index.htm
===================================================================
RCS file: /cvsroot/boost/boost/index.htm,v
retrieving revision 1.266.2.21
diff -u -r1.266.2.21 index.htm
--- index.htm	9 May 2007 04:39:43 -0000	1.266.2.21
+++ index.htm	29 May 2007 15:37:27 -0000
@@ -341,6 +341,11 @@
                               <tt>vis.initialize_vertex</tt> for each vertex
                               during initialization.</li>
 
+			      <li><a
+			      href="libs/graph/doc/bellman_ford_shortest.html"><tt>bellman_ford_shortest_paths</tt></a>:
+			      fixed a bug where certain negative
+			      cycles were not correctly detected.</li>
+
 			      <li><b>Note:</b> the name of the
 			      compiled library for the <a
 			      href="libs/graph/doc/read_graphviz.html">GraphViz
@@ -350,7 +355,7 @@
 			      conventions.</li>
 
                               <li>See the <a href=
-                              "libs/graph/doc/history.html#1.34.0">complete
+                              "libs/graph/doc/history.html#1.34.1">complete
                               revision history</a> for more information.</li>
                             </ul>
                           </li>
Index: libs/graph/doc/history.html
===================================================================
RCS file: /cvsroot/boost/boost/libs/graph/doc/history.html,v
retrieving revision 1.35.2.3
diff -u -r1.35.2.3 history.html
--- libs/graph/doc/history.html	15 Dec 2006 13:35:08 -0000	1.35.2.3
+++ libs/graph/doc/history.html	29 May 2007 15:37:27 -0000
@@ -76,6 +76,10 @@
 <h2>Changes by version</h2>
 <a name="by-version">
 <ul>
+  <a name="1.34.1"></a><li>Version 1.34.1</br><b>Bug Fixes</b><br>
+  <ul>
+     <li><a href="bellman_ford_shortest.html"><tt>bellman_ford_shortest_paths</tt></a>: fixed a bug where certain negative cycles were not correctly detected.</li>
+  </ul>
   <a name="1.34.0"></a><li>Version 1.34.0<br><b>New algorithms and components</b>
     <ul>
       <li><a href="maximum_matching.html"><tt>edmonds_maximum_cardinality_matching</tt></a>, from Aaron Windsor.</li>
Index: boost/graph/relax.hpp
===================================================================
RCS file: /cvsroot/boost/boost/boost/graph/relax.hpp,v
retrieving revision 1.25
diff -u -r1.25 relax.hpp
--- boost/graph/relax.hpp	6 Feb 2006 22:12:57 -0000	1.25
+++ boost/graph/relax.hpp	29 May 2007 15:37:27 -0000
@@ -22,16 +22,13 @@
     template <class T>
     struct closed_plus
     {
-      // std::abs just isn't portable :(
-      template <class X>
-      inline X my_abs(const X& x) const { return x < 0 ? -x : x; }
-
       T operator()(const T& a, const T& b) const {
         using namespace std;
-        T inf = (numeric_limits<T>::max)();
-        if (b > 0 && my_abs(inf - a) < b)
-          return inf;
-        return a + b;
+	T zero(0);
+	T result = a + b;
+	if (result < zero && a >= zero && b >= zero)
+	  return (numeric_limits<T>::max)();
+	return result;
       }
     };