doc/groups.dox
 changeset 1202 ef200e268af2 parent 1200 62ba43576f85 child 1204 dff32ce3db71
     1.1 --- a/doc/groups.dox	Sat Jan 08 22:51:16 2011 +0100
1.2 +++ b/doc/groups.dox	Sun Jan 09 00:56:52 2011 +0100
1.3 @@ -561,8 +561,9 @@
1.4  the problem is to find a shortest possible tour that visits each node exactly
1.5  once (i.e. the minimum cost Hamiltonian cycle).
1.6
1.7 -These TSP algorithms should be used with a
1.8 -metric cost function. Otherwise, they could yield worse results.
1.9 +These TSP algorithms are intended to be used with a \e metric \e cost
1.10 +\e function, i.e. the edge costs should satisfy the triangle inequality.
1.11 +Otherwise the algorithms could yield worse results.
1.12
1.13  LEMON provides five well-known heuristics for solving symmetric TSP:
1.14   - \ref NearestNeighborTsp Neareast neighbor algorithm