Changeset 2362:eb37b9774ef6 in lemon-0.x

Timestamp:

02/15/07 14:06:23 (17 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3173

Message:

Small changes

File:

• lemon/bellman_ford.h (modified) (3 diffs)

lemon/bellman_ford.h

@@ -525 +525 @@
     /// - The distance of each node from the root(s).
     bool checkedStart() {
-      int num = countNodes(*graph);
+      int num = countNodes(*graph) - 1;
       for (int i = 0; i < num; ++i) {
         if (processNextWeakRound()) return true;
       }
-      return false;
+      return _process.empty();
     }
 
@@ -585 +585 @@
     /// - The distance of each node from the root.
     ///
-    /// \note d.run(s, len) is just a shortcut of the following code.
+    /// \note d.run(s, num) is just a shortcut of the following code.
     ///\code
     ///  d.init();
     ///  d.addSource(s);
-    ///  d.limitedStart(len);
+    ///  d.limitedStart(num);
     ///\endcode
-    void run(Node s, int len) {
+    void run(Node s, int num) {
       init();
       addSource(s);
-      limitedStart(len);
+      limitedStart(num);
     }
     
@@ -609 +609 @@
     /// \brief Lemon iterator for get a active nodes.
     ///
-    /// Lemon iterator for get a active nodes. This class provides a
+    /// Lemon iterator for get the active nodes. This class provides a
     /// common style lemon iterator which gives back a subset of the
     /// nodes. The iterated nodes are active in the algorithm after