1.1 --- a/lemon/bellman_ford.h	Fri Apr 07 09:52:30 2006 +0000
     1.2 +++ b/lemon/bellman_ford.h	Fri Apr 07 09:54:35 2006 +0000
     1.3 @@ -155,7 +155,7 @@
     1.4    /// that all edge is non-negative in the graph then the dijkstra algorithm
     1.5    /// should be used rather.
     1.6    ///
     1.7 -  /// The complexity of the algorithm is O(n * e).
     1.8 +  /// The maximal time complexity of the algorithm is \f$ O(ne) \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.