COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
01/09/11 15:06:55 (13 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Make InsertionTsp? much faster and improve docs (#386)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/nearest_neighbor_tsp.h

    r1202 r1204  
    4545  ///
    4646  /// This method runs in O(n<sup>2</sup>) time.
    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.
     47  /// It quickly finds a relatively short tour for most TSP instances,
     48  /// but it could also yield a really bad (or even the worst) solution
     49  /// in special cases.
    4950  ///
    5051  /// \tparam CM Type of the cost map.
Note: See TracChangeset for help on using the changeset viewer.