Lines Matching full:solution

243 	Note that solution always encodes last point explicitly.  Higher-level is responsible
320 	# solution given the constraint that the last point is always encoded.
341 		# Assemble solution.
342 		solution = set()
345 			solution.add(i)
347 		solution.remove(-1)
349 		#if not forced <= solution:
353 		assert forced <= solution, (forced, solution)
355 		deltas = [deltas[i] if i in solution else None for i in range(n)]
360 		# circular n-length problem in the solution for new linear case.  I cannot prove that
361 		# this always produces the optimal solution...
366 			# Assemble solution.
367 			solution = set()
370 				solution.add(i % n)
375 					best_sol, best_cost = solution, cost