1.1 --- a/lemon/bellman_ford.h	Wed Feb 14 13:50:25 2007 +0000
     1.2 +++ b/lemon/bellman_ford.h	Thu Feb 15 13:06:23 2007 +0000
     1.3 @@ -524,11 +524,11 @@
     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.8 +      int num = countNodes(*graph) - 1;
     1.9        for (int i = 0; i < num; ++i) {
    1.10  	if (processNextWeakRound()) return true;
    1.11        }
    1.12 -      return false;
    1.13 +      return _process.empty();
    1.14      }
    1.15  
    1.16      /// \brief Executes the algorithm with path length limit.
    1.17 @@ -584,16 +584,16 @@
    1.18      /// - The shortest path tree.
    1.19      /// - The distance of each node from the root.
    1.20      ///
    1.21 -    /// \note d.run(s, len) is just a shortcut of the following code.
    1.22 +    /// \note d.run(s, num) is just a shortcut of the following code.
    1.23      ///\code
    1.24      ///  d.init();
    1.25      ///  d.addSource(s);
    1.26 -    ///  d.limitedStart(len);
    1.27 +    ///  d.limitedStart(num);
    1.28      ///\endcode
    1.29 -    void run(Node s, int len) {
    1.30 +    void run(Node s, int num) {
    1.31        init();
    1.32        addSource(s);
    1.33 -      limitedStart(len);
    1.34 +      limitedStart(num);
    1.35      }
    1.36      
    1.37      ///@}
    1.38 @@ -608,7 +608,7 @@
    1.39  
    1.40      /// \brief Lemon iterator for get a active nodes.
    1.41      ///
    1.42 -    /// Lemon iterator for get a active nodes. This class provides a
    1.43 +    /// Lemon iterator for get the active nodes. This class provides a
    1.44      /// common style lemon iterator which gives back a subset of the
    1.45      /// nodes. The iterated nodes are active in the algorithm after
    1.46      /// the last phase so these should be checked in the next phase to