From 433848820b45814805e37ed49944a00783783300 Mon Sep 17 00:00:00 2001
From: Douglas Gregor <doug.gregor@gmail.com>
Date: Tue, 29 May 2007 16:53:05 +0000
Subject: Fix handling of overflow in shortest-path algorithms

[SVN r37814]
---
 index.htm | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

(limited to 'index.htm')

diff --git a/index.htm b/index.htm
index 8381a8248f..ea116c2417 100644
--- a/index.htm
+++ b/index.htm
@@ -345,6 +345,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
@@ -354,7 +359,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>
-- 
cgit v1.2.1