COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
08/06/13 05:38:49 (6 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/cycle_canceling.h

    r1241 r1254  
    5252  /// The most efficent one is the \ref CANCEL_AND_TIGHTEN
    5353  /// "Cancel-and-Tighten" algorithm, thus it is the default method.
    54   /// It runs in strongly polynomial time O(n<sup>2</sup>e<sup>2</sup>log(n)),
     54  /// It runs in strongly polynomial time O(n<sup>2</sup>m<sup>2</sup>log(n)),
    5555  /// but in practice, it is typically orders of magnitude slower than
    5656  /// the scaling algorithms and \ref NetworkSimplex.
     
    134134      /// \cite goldberg89cyclecanceling. It improves along a
    135135      /// \ref min_mean_cycle "minimum mean cycle" in each iteration.
    136       /// Its running time complexity is O(n<sup>2</sup>e<sup>3</sup>log(n)).
     136      /// Its running time complexity is O(n<sup>2</sup>m<sup>3</sup>log(n)).
    137137      MINIMUM_MEAN_CYCLE_CANCELING,
    138138      /// The "Cancel-and-Tighten" algorithm, which can be viewed as an
     
    140140      /// \cite goldberg89cyclecanceling.
    141141      /// It is faster both in theory and in practice, its running time
    142       /// complexity is O(n<sup>2</sup>e<sup>2</sup>log(n)).
     142      /// complexity is O(n<sup>2</sup>m<sup>2</sup>log(n)).
    143143      CANCEL_AND_TIGHTEN
    144144    };
     
    577577    ///
    578578    /// This function returns the total cost of the found flow.
    579     /// Its complexity is O(e).
     579    /// Its complexity is O(m).
    580580    ///
    581581    /// \note The return type of the function can be specified as a
Note: See TracChangeset for help on using the changeset viewer.