COIN-OR::LEMON - Graph Library

Changeset 851:209c9d53e195 in lemon-0.x for src/hugo/preflow.h


Ignore:
Timestamp:
09/14/04 12:29:47 (20 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1150
Message:

Changes in doc.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/hugo/preflow.h

    r849 r851  
    1717  /// @{                                                   
    1818
    19   ///Preflow algorithms class.
     19  ///%Preflow algorithms class.
    2020
    2121  ///This class provides an implementation of the \e preflow \e
    2222  ///algorithm producing a flow of maximum value in a directed
    2323  ///graph. The preflow algorithms are the fastest max flow algorithms
    24   ///up-to-date. The \e source node, the \e target node, the \e
     24  ///up to now. The \e source node, the \e target node, the \e
    2525  ///capacity of the edges and the \e starting \e flow value of the
    2626  ///edges should be passed to the algorithm through the
     
    2929  ///setFlow.
    3030  ///
    31   ///After running \c phase1 or \c preflow, the actual flow
     31  ///After running \ref phase1() or \ref preflow(), the actual flow
    3232  ///value can be obtained by calling \ref flowValue(). The minimum
    33   ///value cut can be written into a \c node map of \c bools by
    34   ///calling \ref minCut. (\ref minMinCut and \ref maxMinCut writes
     33  ///value cut can be written into a <tt>bool</tt> node map by
     34  ///calling \ref minCut(). (\ref minMinCut() and \ref maxMinCut() writes
    3535  ///the inclusionwise minimum and maximum of the minimum value cuts,
    3636  ///resp.)
     
    130130    ///Runs the preflow algorithm. 
    131131
    132     ///Runs the preflow algorithm.
     132    ///Runs the preflow algorithm.
     133    ///
    133134    void run() {
    134135      phase1(flow_prop);
     
    158159    ///is not yet obtained. So after calling this method \ref flowValue
    159160    ///and \ref minCut gives proper results.
    160     ///\warning: \ref minMinCut and \ref maxMinCut do not
     161    ///\warning \ref minMinCut and \ref maxMinCut do not
    161162    ///give minimum value cuts unless calling \ref phase2.
    162163    ///\pre The starting flow must be
     
    179180    ///is not yet obtained. So after calling this method \ref flowValue
    180181    ///and \ref actMinCut gives proper results.
    181     ///\warning: \ref minCut, \ref minMinCut and \ref maxMinCut do not
     182    ///\warning \ref minCut, \ref minMinCut and \ref maxMinCut do not
    182183    ///give minimum value cuts unless calling \ref phase2.
    183184    void phase1()
Note: See TracChangeset for help on using the changeset viewer.