COIN-OR::LEMON - Graph Library

Changeset 2042:bdc953f2a449 in lemon-0.x for lemon/johnson.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/johnson.h

    r1993 r2042  
    192192  /// should be used from each node.
    193193  ///
    194   /// The complexity of this algorithm is $O(n^2 * log(n) + n * log(n) * e)$ or
    195   /// with fibonacci heap O(n^2 * log(n) + n * e). Usually the fibonacci heap
     194  /// The complexity of this algorithm is \f$ O(n^2\log(n)+n\log(n)e) \f$ or
     195  /// with fibonacci heap \f$ O(n^2\log(n)+ne) \f$. Usually the fibonacci heap
    196196  /// implementation is slower than either binary heap implementation or the
    197197  /// Floyd-Warshall algorithm.
Note: See TracChangeset for help on using the changeset viewer.