1.1 --- a/lemon/opt2_tsp.h	Sun Jan 09 00:57:12 2011 +0100
     1.2 +++ b/lemon/opt2_tsp.h	Sun Jan 09 15:06:55 2011 +0100
     1.3 @@ -45,9 +45,9 @@
     1.4    /// algorithm uses the node sequence determined by the node IDs.
     1.5    /// Oherwise, it starts with the given tour.
     1.6    ///
     1.7 -  /// This is a relatively slow but powerful method. 
     1.8 -  /// A typical usage of it is the improvement of a solution that is resulted
     1.9 -  /// by a fast tour construction heuristic (e.g. the InsertionTsp algorithm).
    1.10 +  /// This is a rather slow but effective method.
    1.11 +  /// Its typical usage is the improvement of the result of a fast tour
    1.12 +  /// construction heuristic (e.g. the InsertionTsp algorithm).
    1.13    ///
    1.14    /// \tparam CM Type of the cost map.
    1.15    template <typename CM>