1.1 --- a/lemon/christofides_tsp.h	Sat Jan 08 22:51:16 2011 +0100
     1.2 +++ b/lemon/christofides_tsp.h	Sun Jan 09 00:56:52 2011 +0100
     1.3 @@ -31,13 +31,15 @@
     1.4  
     1.5  namespace lemon {
     1.6    
     1.7 +  /// \ingroup tsp
     1.8 +  ///
     1.9    /// \brief Christofides algorithm for symmetric TSP.
    1.10    ///
    1.11    /// ChristofidesTsp implements Christofides' heuristic for solving
    1.12    /// symmetric \ref tsp "TSP".
    1.13    ///
    1.14    /// This a well-known approximation method for the TSP problem with
    1.15 -  /// \ref checkMetricCost() "metric cost function".
    1.16 +  /// metric cost function.
    1.17    /// It yields a tour whose total cost is at most 3/2 of the optimum,
    1.18    /// but it is usually much better.
    1.19    /// This implementation runs in O(n<sup>3</sup>log(n)) time.
    1.20 @@ -54,7 +56,7 @@
    1.21    ///
    1.22    /// \tparam CM Type of the cost map.
    1.23    ///
    1.24 -  /// \warning \& CM::Value must be signed type.
    1.25 +  /// \warning CM::Value must be a signed number type.
    1.26    template <typename CM>
    1.27    class ChristofidesTsp
    1.28    {
    1.29 @@ -195,7 +197,7 @@
    1.30        /// \brief Returns a const reference to the node sequence of the
    1.31        /// found tour.
    1.32        ///
    1.33 -      /// This function returns a const reference to the internal structure
    1.34 +      /// This function returns a const reference to a vector
    1.35        /// that stores the node sequence of the found tour.
    1.36        ///
    1.37        /// \pre run() must be called before using this function.