Changeset 911:89a4fbb99cad in lemon-0.x for src/hugo/preflow.h
- Timestamp:
- 09/28/04 09:00:58 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1222
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/hugo/preflow.h
r906 r911 45 45 ///setFlow. 46 46 /// 47 ///After running \ref phase1() or \ref preflow(), the actual flow 47 ///After running \ref hugo::Preflow::phase1() "phase1()" 48 ///or \ref hugo::Preflow::run() "run()", the actual flow 48 49 ///value can be obtained by calling \ref flowValue(). The minimum 49 50 ///value cut can be written into a <tt>bool</tt> node map by … … 97 98 ///- \c PRE_FLOW: any preflow, i.e. the sum of the in-flows is at 98 99 ///least the sum of the out-flows in every node except the \e source. 99 ///- \c NO_FLOW: indicates an unspecified edge map. \ref flow will be 100 ///set to the constant zero flow in the beginning of the algorithm in this case. 100 ///- \c NO_FLOW: indicates an unspecified edge map. \c flow will be 101 ///set to the constant zero flow in the beginning of 102 ///the algorithm in this case. 101 103 /// 102 104 enum FlowEnum{ … … 195 197 ///minimum value cut can already be computed, though a maximum flow 196 198 ///is not yet obtained. So after calling this method \ref flowValue 197 ///and \ref actMinCutgives proper results.198 ///\warning \ref minCut , \ref minMinCut and \ref maxMinCutdo not199 ///give minimum value cuts unless calling \ref phase2 .199 ///and \ref MinCut() gives proper results. 200 ///\warning \ref minCut(), \ref minMinCut() and \ref maxMinCut() do not 201 ///give minimum value cuts unless calling \ref phase2(). 200 202 void phase1() 201 203 { … … 350 352 351 353 /// Returns the value of the maximum flow by returning the excess 352 /// of the target node \ reft. This value equals to the value of354 /// of the target node \c t. This value equals to the value of 353 355 /// the maximum flow already after running \ref phase1. 354 356 Num flowValue() const { … … 363 365 ///phase1 and \ref phase2. It is much faster after 364 366 ///\ref phase1. \pre M should be a bool-valued node-map. \pre 365 ///If \ref min cut is called after \ref phase2then M should367 ///If \ref minCut() is called after \ref phase2() then M should 366 368 ///be initialized to false. 367 369 template<typename _CutMap> … … 426 428 ///which is inclusionwise maximum. It is computed by processing a 427 429 ///backward bfs from the target node \c t in the residual graph. 428 ///\pre \ref phase2() or preflow() should already be run.430 ///\pre \ref phase2() or run() should already be run. 429 431 template<typename _CutMap> 430 432 void maxMinCut(_CutMap& M) const {
Note: See TracChangeset
for help on using the changeset viewer.