COIN-OR::LEMON - Graph Library

Changeset 1202:ef200e268af2 in lemon for lemon/greedy_tsp.h


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/greedy_tsp.h

    r1201 r1202  
    3131namespace lemon {
    3232
     33  /// \ingroup tsp
     34  ///
    3335  /// \brief Greedy algorithm for symmetric TSP.
    3436  ///
     
    4345  ///
    4446  /// This method runs in O(n<sup>2</sup>log(n)) time.
    45   /// It quickly finds an effectively short tour for most TSP
    46   /// instances, but in special cases, it could yield a really bad
    47   /// (or even the worst) solution.
     47  /// It quickly finds a short tour for most TSP instances, but in special
     48  /// cases, it could yield a really bad (or even the worst) solution.
    4849  ///
    4950  /// \tparam CM Type of the cost map.
     
    194195      /// found tour.
    195196      ///
    196       /// This function returns a const reference to the internal structure
     197      /// This function returns a const reference to a vector
    197198      /// that stores the node sequence of the found tour.
    198199      ///
Note: See TracChangeset for help on using the changeset viewer.