b027e57e95
- Currently not implemented... Add abseil patch - Add patches/absl-config.cmake Makefile: Add abseil-cpp on unix - Force abseil-cpp SHA1 to 45221cc note: Just before the PR #136 which break all CMake Makefile: Add abseil-cpp on windows - Force abseil-cpp SHA1 to 45221cc note: Just before the PR #136 which break all CMake CMake: Add abseil-cpp - Force abseil-cpp SHA1 to 45221cc note: Just before the PR #136 which break all CMake port to absl: C++ Part - Fix warning with the use of ABSL_MUST_USE_RESULT > The macro must appear as the very first part of a function declaration or definition: ... Note: past advice was to place the macro after the argument list. src: dependencies/sources/abseil-cpp-master/absl/base/attributes.h:418 - Rename enum after windows clash - Remove non compact table constraints - Change index type from int64 to int in routing library - Fix file_nonport compilation on windows - Fix another naming conflict with windows (NO_ERROR is a macro) - Cleanup hash containers; work on sat internals - Add optional_boolean sub-proto Sync cpp examples with internal code - reenable issue173 after reducing number of loops port to absl: Python Part - Add back cp_model.INT32_MIN|MAX for examples Update Python examples - Add random_tsp.py - Run words_square example - Run magic_square in python tests port to absl: Java Part - Fix compilation of the new routing parameters in java - Protect some code from SWIG parsing Update Java Examples port to absl: .Net Part Update .Net examples work on sat internals; Add C++ CP-SAT CpModelBuilder API; update sample code and recipes to use the new API; sync with internal code Remove VS 2015 in Appveyor-CI - abseil-cpp does not support VS 2015... improve tables upgrade C++ sat examples to use the new API; work on sat internals update license dates rewrite jobshop_ft06_distance.py to use the CP-SAT solver rename last example revert last commit more work on SAT internals fix
85 lines
2.2 KiB
Python
85 lines
2.2 KiB
Python
# Copyright 2010 Hakan Kjellerstrand hakank@gmail.com
|
|
#
|
|
# Licensed under the Apache License, Version 2.0 (the "License");
|
|
# you may not use this file except in compliance with the License.
|
|
# You may obtain a copy of the License at
|
|
#
|
|
# http://www.apache.org/licenses/LICENSE-2.0
|
|
#
|
|
# Unless required by applicable law or agreed to in writing, software
|
|
# distributed under the License is distributed on an "AS IS" BASIS,
|
|
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
# See the License for the specific language governing permissions and
|
|
# limitations under the License.
|
|
"""
|
|
|
|
toNum in Google CP Solver.
|
|
|
|
Convert a number <-> array of int in a specific base.
|
|
|
|
This model was created by Hakan Kjellerstrand (hakank@gmail.com)
|
|
Also see my other Google CP Solver models:
|
|
http://www.hakank.org/google_or_tools/
|
|
|
|
"""
|
|
from __future__ import print_function
|
|
from ortools.constraint_solver import pywrapcp
|
|
|
|
#
|
|
# converts a number (s) <-> an array of integers (t) in the specific base.
|
|
#
|
|
|
|
|
|
def toNum(solver, t, s, base):
|
|
tlen = len(t)
|
|
solver.Add(
|
|
s == solver.Sum([(base**(tlen - i - 1)) * t[i] for i in range(tlen)]))
|
|
|
|
|
|
def main(unused_argv):
|
|
# Create the solver.
|
|
solver = pywrapcp.Solver("toNum test")
|
|
|
|
# data
|
|
n = 4
|
|
base = 10
|
|
|
|
# declare variables
|
|
x = [solver.IntVar(0, n - 1, "x%i" % i) for i in range(n)]
|
|
y = solver.IntVar(0, 10**n - 1, "y")
|
|
|
|
#
|
|
# constraints
|
|
#
|
|
# solver.Add(solver.AllDifferent([x[i] for i in range(n)]))
|
|
solver.Add(solver.AllDifferent(x))
|
|
# solver.Add(x[0] > 0) # just for fun
|
|
|
|
toNum(solver, x, y, base)
|
|
|
|
#
|
|
# solution and search
|
|
#
|
|
solution = solver.Assignment()
|
|
solution.Add([x[i] for i in range(n)])
|
|
solution.Add(y)
|
|
|
|
collector = solver.AllSolutionCollector(solution)
|
|
solver.Solve(
|
|
solver.Phase([x[i] for i in range(n)], solver.CHOOSE_FIRST_UNBOUND,
|
|
solver.ASSIGN_MIN_VALUE), [collector])
|
|
|
|
num_solutions = collector.SolutionCount()
|
|
for s in range(num_solutions):
|
|
print("x:", [collector.Value(s, x[i]) for i in range(n)])
|
|
print("y:", collector.Value(s, y))
|
|
print()
|
|
|
|
print("failures:", solver.Failures())
|
|
print("branches:", solver.Branches())
|
|
print("WallTime:", solver.WallTime())
|
|
|
|
|
|
if __name__ == "__main__":
|
|
main("cp sample")
|