| Calling Sequence | ComputeTSP(D)
| |||||||||
| Parameters |
| |||||||||
| Return Type | list(posint) | |||||||||
| Globals | ComputeTSP_table, | |||||||||
| Synopsis | This function computes a minimum distance tour through the distance matrix D (this is the symmetric travelling salesperson problem). | |||||||||
| Examples | > D := [[0,1,1,10],[1,0,10,1],[1,10,0,1],[10,1,1,0]]; D := [[0, 1, 1, 10], [1, 0, 10, 1], [1, 10, 0, 1], [10, 1, 1, 0]] > ComputeTSP(D); [1, 2, 4, 3] | |||||||||
| See also | ComputeCubicTSP, ComputeQuarticTSP | |||||||||