public short[] naive(Node[] nodes) {
		short[] tour = new short[nodes.length];
		boolean used[] = new boolean[nodes.length];
		used[0] = true;

		for (short i = 1; i < nodes.length; i++) {
			short best = -1;
			for (short j = 0; j < nodes.length; j++) {
				if (!used[j]
						&& (best == -1 || dist(tour[i - 1], j, nodes) < dist(
								tour[i - 1], best, nodes)))
					best = j;
			}
			tour[i] = best;
			used[best] = true;

		}
		return tour;
	}