1.1 --- a/lemon/bellman_ford.h	Mon Aug 05 14:21:58 2013 +0200
     1.2 +++ b/lemon/bellman_ford.h	Tue Aug 06 05:38:49 2013 +0200
     1.3 @@ -149,7 +149,7 @@
     1.4    /// \ingroup shortest_path
     1.5    /// This class provides an efficient implementation of the Bellman-Ford
     1.6    /// algorithm. The maximum time complexity of the algorithm is
     1.7 -  /// <tt>O(ne)</tt>.
     1.8 +  /// <tt>O(nm)</tt>.
     1.9    ///
    1.10    /// The Bellman-Ford algorithm solves the single-source shortest path
    1.11    /// problem when the arcs can have negative lengths, but the digraph