用蠻力法求解旅行商問(wèn)題void main() { int N; cout<>N; //存貯最優(yōu)路徑 int *T=new int[N+1]; //建立動(dòng)態(tài)的距離矩陣; int **Graph=new int *[N]; for(int i=0;i<N;i++) { Graph[i]=new int[N]; } cout<<"輸入距離矩陣"<<endl; for(i=0;i<N;i++) for(int j=0;j>Graph[i][j]; } salesman_problem(N,Graph,T); }