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
66 lines
2.1 KiB
Java
66 lines
2.1 KiB
Java
// Copyright 2010-2017 Google
|
|
// 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.graph.LinearSumAssignment;
|
|
|
|
/**
|
|
* Test assignment on a 4x4 matrix. Example taken from
|
|
* http://www.ee.oulu.fi/~mpa/matreng/eem1_2-1.htm with kCost[0][1] modified so the optimum solution
|
|
* is unique.
|
|
*/
|
|
public class LinearAssignmentAPI {
|
|
|
|
static {
|
|
System.loadLibrary("jniortools");
|
|
}
|
|
|
|
|
|
private static void runAssignmentOn4x4Matrix() {
|
|
final int numSources = 4;
|
|
final int numTargets = 4;
|
|
final int[][] cost = {
|
|
{90, 76, 75, 80},
|
|
{35, 85, 55, 65},
|
|
{125, 95, 90, 105},
|
|
{45, 110, 95, 115}
|
|
};
|
|
final int expectedCost = cost[0][3] + cost[1][2] + cost[2][1] + cost[3][0];
|
|
|
|
LinearSumAssignment assignment = new LinearSumAssignment();
|
|
for (int source = 0; source < numSources; ++source) {
|
|
for (int target = 0; target < numTargets; ++target) {
|
|
assignment.addArcWithCost(source, target, cost[source][target]);
|
|
}
|
|
}
|
|
|
|
if (assignment.solve() == LinearSumAssignment.Status.OPTIMAL) {
|
|
System.out.println("Total cost = " + assignment.getOptimalCost() + "/" + expectedCost);
|
|
for (int node = 0; node < assignment.getNumNodes(); ++node) {
|
|
System.out.println(
|
|
"Left node "
|
|
+ node
|
|
+ " assigned to right node "
|
|
+ assignment.getRightMate(node)
|
|
+ " with cost "
|
|
+ assignment.getAssignmentCost(node));
|
|
}
|
|
} else {
|
|
System.out.println("No solution found.");
|
|
}
|
|
}
|
|
|
|
public static void main(String[] args) throws Exception {
|
|
LinearAssignmentAPI.runAssignmentOn4x4Matrix();
|
|
}
|
|
}
|