Changeset 1049:7bf489cf624e in lemonmain for lemon/cost_scaling.h
 Timestamp:
 03/16/13 13:14:35 (7 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/cost_scaling.h
r1003 r1049 97 97 /// can be viewed as the generalization of the \ref Preflow 98 98 /// "preflow pushrelabel" algorithm for the maximum flow problem. 99 /// It is a polynomial algorithm, its running time complexity is 100 /// \f$O(n^2e\log(nK))\f$, where <i>K</i> denotes the maximum arc cost. 99 101 /// 100 102 /// In general, \ref NetworkSimplex and \ref CostScaling are the fastest … … 1270 1272 _buckets[r] = _bucket_next[u]; 1271 1273 1272 // Search the incom ming arcs of u1274 // Search the incoming arcs of u 1273 1275 LargeCost pi_u = _pi[u]; 1274 1276 int last_out = _first_out[u+1];
Note: See TracChangeset
for help on using the changeset viewer.