COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
01/09/11 00:56:52 (9 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Unifications and improvements in TSP algorithms (#386)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/christofides_tsp.h

    r1201 r1202  
    3232namespace lemon {
    3333 
     34  /// \ingroup tsp
     35  ///
    3436  /// \brief Christofides algorithm for symmetric TSP.
    3537  ///
     
    3840  ///
    3941  /// This a well-known approximation method for the TSP problem with
    40   /// \ref checkMetricCost() "metric cost function".
     42  /// metric cost function.
    4143  /// It yields a tour whose total cost is at most 3/2 of the optimum,
    4244  /// but it is usually much better.
     
    5557  /// \tparam CM Type of the cost map.
    5658  ///
    57   /// \warning \& CM::Value must be signed type.
     59  /// \warning CM::Value must be a signed number type.
    5860  template <typename CM>
    5961  class ChristofidesTsp
     
    196198      /// found tour.
    197199      ///
    198       /// This function returns a const reference to the internal structure
     200      /// This function returns a const reference to a vector
    199201      /// that stores the node sequence of the found tour.
    200202      ///
Note: See TracChangeset for help on using the changeset viewer.