# HG changeset patch
# User deba
# Date 1173200235 0
# Node ID 5e5ca8ac5a8fb6a1d77124c5c71ac2e637f2ad67
# Parent  4bbeaf115cdbc03843cefd9ff79ee52d14ca9835
Bug fix
from Kovacs Peter

diff -r 4bbeaf115cdb -r 5e5ca8ac5a8f lemon/bellman_ford.h
--- a/lemon/bellman_ford.h	Mon Mar 05 17:10:58 2007 +0000
+++ b/lemon/bellman_ford.h	Tue Mar 06 16:57:15 2007 +0000
@@ -524,7 +524,7 @@
     /// - The shortest path tree.
     /// - The distance of each node from the root(s).
     bool checkedStart() {
-      int num = countNodes(*graph) - 1;
+      int num = countNodes(*graph);
       for (int i = 0; i < num; ++i) {
 	if (processNextWeakRound()) return true;
       }