COIN-OR::LEMON - Graph Library

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/capacity_scaling.h

    r1250 r1254  
    7070  /// \cite edmondskarp72theoretical. It is an efficient dual
    7171  /// solution method, which runs in polynomial time
    72   /// \f$O(e\log U (n+e)\log n)\f$, where <i>U</i> denotes the maximum
     72  /// \f$O(m\log U (n+m)\log n)\f$, where <i>U</i> denotes the maximum
    7373  /// of node supply and arc capacity values.
    7474  ///
     
    647647    ///
    648648    /// This function returns the total cost of the found flow.
    649     /// Its complexity is O(e).
     649    /// Its complexity is O(m).
    650650    ///
    651651    /// \note The return type of the function can be specified as a
Note: See TracChangeset for help on using the changeset viewer.