1.1 --- a/src/work/athos/mincostflow.h	Mon May 17 06:32:12 2004 +0000
     1.2 +++ b/src/work/athos/mincostflow.h	Mon May 17 15:11:05 2004 +0000
     1.3 @@ -4,8 +4,7 @@
     1.4  
     1.5  ///\ingroup galgs
     1.6  ///\file
     1.7 -///\brief An algorithm for finding a flow of value \c k (for small values of \c k) having minimal total cost 
     1.8 -
     1.9 +///\brief An algorithm for finding the minimum cost flow of given value in an uncapacitated network
    1.10  
    1.11  #include <hugo/dijkstra.h>
    1.12  #include <hugo/graph_wrapper.h>
    1.13 @@ -18,8 +17,8 @@
    1.14  /// \addtogroup galgs
    1.15  /// @{
    1.16  
    1.17 -  ///\brief Implementation of an algorithm for finding a flow of value \c k 
    1.18 -  ///(for small values of \c k) having minimal total cost between 2 nodes 
    1.19 +  ///\brief Implementation of an algorithm for finding the minimum cost flow 
    1.20 +  /// of given value in an uncapacitated network
    1.21    /// 
    1.22    ///
    1.23    /// The class \ref hugo::MinCostFlow "MinCostFlow" implements
    1.24 @@ -172,6 +171,9 @@
    1.25  
    1.26        while (max_excess > 0){
    1.27  
    1.28 +	/*
    1.29 +	 * Beginning of the delta scaling phase 
    1.30 +	*/
    1.31  	
    1.32  	//Merge and stuff
    1.33  
    1.34 @@ -183,7 +185,7 @@
    1.35  	}
    1.36  
    1.37  
    1.38 -	while(max_excess > ){
    1.39 +	while(max_excess > 0){
    1.40  
    1.41  	  
    1.42  	  //s es t valasztasa