# Changeset 1049:7bf489cf624e in lemon-main for lemon/cost_scaling.h

Ignore:
Timestamp:
03/16/13 13:14:35 (7 years ago)
Branch:
default
Phase:
public
Message:

Minor fixes and improvements in the doc (#459)

File:
1 edited

### Legend:

Unmodified
 r1003 /// can be viewed as the generalization of the \ref Preflow /// "preflow push-relabel" algorithm for the maximum flow problem. /// It is a polynomial algorithm, its running time complexity is /// \f$O(n^2e\log(nK))\f$, where K denotes the maximum arc cost. /// /// In general, \ref NetworkSimplex and \ref CostScaling are the fastest _buckets[r] = _bucket_next[u]; // Search the incomming arcs of u // Search the incoming arcs of u LargeCost pi_u = _pi[u]; int last_out = _first_out[u+1];