1.1 --- a/lemon/hartmann_orlin_mmc.h	Mon Jul 16 16:21:40 2018 +0200
     1.2 +++ b/lemon/hartmann_orlin_mmc.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 @@ -98,10 +98,11 @@
    1.13    ///
    1.14    /// This class implements the Hartmann-Orlin algorithm for finding
    1.15    /// a directed cycle of minimum mean cost in a digraph
    1.16 -  /// \ref amo93networkflows, \ref dasdan98minmeancycle.
    1.17 -  /// It is an improved version of \ref KarpMmc "Karp"'s original algorithm,
    1.18 -  /// it applies an efficient early termination scheme.
    1.19 -  /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).
    1.20 +  /// \cite hartmann93finding, \cite dasdan98minmeancycle.
    1.21 +  /// This method is based on \ref KarpMmc "Karp"'s original algorithm, but
    1.22 +  /// applies an early termination scheme. It makes the algorithm
    1.23 +  /// significantly faster for some problem instances, but slower for others.
    1.24 +  /// The algorithm runs in time O(nm) and uses space O(n<sup>2</sup>+m).
    1.25    ///
    1.26    /// \tparam GR The type of the digraph the algorithm runs on.
    1.27    /// \tparam CM The type of the cost map. The default
    1.28 @@ -142,11 +143,14 @@
    1.29      /// \brief The path type of the found cycles
    1.30      ///
    1.31      /// The path type of the found cycles.
    1.32 -    /// Using the \ref HartmannOrlinMmcDefaultTraits "default traits class",
    1.33 +    /// Using the \ref lemon::HartmannOrlinMmcDefaultTraits
    1.34 +    /// "default traits class",
    1.35      /// it is \ref lemon::Path "Path<Digraph>".
    1.36      typedef typename TR::Path Path;
    1.37  
    1.38 -    /// The \ref HartmannOrlinMmcDefaultTraits "traits class" of the algorithm
    1.39 +    /// \brief The
    1.40 +    /// \ref lemon::HartmannOrlinMmcDefaultTraits "traits class"
    1.41 +    /// of the algorithm
    1.42      typedef TR Traits;
    1.43  
    1.44    private:
    1.45 @@ -274,8 +278,8 @@
    1.46      /// found cycle.
    1.47      ///
    1.48      /// If you don't call this function before calling \ref run() or
    1.49 -    /// \ref findCycleMean(), it will allocate a local \ref Path "path"
    1.50 -    /// structure. The destuctor deallocates this automatically
    1.51 +    /// \ref findCycleMean(), a local \ref Path "path" structure
    1.52 +    /// will be allocated. The destuctor deallocates this automatically
    1.53      /// allocated object, of course.
    1.54      ///
    1.55      /// \note The algorithm calls only the \ref lemon::Path::addFront()