Changeset 851:209c9d53e195 in lemon-0.x for src/hugo/preflow.h
- Timestamp:
- 09/14/04 12:29:47 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1150
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/hugo/preflow.h
r849 r851 17 17 /// @{ 18 18 19 /// Preflow algorithms class.19 ///%Preflow algorithms class. 20 20 21 21 ///This class provides an implementation of the \e preflow \e 22 22 ///algorithm producing a flow of maximum value in a directed 23 23 ///graph. The preflow algorithms are the fastest max flow algorithms 24 ///up -to-date. The \e source node, the \e target node, the \e24 ///up to now. The \e source node, the \e target node, the \e 25 25 ///capacity of the edges and the \e starting \e flow value of the 26 26 ///edges should be passed to the algorithm through the … … 29 29 ///setFlow. 30 30 /// 31 ///After running \ c phase1 or \c preflow, the actual flow31 ///After running \ref phase1() or \ref preflow(), the actual flow 32 32 ///value can be obtained by calling \ref flowValue(). The minimum 33 ///value cut can be written into a \c node map of \c boolsby34 ///calling \ref minCut . (\ref minMinCut and \ref maxMinCutwrites33 ///value cut can be written into a <tt>bool</tt> node map by 34 ///calling \ref minCut(). (\ref minMinCut() and \ref maxMinCut() writes 35 35 ///the inclusionwise minimum and maximum of the minimum value cuts, 36 36 ///resp.) … … 130 130 ///Runs the preflow algorithm. 131 131 132 ///Runs the preflow algorithm. 132 ///Runs the preflow algorithm. 133 /// 133 134 void run() { 134 135 phase1(flow_prop); … … 158 159 ///is not yet obtained. So after calling this method \ref flowValue 159 160 ///and \ref minCut gives proper results. 160 ///\warning :\ref minMinCut and \ref maxMinCut do not161 ///\warning \ref minMinCut and \ref maxMinCut do not 161 162 ///give minimum value cuts unless calling \ref phase2. 162 163 ///\pre The starting flow must be … … 179 180 ///is not yet obtained. So after calling this method \ref flowValue 180 181 ///and \ref actMinCut gives proper results. 181 ///\warning :\ref minCut, \ref minMinCut and \ref maxMinCut do not182 ///\warning \ref minCut, \ref minMinCut and \ref maxMinCut do not 182 183 ///give minimum value cuts unless calling \ref phase2. 183 184 void phase1()
Note: See TracChangeset
for help on using the changeset viewer.