1.1 --- a/lemon/karp_mmc.h	Mon Jul 16 16:21:40 2018 +0200
     1.2 +++ b/lemon/karp_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,8 +98,8 @@
    1.13    ///
    1.14    /// This class implements Karp's algorithm for finding a directed
    1.15    /// cycle of minimum mean cost in a digraph
    1.16 -  /// \ref amo93networkflows, \ref dasdan98minmeancycle.
    1.17 -  /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).
    1.18 +  /// \cite karp78characterization, \cite dasdan98minmeancycle.
    1.19 +  /// It runs in time O(nm) and uses space O(n<sup>2</sup>+m).
    1.20    ///
    1.21    /// \tparam GR The type of the digraph the algorithm runs on.
    1.22    /// \tparam CM The type of the cost map. The default
    1.23 @@ -140,11 +140,11 @@
    1.24      /// \brief The path type of the found cycles
    1.25      ///
    1.26      /// The path type of the found cycles.
    1.27 -    /// Using the \ref KarpMmcDefaultTraits "default traits class",
    1.28 +    /// Using the \ref lemon::KarpMmcDefaultTraits "default traits class",
    1.29      /// it is \ref lemon::Path "Path<Digraph>".
    1.30      typedef typename TR::Path Path;
    1.31  
    1.32 -    /// The \ref KarpMmcDefaultTraits "traits class" of the algorithm
    1.33 +    /// The \ref lemon::KarpMmcDefaultTraits "traits class" of the algorithm
    1.34      typedef TR Traits;
    1.35  
    1.36    private:
    1.37 @@ -270,8 +270,8 @@
    1.38      /// found cycle.
    1.39      ///
    1.40      /// If you don't call this function before calling \ref run() or
    1.41 -    /// \ref findCycleMean(), it will allocate a local \ref Path "path"
    1.42 -    /// structure. The destuctor deallocates this automatically
    1.43 +    /// \ref findCycleMean(), a local \ref Path "path" structure
    1.44 +    /// will be allocated. The destuctor deallocates this automatically
    1.45      /// allocated object, of course.
    1.46      ///
    1.47      /// \note The algorithm calls only the \ref lemon::Path::addFront()