[Lemon-commits] athos: r3251 - lemon/trunk/lemon

[Lemon SVN]

Author: athos
Date: Tue Apr 10 11:01:30 2007
New Revision: 3251

Modified:
   lemon/trunk/lemon/ssp_min_cost_flow.h

Log:
Slight modifications.

Modified: lemon/trunk/lemon/ssp_min_cost_flow.h
==============================================================================
--- lemon/trunk/lemon/ssp_min_cost_flow.h	(original)
+++ lemon/trunk/lemon/ssp_min_cost_flow.h	Tue Apr 10 11:01:30 2007
@@ -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];