Changeset 882:277ef0218f0c in lemon for lemon/cycle_canceling.h
 Timestamp:
 11/13/09 00:11:11 (13 years ago)
 Branch:
 default
 Phase:
 public
 Rebase:
 38623133333537653838386530613132643333663761303537636464353864306537613239336461
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/cycle_canceling.h
r881 r882 46 46 /// 47 47 /// \ref CycleCanceling implements three different cyclecanceling 48 /// algorithms for finding a \ref min_cost_flow "minimum cost flow". 48 /// algorithms for finding a \ref min_cost_flow "minimum cost flow" 49 /// \ref amo93networkflows, \ref klein67primal, 50 /// \ref goldberg89cyclecanceling. 49 51 /// The most efficent one (both theoretically and practically) 50 52 /// is the \ref CANCEL_AND_TIGHTEN "Cancel and Tighten" algorithm, … … 125 127 SIMPLE_CYCLE_CANCELING, 126 128 /// The "Minimum Mean CycleCanceling" algorithm, which is a 127 /// wellknown strongly polynomial method. It improves along a 129 /// wellknown strongly polynomial method 130 /// \ref goldberg89cyclecanceling. It improves along a 128 131 /// \ref min_mean_cycle "minimum mean cycle" in each iteration. 129 132 /// Its running time complexity is O(n<sup>2</sup>m<sup>3</sup>log(n)). 130 133 MINIMUM_MEAN_CYCLE_CANCELING, 131 134 /// The "Cancel And Tighten" algorithm, which can be viewed as an 132 /// improved version of the previous method. 135 /// improved version of the previous method 136 /// \ref goldberg89cyclecanceling. 133 137 /// It is faster both in theory and in practice, its running time 134 138 /// complexity is O(n<sup>2</sup>m<sup>2</sup>log(n)).
Note: See TracChangeset
for help on using the changeset viewer.