# Changeset 1254:c5cd8960df74 in lemon for lemon/cycle_canceling.h

Ignore:
Timestamp:
08/06/13 05:38:49 (9 years ago)
Branch:
default
Phase:
public
Message:

Use m instead of e for denoting the number of arcs/edges (#463)

File:
1 edited

Unmodified
Added
Removed
• ## lemon/cycle_canceling.h

 r1241 /// The most efficent one is the \ref CANCEL_AND_TIGHTEN /// "Cancel-and-Tighten" algorithm, thus it is the default method. /// It runs in strongly polynomial time O(n2e2log(n)), /// It runs in strongly polynomial time O(n2m2log(n)), /// but in practice, it is typically orders of magnitude slower than /// the scaling algorithms and \ref NetworkSimplex. /// \cite goldberg89cyclecanceling. It improves along a /// \ref min_mean_cycle "minimum mean cycle" in each iteration. /// Its running time complexity is O(n2e3log(n)). /// Its running time complexity is O(n2m3log(n)). MINIMUM_MEAN_CYCLE_CANCELING, /// The "Cancel-and-Tighten" algorithm, which can be viewed as an /// \cite goldberg89cyclecanceling. /// It is faster both in theory and in practice, its running time /// complexity is O(n2e2log(n)). /// complexity is O(n2m2log(n)). CANCEL_AND_TIGHTEN }; /// /// This function returns the total cost of the found flow. /// Its complexity is O(e). /// Its complexity is O(m). /// /// \note The return type of the function can be specified as a
Note: See TracChangeset for help on using the changeset viewer.