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

Timestamp:

04/07/06 11:54:35 (18 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:

• lemon/johnson.h (modified) (1 diff)

lemon/johnson.h

@@ -192 +192 @@
   /// should be used from each node.
   ///
-  /// The complexity of this algorithm is $O(n^2 * log(n) + n * log(n) * e)$ or
-  /// with fibonacci heap O(n^2 * log(n) + n * e). Usually the fibonacci heap
+  /// The complexity of this algorithm is \f$ O(n^2\log(n)+n\log(n)e) \f$ or
+  /// with fibonacci heap \f$ O(n^2\log(n)+ne) \f$. Usually the fibonacci heap
   /// implementation is slower than either binary heap implementation or the 
   /// Floyd-Warshall algorithm.