Changeset 645:d93d8b9906d1 in lemon-0.x for src/work/athos/mincostflow.h

Timestamp:

05/17/04 17:11:05 (20 years ago)

Author:

athos

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@843

Message:

I don't really feel like working on this at the moment.

File:

• src/work/athos/mincostflow.h (modified) (4 diffs)

src/work/athos/mincostflow.h

@@ -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 +18 @@
 /// @{
 
-  ///\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 +172 @@
       while (max_excess > 0){
 
+        /*
+         * Beginning of the delta scaling phase 
+        */
         
         //Merge and stuff
@@ -184 +186 @@
 
 
-        while(max_excess > ){
+        while(max_excess > 0){