bestnode.java

一个简单的货郎担问题

public class BestNode {
	int[][] m;

	int n;

	int node, cost;

	BestNode(int[][] m, int n) {
		this.m = m;
		this.n = n;
	}

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

}