Index: src/work/athos/mincostflow.h
===================================================================
--- src/work/athos/mincostflow.h	(revision 635)
+++ src/work/athos/mincostflow.h	(revision 645)
@@ -5,6 +5,5 @@
 ///\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>
@@ -19,6 +18,6 @@
 /// @{
 
-  ///\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
   /// 
   ///
@@ -173,4 +172,7 @@
       while (max_excess > 0){
 
+	/*
+	 * Beginning of the delta scaling phase 
+	*/
 	
 	//Merge and stuff
@@ -184,5 +186,5 @@
 
 
-	while(max_excess > ){
+	while(max_excess > 0){