COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
05/17/04 17:11:05 (17 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:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/athos/mincostflow.h

    r635 r645  
    55///\ingroup galgs
    66///\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
    98
    109#include <hugo/dijkstra.h>
     
    1918/// @{
    2019
    21   ///\brief Implementation of an algorithm for finding a flow of value \c k
    22   ///(for small values of \c k) having minimal total cost between 2 nodes
     20  ///\brief Implementation of an algorithm for finding the minimum cost flow
     21  /// of given value in an uncapacitated network
    2322  ///
    2423  ///
     
    173172      while (max_excess > 0){
    174173
     174        /*
     175         * Beginning of the delta scaling phase
     176        */
    175177       
    176178        //Merge and stuff
     
    184186
    185187
    186         while(max_excess > ){
     188        while(max_excess > 0){
    187189
    188190         
Note: See TracChangeset for help on using the changeset viewer.