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
56 lines
2.4 KiB
Java
56 lines
2.4 KiB
Java
// Copyright 2010-2018 Google LLC
|
|
// 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.
|
|
import com.google.ortools.constraintsolver.ConstraintSolverParameters;
|
|
import com.google.ortools.constraintsolver.DecisionBuilder;
|
|
import com.google.ortools.constraintsolver.IntVar;
|
|
import com.google.ortools.constraintsolver.Solver;
|
|
import java.util.logging.Logger;
|
|
|
|
/** Sample showing how to model using the constraint programming solver. */
|
|
public class RabbitsPheasants {
|
|
private static Logger logger = Logger.getLogger(RabbitsPheasants.class.getName());
|
|
|
|
static {
|
|
System.loadLibrary("jniortools");
|
|
}
|
|
|
|
/**
|
|
* Solves the rabbits + pheasants problem. We are seing 20 heads and 56 legs. How many rabbits and
|
|
* how many pheasants are we thus seeing?
|
|
*/
|
|
private static void solve(boolean traceSearch) {
|
|
ConstraintSolverParameters parameters = ConstraintSolverParameters.newBuilder()
|
|
.mergeFrom(Solver.defaultSolverParameters())
|
|
.setTraceSearch(traceSearch)
|
|
.build();
|
|
Solver solver = new Solver("RabbitsPheasants", parameters);
|
|
IntVar rabbits = solver.makeIntVar(0, 100, "rabbits");
|
|
IntVar pheasants = solver.makeIntVar(0, 100, "pheasants");
|
|
solver.addConstraint(solver.makeEquality(solver.makeSum(rabbits, pheasants), 20));
|
|
solver.addConstraint(solver.makeEquality(
|
|
solver.makeSum(solver.makeProd(rabbits, 4), solver.makeProd(pheasants, 2)), 56));
|
|
DecisionBuilder db =
|
|
solver.makePhase(rabbits, pheasants, Solver.CHOOSE_FIRST_UNBOUND, Solver.ASSIGN_MIN_VALUE);
|
|
solver.newSearch(db);
|
|
solver.nextSolution();
|
|
logger.info(rabbits.toString());
|
|
logger.info(pheasants.toString());
|
|
solver.endSearch();
|
|
}
|
|
|
|
public static void main(String[] args) throws Exception {
|
|
boolean traceSearch = args.length > 0 && args[1].equals("--trace");
|
|
RabbitsPheasants.solve(traceSearch);
|
|
}
|
|
}
|