Changeset 1741:7a98fe2ed989 in lemon-0.x for lemon/belmann_ford.h

Timestamp:

10/26/05 12:50:47 (19 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

Some modifications on shortest path algoritms:

• heap traits
• checked execution

File:

• lemon/belmann_ford.h (modified) (4 diffs)

lemon/belmann_ford.h

@@ -413 +413 @@
       int num = countNodes(*graph) - 1;
       for (int i = 0; i < num; ++i) {
-        bool ready = true;
+        bool done = true;
         for (EdgeIt it(*graph); it != INVALID; ++it) {
           Node source = graph->source(it);
@@ -422 +422 @@
             _pred->set(target, it);
             _dist->set(target, relaxed);
-            ready = false; 
+            done = false; 
           }
         }
-        if (ready) return;
-      }
-    }
-
-    /// \brief Executes the algorithm and check the negative circles.
+        if (done) return;
+      }
+    }
+
+    /// \brief Executes the algorithm and checks the negative circles.
     ///
     /// \pre init() must be called and at least one node should be added
@@ -443 +443 @@
       int num = countNodes(*graph);
       for (int i = 0; i < num; ++i) {
-        bool ready = true;
+        bool done = true;
         for (EdgeIt it(*graph); it != INVALID; ++it) {
           Node source = graph->source(it);
@@ -452 +452 @@
             _pred->set(target, it);
             _dist->set(target, relaxed);
-            ready = false; 
+            done = false; 
           }
         }
-        if (ready) return true;
+        if (done) return true;
       }
       return false;