diff -r 07682e24c4e8 -r dff32ce3db71 lemon/opt2_tsp.h
--- a/lemon/opt2_tsp.h	Sun Jan 09 00:57:12 2011 +0100
+++ b/lemon/opt2_tsp.h	Sun Jan 09 15:06:55 2011 +0100
@@ -45,9 +45,9 @@
   /// algorithm uses the node sequence determined by the node IDs.
   /// Oherwise, it starts with the given tour.
   ///
-  /// This is a relatively slow but powerful method. 
-  /// A typical usage of it is the improvement of a solution that is resulted
-  /// by a fast tour construction heuristic (e.g. the InsertionTsp algorithm).
+  /// This is a rather slow but effective method.
+  /// Its typical usage is the improvement of the result of a fast tour
+  /// construction heuristic (e.g. the InsertionTsp algorithm).
   ///
   /// \tparam CM Type of the cost map.
   template <typename CM>