Untitled
plain_text
a month ago
314 B
1
Indexable
Never
void backtrack(int k,int count){ hoanvi[0] = 0; if(k == soDiem+1){ if(minn > count ) minn=count; return; } if(minn < count) return; for(int i=1;i<=soDiem;i++){ if(vis[i]==0){ vis[i]=1; hoanvi[k]=i; backtrack(k+1,count + data[hoanvi[k-1]][hoanvi[k]]); vis[i]=0; } } }