COIN-OR::LEMON - Graph Library

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


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

    r877 r1080  
    4747  ///
    4848  /// The algorithm calculates \e n-1 distinct minimum cuts (currently with
    49   /// the \ref Preflow algorithm), thus it has \f$O(n^3\sqrt{e})\f$ overall
     49  /// the \ref Preflow algorithm), thus it has \f$O(n^3\sqrt{m})\f$ overall
    5050  /// time complexity. It calculates a rooted Gomory-Hu tree.
    5151  /// The structure of the tree and the edge weights can be
Note: See TracChangeset for help on using the changeset viewer.