[Lemon-commits] [lemon_svn] athos: r825 - hugo/trunk/src/hugo

[Lemon SVN]

Author: athos
Date: Thu May 13 19:33:40 2004
New Revision: 825

Modified:
   hugo/trunk/src/hugo/mincostflows.h

Log:
Another slight modifications.

Modified: hugo/trunk/src/hugo/mincostflows.h
==============================================================================
--- hugo/trunk/src/hugo/mincostflows.h	(original)
+++ hugo/trunk/src/hugo/mincostflows.h	Thu May 13 19:33:40 2004
@@ -118,9 +118,9 @@
       FOR_EACH_LOC(typename Graph::EdgeIt, e, G){
 	flow.set(e,0);
       }
-      
+
+      //Initialize the potential to zero
       FOR_EACH_LOC(typename Graph::NodeIt, n, G){
-	//cout << potential[n]<<endl;
 	potential.set(n,0);
       }
       
@@ -129,10 +129,6 @@
       //We need a residual graph
       ResGraphType res_graph(G, capacity, flow);
 
-      //Initialize the copy of the Dijkstra potential to zero
-      
-      //typename ResGraphType::template NodeMap<Length> potential(res_graph);
-
 
       ModLengthMap mod_length(res_graph, length, potential);
 
@@ -146,19 +142,11 @@
 	  break;
 	};
 	
-	//We have to copy the potential
+	//We have to change the potential
 	FOR_EACH_LOC(typename ResGraphType::NodeIt, n, res_graph){
 	  potential[n] += dijkstra.distMap()[n];
 	}
-	/*
-	{
-	  //We have to copy the potential
-	  typename ResGraphType::NodeIt n;
-	  for ( res_graph.first(n) ; res_graph.valid(n) ; res_graph.next(n) ) {
-	      potential[n] += dijkstra.distMap()[n];
-	  }
-	}
-	*/
+
 
 	//Augmenting on the sortest path
 	Node n=t;