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