diff -r 28df5272df99 -r bdc953f2a449 lemon/johnson.h
--- a/lemon/johnson.h	Fri Apr 07 09:52:30 2006 +0000
+++ b/lemon/johnson.h	Fri Apr 07 09:54:35 2006 +0000
@@ -191,8 +191,8 @@
   /// that all edge is non-negative in the graph then the dijkstra algorithm
   /// 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. 
   ///