1.1 --- a/lemon/nearest_neighbor_tsp.h	Sun Jan 09 00:57:12 2011 +0100
     1.2 +++ b/lemon/nearest_neighbor_tsp.h	Sun Jan 09 15:06:55 2011 +0100
     1.3 @@ -44,8 +44,9 @@
     1.4    /// Finally, it connects the two end points of the path to form a tour.
     1.5    ///
     1.6    /// This method runs in O(n<sup>2</sup>) time.
     1.7 -  /// It quickly finds a short tour for most TSP instances, but in special
     1.8 -  /// cases, it could yield a really bad (or even the worst) solution.
     1.9 +  /// It quickly finds a relatively short tour for most TSP instances,
    1.10 +  /// but it could also yield a really bad (or even the worst) solution
    1.11 +  /// in special cases.
    1.12    ///
    1.13    /// \tparam CM Type of the cost map.
    1.14    template <typename CM>