旅行售货员问题

const int INF = 10000000; ///p240.6
int n, cc = 0, bestc = INF;
int **g;
int *x, *bestx;

void travel(int t) {
if (t == n) {
if (g[x[t - 1]][x[t]] != INF && g[x[t]][1] != INF &&
(cc + g[x[t - 1]][x[t]] + g[x[t]][1] < bestc || bestc == INF)) { for (int i = 0; i < n + 1; i++) bestx[i] = x[i]; bestc = cc + g[x[t - 1]][x[t]] + g[x[t]][1]; } return; } for (int i = t; i < n; i++) { if (g

旅行售货员问题最先出现在Python成神之路。