1.1 --- a/lemon/min_cost_arborescence.h	Mon Jul 16 16:21:40 2018 +0200
     1.2 +++ b/lemon/min_cost_arborescence.h	Wed Oct 17 19:14:07 2018 +0200
     1.3 @@ -2,7 +2,7 @@
     1.4   *
     1.5   * This file is a part of LEMON, a generic C++ optimization library.
     1.6   *
     1.7 - * Copyright (C) 2003-2010
     1.8 + * Copyright (C) 2003-2013
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -101,7 +101,7 @@
    1.13    /// more sources should be given to the algorithm and it will calculate
    1.14    /// the minimum cost subgraph that is the union of arborescences with the
    1.15    /// given sources and spans all the nodes which are reachable from the
    1.16 -  /// sources. The time complexity of the algorithm is O(n<sup>2</sup>+e).
    1.17 +  /// sources. The time complexity of the algorithm is O(n<sup>2</sup>+m).
    1.18    ///
    1.19    /// The algorithm also provides an optimal dual solution, therefore
    1.20    /// the optimality of the solution can be checked.
    1.21 @@ -128,7 +128,7 @@
    1.22    class MinCostArborescence {
    1.23    public:
    1.24  
    1.25 -    /// \brief The \ref MinCostArborescenceDefaultTraits "traits class"
    1.26 +    /// \brief The \ref lemon::MinCostArborescenceDefaultTraits "traits class"
    1.27      /// of the algorithm.
    1.28      typedef TR Traits;
    1.29      /// The type of the underlying digraph.