COIN-OR::LEMON - Graph Library

Changeset 1080:c5cd8960df74 in lemon-main for lemon/cost_scaling.h


Ignore:
Timestamp:
08/06/13 05:38:49 (7 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Use m instead of e for denoting the number of arcs/edges (#463)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/cost_scaling.h

    r1074 r1080  
    9898  /// "preflow push-relabel" algorithm for the maximum flow problem.
    9999  /// 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.
     100  /// \f$O(n^2m\log(nK))\f$, where <i>K</i> denotes the maximum arc cost.
    101101  ///
    102102  /// In general, \ref NetworkSimplex and \ref CostScaling are the fastest
     
    671671    ///
    672672    /// This function returns the total cost of the found flow.
    673     /// Its complexity is O(e).
     673    /// Its complexity is O(m).
    674674    ///
    675675    /// \note The return type of the function can be specified as a
Note: See TracChangeset for help on using the changeset viewer.