# HG changeset patch
# User athos
# Date 1084806665 0
# Node ID d93d8b9906d1ca4b35e656fa970d30b70a7239f9
# Parent  d84f3d42237d0ae51e83145096fd7af61999d058
I don't really feel like working on this at the moment.

diff -r d84f3d42237d -r d93d8b9906d1 src/work/athos/mincostflow.h
--- a/src/work/athos/mincostflow.h	Mon May 17 06:32:12 2004 +0000
+++ b/src/work/athos/mincostflow.h	Mon May 17 15:11:05 2004 +0000
@@ -4,8 +4,7 @@
 
 ///\ingroup galgs
 ///\file
-///\brief An algorithm for finding a flow of value \c k (for small values of \c k) having minimal total cost 
-
+///\brief An algorithm for finding the minimum cost flow of given value in an uncapacitated network
 
 #include <hugo/dijkstra.h>
 #include <hugo/graph_wrapper.h>
@@ -18,8 +17,8 @@
 /// \addtogroup galgs
 /// @{
 
-  ///\brief Implementation of an algorithm for finding a flow of value \c k 
-  ///(for small values of \c k) having minimal total cost between 2 nodes 
+  ///\brief Implementation of an algorithm for finding the minimum cost flow 
+  /// of given value in an uncapacitated network
   /// 
   ///
   /// The class \ref hugo::MinCostFlow "MinCostFlow" implements
@@ -172,6 +171,9 @@
 
       while (max_excess > 0){
 
+	/*
+	 * Beginning of the delta scaling phase 
+	*/
 	
 	//Merge and stuff
 
@@ -183,7 +185,7 @@
 	}
 
 
-	while(max_excess > ){
+	while(max_excess > 0){
 
 	  
 	  //s es t valasztasa