diff -r 218171dc022d -r c5cd8960df74 lemon/min_cost_arborescence.h
--- a/lemon/min_cost_arborescence.h	Mon Aug 05 14:21:58 2013 +0200
+++ b/lemon/min_cost_arborescence.h	Tue Aug 06 05:38:49 2013 +0200
@@ -101,7 +101,7 @@
   /// more sources should be given to the algorithm and it will calculate
   /// the minimum cost subgraph that is the union of arborescences with the
   /// given sources and spans all the nodes which are reachable from the
-  /// sources. The time complexity of the algorithm is O(n<sup>2</sup>+e).
+  /// sources. The time complexity of the algorithm is O(n<sup>2</sup>+m).
   ///
   /// The algorithm also provides an optimal dual solution, therefore
   /// the optimality of the solution can be checked.