Changeset 1254:c5cd8960df74 in lemon for lemon/cost_scaling.h
- Timestamp:
- 08/06/13 05:38:49 (11 years ago)
- Branch:
- default
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/cost_scaling.h
r1250 r1254 98 98 /// "preflow push-relabel" algorithm for the maximum flow problem. 99 99 /// It is a polynomial algorithm, its running time complexity is 100 /// \f$O(n^2 e\log(nK))\f$, where <i>K</i> denotes the maximum arc cost.100 /// \f$O(n^2m\log(nK))\f$, where <i>K</i> denotes the maximum arc cost. 101 101 /// 102 102 /// In general, \ref NetworkSimplex and \ref CostScaling are the fastest … … 671 671 /// 672 672 /// This function returns the total cost of the found flow. 673 /// Its complexity is O( e).673 /// Its complexity is O(m). 674 674 /// 675 675 /// \note The return type of the function can be specified as a
Note: See TracChangeset
for help on using the changeset viewer.