COIN-OR::LEMON - Graph Library

Changeset 2113:48ec8161f9e1 in lemon-0.x


Ignore:
Timestamp:
06/28/06 17:38:45 (13 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2819
Message:

Some modification in the documentation.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/edmonds_karp.h

    r2059 r2113  
    4444  /// The time complexity of the algorithm is \f$ O(n * e^2) \f$ in
    4545  /// worst case.  Always try the preflow algorithm instead of this if
    46   /// you does not have some additional reason than to compute the
    47   /// optimal flow which has \f$ O(n^3) \f$ time complexity.
     46  /// you just want to compute the optimal flow.
    4847  ///
    4948  /// \param _Graph The directed graph type the algorithm runs on.
Note: See TracChangeset for help on using the changeset viewer.