COIN-OR::LEMON - Graph Library

Changeset 2042:bdc953f2a449 in lemon-0.x for lemon/min_cut.h


Ignore:
Timestamp:
04/07/06 11:54:35 (14 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2681
Message:

New Algorithm group for matchings

LaTeX formulas
Bug fix => /\f$ will cause parsing error in doxygen

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/min_cut.h

    r2038 r2042  
    840840  /// at least two distinict subnetaux.
    841841  ///
    842   /// The complexity of the algorithm is O(n*e*log(n)) but with Fibonacci
    843   /// heap it can be decreased to O(n*e+n^2*log(n)). When the neutral capacity
    844   /// map is used then it uses BucketHeap which results O(n*e) time complexity.
     842  /// The complexity of the algorithm is \f$ O(ne\log(n)) \f$ but with
     843  /// Fibonacci heap it can be decreased to \f$ O(ne+n^2\log(n)) \f$. When
     844  /// the neutral capacity map is used then it uses BucketHeap which
     845  /// results \f$ O(ne) \f$ time complexity.
    845846#ifdef DOXYGEN
    846847  template <typename _Graph, typename _CapacityMap, typename _Traits>
Note: See TracChangeset for help on using the changeset viewer.