1.1 --- a/lemon/insertion_tsp.h Sat Jan 08 22:51:16 2011 +0100
1.2 +++ b/lemon/insertion_tsp.h Sun Jan 09 00:56:52 2011 +0100
1.3 @@ -30,6 +30,8 @@
1.4
1.5 namespace lemon {
1.6
1.7 + /// \ingroup tsp
1.8 + ///
1.9 /// \brief Insertion algorithm for symmetric TSP.
1.10 ///
1.11 /// InsertionTsp implements the insertion heuristic for solving
1.12 @@ -74,9 +76,9 @@
1.13 ///
1.14 /// During the algorithm, nodes are selected for addition to the current
1.15 /// subtour according to the applied rule.
1.16 - /// In general, the FARTHEST yields the best tours, thus it is the
1.17 - /// default option. RANDOM usually gives somewhat worse results, but
1.18 - /// it is much faster than the others and it is the most robust.
1.19 + /// In general, the FARTHEST method yields the best tours, thus it is the
1.20 + /// default option. The RANDOM rule usually gives somewhat worse results,
1.21 + /// but it is much faster than the others and it is the most robust.
1.22 ///
1.23 /// The desired selection rule can be specified as a parameter of the
1.24 /// \ref run() function.
1.25 @@ -178,7 +180,7 @@
1.26 /// \brief Returns a const reference to the node sequence of the
1.27 /// found tour.
1.28 ///
1.29 - /// This function returns a const reference to the internal structure
1.30 + /// This function returns a const reference to a vector
1.31 /// that stores the node sequence of the found tour.
1.32 ///
1.33 /// \pre run() must be called before using this function.