# HG changeset patch
# User athos
# Date 1176195690 0
# Node ID 89cbf0a2ed57cc8c9841402486dcc8c1bf405f88
# Parent  113d381c916002f1edb49d9cb3741e298c35d890
Slight modifications.

diff -r 113d381c9160 -r 89cbf0a2ed57 lemon/ssp_min_cost_flow.h
--- a/lemon/ssp_min_cost_flow.h	Fri Apr 06 22:50:27 2007 +0000
+++ b/lemon/ssp_min_cost_flow.h	Tue Apr 10 09:01:30 2007 +0000
@@ -179,7 +179,7 @@
     /// \todo May be it does make sense to be able to start with a
     /// nonzero feasible primal-dual solution pair as well.
     ///
-    /// \todo If the actual flow value is bigger than k, then
+    /// \todo If the current flow value is bigger than k, then
     /// everything is cleared and the algorithm starts from zero
     /// flow. Is it a good approach?
     int run(int k) {
@@ -195,7 +195,7 @@
       for (typename Graph::NodeIt n(g); n!=INVALID; ++n) potential.set(n, 0);  
     }
 
-    /// \brief Returns the value of the actual flow. 
+    /// \brief Returns the value of the current flow. 
     int flowValue() const {
       int i=0;
       for (typename Graph::OutEdgeIt e(g, s); e!=INVALID; ++e) i+=flow[e];