public static void back(int length, int cur, int last) {
		if (length == list.length - 1) {
			if (cur + dis(list[last], start) < minPath)
				minPath = cur + dis(list[last], start);
		} else
			for (int i = 1; i < list.length; i++)
				if (!visited[i]) {
					visited[i] = true;
					back(length + 1, cur + dis(list[last], list[i]), i);
					visited[i] = false;
				}
	}