1.1 --- a/lemon/greedy_tsp.h	Sun Jan 09 00:57:12 2011 +0100
     1.2 +++ b/lemon/greedy_tsp.h	Sun Jan 09 15:06:55 2011 +0100
     1.3 @@ -43,9 +43,10 @@
     1.4    /// as long as it does not create a cycle of less than n edges and it does
     1.5    /// not increase the degree of any node above two.
     1.6    ///
     1.7 -  /// This method runs in O(n<sup>2</sup>log(n)) time.
     1.8 -  /// It quickly finds a short tour for most TSP instances, but in special
     1.9 -  /// cases, it could yield a really bad (or even the worst) solution.
    1.10 +  /// This method runs in O(n<sup>2</sup>) time.
    1.11 +  /// It quickly finds a relatively short tour for most TSP instances,
    1.12 +  /// but it could also yield a really bad (or even the worst) solution
    1.13 +  /// in special cases.
    1.14    ///
    1.15    /// \tparam CM Type of the cost map.
    1.16    template <typename CM>