Changeset 645:d93d8b9906d1 in lemon0.x for src/work/athos/mincostflow.h
 Timestamp:
 05/17/04 17:11:05 (20 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@843
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/work/athos/mincostflow.h
r635 r645 5 5 ///\ingroup galgs 6 6 ///\file 7 ///\brief An algorithm for finding a flow of value \c k (for small values of \c k) having minimal total cost 8 7 ///\brief An algorithm for finding the minimum cost flow of given value in an uncapacitated network 9 8 10 9 #include <hugo/dijkstra.h> … … 19 18 /// @{ 20 19 21 ///\brief Implementation of an algorithm for finding a flow of value \c k22 /// (for small values of \c k) having minimal total cost between 2 nodes20 ///\brief Implementation of an algorithm for finding the minimum cost flow 21 /// of given value in an uncapacitated network 23 22 /// 24 23 /// … … 173 172 while (max_excess > 0){ 174 173 174 /* 175 * Beginning of the delta scaling phase 176 */ 175 177 176 178 //Merge and stuff … … 184 186 185 187 186 while(max_excess > ){188 while(max_excess > 0){ 187 189 188 190
Note: See TracChangeset
for help on using the changeset viewer.