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

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/capacity_scaling.h
r1250 r1254 70 70 /// \cite edmondskarp72theoretical. It is an efficient dual 71 71 /// solution method, which runs in polynomial time 72 /// \f$O( e\log U (n+e)\log n)\f$, where <i>U</i> denotes the maximum72 /// \f$O(m\log U (n+m)\log n)\f$, where <i>U</i> denotes the maximum 73 73 /// of node supply and arc capacity values. 74 74 /// … … 647 647 /// 648 648 /// This function returns the total cost of the found flow. 649 /// Its complexity is O( e).649 /// Its complexity is O(m). 650 650 /// 651 651 /// \note The return type of the function can be specified as a
Note: See TracChangeset
for help on using the changeset viewer.