diff -r 5958cc5c0a98 -r cae19e9eeca4 lemon/bellman_ford.h
--- a/lemon/bellman_ford.h	Tue Aug 06 12:28:37 2013 +0200
+++ b/lemon/bellman_ford.h	Tue Aug 06 17:58:59 2013 +0200
@@ -149,7 +149,7 @@
   /// \ingroup shortest_path
   /// This class provides an efficient implementation of the Bellman-Ford
   /// algorithm. The maximum time complexity of the algorithm is
-  /// <tt>O(ne)</tt>.
+  /// <tt>O(nm)</tt>.
   ///
   /// The Bellman-Ford algorithm solves the single-source shortest path
   /// problem when the arcs can have negative lengths, but the digraph