bestway.java

一个简单的货郎担问题

public class BestWay {
	int[][] m ;
	int n;
	int node,cost;
	BestWay(int[][] m, int n) {
		this.m = m;
		this.n = n;
	}
	int bestWay(int i, boolean[] b ) {
		boolean flag = true;
		for(int k=0;k<n;k++) {
			flag &= b[k];	
		}
		if(flag) {
			return m[i][0];
		}
		int min = 1000;
		for (int j=1;j<n;j++) {
			if(b[j] == true) continue;
			b[j] = true;
			this.cost = m[i][j] + bestWay(j,b);
			if(min > this.cost) {
				min = this.cost;
				this.node = j;
			}
			b[j] = false;
		}
		return min;
	}

}