1.1 --- a/lemon/bellman_ford.h	Mon Mar 05 17:10:58 2007 +0000
     1.2 +++ b/lemon/bellman_ford.h	Tue Mar 06 16:57:15 2007 +0000
     1.3 @@ -524,7 +524,7 @@
     1.4      /// - The shortest path tree.
     1.5      /// - The distance of each node from the root(s).
     1.6      bool checkedStart() {
     1.7 -      int num = countNodes(*graph) - 1;
     1.8 +      int num = countNodes(*graph);
     1.9        for (int i = 0; i < num; ++i) {
    1.10  	if (processNextWeakRound()) return true;
    1.11        }