Changeset 1254:c5cd8960df74 in lemon for lemon/cycle_canceling.h
 Timestamp:
 08/06/13 05:38:49 (6 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/cycle_canceling.h
r1241 r1254 52 52 /// The most efficent one is the \ref CANCEL_AND_TIGHTEN 53 53 /// "CancelandTighten" algorithm, thus it is the default method. 54 /// It runs in strongly polynomial time O(n<sup>2</sup> e<sup>2</sup>log(n)),54 /// It runs in strongly polynomial time O(n<sup>2</sup>m<sup>2</sup>log(n)), 55 55 /// but in practice, it is typically orders of magnitude slower than 56 56 /// the scaling algorithms and \ref NetworkSimplex. … … 134 134 /// \cite goldberg89cyclecanceling. It improves along a 135 135 /// \ref min_mean_cycle "minimum mean cycle" in each iteration. 136 /// Its running time complexity is O(n<sup>2</sup> e<sup>3</sup>log(n)).136 /// Its running time complexity is O(n<sup>2</sup>m<sup>3</sup>log(n)). 137 137 MINIMUM_MEAN_CYCLE_CANCELING, 138 138 /// The "CancelandTighten" algorithm, which can be viewed as an … … 140 140 /// \cite goldberg89cyclecanceling. 141 141 /// It is faster both in theory and in practice, its running time 142 /// complexity is O(n<sup>2</sup> e<sup>2</sup>log(n)).142 /// complexity is O(n<sup>2</sup>m<sup>2</sup>log(n)). 143 143 CANCEL_AND_TIGHTEN 144 144 }; … … 577 577 /// 578 578 /// This function returns the total cost of the found flow. 579 /// Its complexity is O( e).579 /// Its complexity is O(m). 580 580 /// 581 581 /// \note The return type of the function can be specified as a
Note: See TracChangeset
for help on using the changeset viewer.