1.1 --- a/lemon/floyd_warshall.h	Fri Apr 07 09:52:30 2006 +0000
     1.2 +++ b/lemon/floyd_warshall.h	Fri Apr 07 09:54:35 2006 +0000
     1.3 @@ -159,7 +159,7 @@
     1.4    /// should be used from each node rather and if the graph is sparse and
     1.5    /// there are negative circles then the johnson algorithm.
     1.6    ///
     1.7 -  /// The complexity of this algorithm is O(n^3 + e).
     1.8 +  /// The complexity of this algorithm is \f$ O(n^3+e) \f$.
     1.9    ///
    1.10    /// The type of the length is determined by the
    1.11    /// \ref concept::ReadMap::Value "Value" of the length map.