java贪心算法旅行售货员问题_旅行售货员问题(回溯法)

题目描述我就不说了，但是给几个测试用例

input

4

-1 30 6 4

30 -1 5 10

6 5 -1 20

4 10 20 -1

output

25

input

7

-1 -1 -1 5 10 -1 -1

-1 -1 -1 -1 -1 3 -1

-1 -1 -1 -1 -1 -1 2

-1 8 -1 -1 -1 -1 -1

-1 -1 3 -1 -1 -1 -1

-1 -1 -1 -1 1 -1 -1

9 -1 -1 -1 -1 -1 -1

output

31

//旅行售货员问题 #include #define MAXSIZE 100 using namespace std; int n; int graph[MAXSIZE][MAXSIZE]; int c=0; int bestc=0; int x[MAXSIZE]; int bestx[MAXSIZE]; void backtrack(int k); void swap(int &a,int &b); int main(void) { cin>>n; for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { cin>>graph[i][j]; } } for(int i=1;i<=n;i++) { x[i]=i; bestx[i]=i; } backtrack(2); cout<