Hamilton

for (int conf = 0; conf < (1<<k) - 1; ++i)
	for (int i = 1; i <= k; ++i)
		if (a[i][conf])
			for (int j = i; j <= k; ++j)
				if (bitter(j)^conf && a[j][conf + bitter(j)] > a[i][conf] + d[i][j])
					a[j][conf + bitter(j)] = a[i][conf] + d[i][j];