1.1 --- a/lemon/johnson.h	Fri Apr 07 09:52:30 2006 +0000
     1.2 +++ b/lemon/johnson.h	Fri Apr 07 09:54:35 2006 +0000
     1.3 @@ -191,8 +191,8 @@
     1.4    /// that all edge is non-negative in the graph then the dijkstra algorithm
     1.5    /// should be used from each node.
     1.6    ///
     1.7 -  /// The complexity of this algorithm is $O(n^2 * log(n) + n * log(n) * e)$ or
     1.8 -  /// with fibonacci heap O(n^2 * log(n) + n * e). Usually the fibonacci heap
     1.9 +  /// The complexity of this algorithm is \f$ O(n^2\log(n)+n\log(n)e) \f$ or
    1.10 +  /// with fibonacci heap \f$ O(n^2\log(n)+ne) \f$. Usually the fibonacci heap
    1.11    /// implementation is slower than either binary heap implementation or the 
    1.12    /// Floyd-Warshall algorithm. 
    1.13    ///