diff -r 4cade8579363 -r 7a98fe2ed989 lemon/belmann_ford.h
--- a/lemon/belmann_ford.h	Mon Oct 24 17:03:02 2005 +0000
+++ b/lemon/belmann_ford.h	Wed Oct 26 10:50:47 2005 +0000
@@ -412,7 +412,7 @@
     void start() {
       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);
 	  Node target = graph->target(it);
@@ -421,14 +421,14 @@
 	  if (OperationTraits::less(relaxed, (*_dist)[target])) {
 	    _pred->set(target, it);
 	    _dist->set(target, relaxed);
-	    ready = false; 
+	    done = false; 
 	  }
 	}
-	if (ready) return;
+	if (done) return;
       }
     }
 
-    /// \brief Executes the algorithm and check the negative circles.
+    /// \brief Executes the algorithm and checks the negative circles.
     ///
     /// \pre init() must be called and at least one node should be added
     /// with addSource() before using this function. If there is
@@ -442,7 +442,7 @@
     bool checkedStart() {
       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);
 	  Node target = graph->target(it);
@@ -451,10 +451,10 @@
 	  if (OperationTraits::less(relaxed, (*_dist)[target])) {
 	    _pred->set(target, it);
 	    _dist->set(target, relaxed);
-	    ready = false; 
+	    done = false; 
 	  }
 	}
-	if (ready) return true;
+	if (done) return true;
       }
       return false;
     }