Changeset 1034:ef200e268af2 in lemon-main for lemon/greedy_tsp.h
- Timestamp:
- 01/09/11 00:56:52 (13 years ago)
- Branch:
- default
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/greedy_tsp.h
r1033 r1034 31 31 namespace lemon { 32 32 33 /// \ingroup tsp 34 /// 33 35 /// \brief Greedy algorithm for symmetric TSP. 34 36 /// … … 43 45 /// 44 46 /// 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. 48 49 /// 49 50 /// \tparam CM Type of the cost map. … … 194 195 /// found tour. 195 196 /// 196 /// This function returns a const reference to the internal structure197 /// This function returns a const reference to a vector 197 198 /// that stores the node sequence of the found tour. 198 199 ///
Note: See TracChangeset
for help on using the changeset viewer.