2018-11-10 18:00:53 +01:00
|
|
|
// Copyright 2010-2018 Google LLC
|
2011-03-29 13:53:49 +00:00
|
|
|
// 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.
|
2020-06-10 14:36:44 +02:00
|
|
|
package com.google.ortools.examples;
|
2011-03-29 13:53:49 +00:00
|
|
|
|
2012-01-10 14:16:39 +00:00
|
|
|
import com.google.ortools.graph.MaxFlow;
|
|
|
|
|
import com.google.ortools.graph.MinCostFlow;
|
2011-03-29 13:53:49 +00:00
|
|
|
|
2019-05-06 10:31:03 +02:00
|
|
|
/**
|
|
|
|
|
* Sample showing how to model using the flow solver.
|
|
|
|
|
*
|
|
|
|
|
*/
|
2018-10-31 16:18:18 +01:00
|
|
|
|
2019-05-06 10:31:03 +02:00
|
|
|
public class FlowExample {
|
2018-11-10 23:56:52 +01:00
|
|
|
static {
|
|
|
|
|
System.loadLibrary("jniortools");
|
|
|
|
|
}
|
2011-03-29 13:53:49 +00:00
|
|
|
|
|
|
|
|
private static void solveMinCostFlow() {
|
2014-07-09 11:26:55 +00:00
|
|
|
System.out.println("Min Cost Flow Problem - Simple interface");
|
2011-03-29 13:53:49 +00:00
|
|
|
final int numSources = 4;
|
|
|
|
|
final int numTargets = 4;
|
2018-11-10 23:56:52 +01:00
|
|
|
final int[][] costs = {
|
2019-05-06 10:31:03 +02:00
|
|
|
{90, 75, 75, 80}, {35, 85, 55, 65}, {125, 95, 90, 105}, {45, 110, 95, 115}};
|
2011-03-29 13:53:49 +00:00
|
|
|
final int expectedCost = 275;
|
2014-07-09 11:26:55 +00:00
|
|
|
MinCostFlow minCostFlow = new MinCostFlow();
|
2011-05-26 09:33:52 +00:00
|
|
|
for (int source = 0; source < numSources; ++source) {
|
|
|
|
|
for (int target = 0; target < numTargets; ++target) {
|
2018-11-10 23:56:52 +01:00
|
|
|
minCostFlow.addArcWithCapacityAndUnitCost(
|
|
|
|
|
source, numSources + target, 1, costs[source][target]);
|
2011-03-29 13:53:49 +00:00
|
|
|
}
|
|
|
|
|
}
|
2014-07-09 11:26:55 +00:00
|
|
|
for (int node = 0; node < numSources; ++node) {
|
|
|
|
|
minCostFlow.setNodeSupply(node, 1);
|
|
|
|
|
minCostFlow.setNodeSupply(numSources + node, -1);
|
2011-03-29 13:53:49 +00:00
|
|
|
}
|
2014-07-09 11:26:55 +00:00
|
|
|
if (minCostFlow.solve() == MinCostFlow.Status.OPTIMAL) {
|
2011-07-06 21:38:12 +00:00
|
|
|
final long totalFlowCost = minCostFlow.getOptimalCost();
|
|
|
|
|
System.out.println("total flow = " + totalFlowCost + "/" + expectedCost);
|
2014-07-09 11:26:55 +00:00
|
|
|
for (int i = 0; i < minCostFlow.getNumArcs(); ++i) {
|
|
|
|
|
if (minCostFlow.getFlow(i) > 0) {
|
2019-05-06 10:31:03 +02:00
|
|
|
System.out.println("From source " + minCostFlow.getTail(i) + " to target "
|
|
|
|
|
+ minCostFlow.getHead(i) + ": cost " + minCostFlow.getUnitCost(i));
|
2014-07-09 11:26:55 +00:00
|
|
|
}
|
|
|
|
|
}
|
2011-07-06 21:38:12 +00:00
|
|
|
} else {
|
|
|
|
|
System.out.println("No solution found");
|
|
|
|
|
}
|
2011-03-29 13:53:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
private static void solveMaxFlow() {
|
2014-07-09 11:26:55 +00:00
|
|
|
System.out.println("Max Flow Problem - Simple interface");
|
2011-05-26 09:33:52 +00:00
|
|
|
final int[] tails = {0, 0, 0, 0, 1, 2, 3, 3, 4};
|
|
|
|
|
final int[] heads = {1, 2, 3, 4, 3, 4, 4, 5, 5};
|
2011-03-29 13:53:49 +00:00
|
|
|
final int[] capacities = {5, 8, 5, 3, 4, 5, 6, 6, 4};
|
|
|
|
|
final int expectedTotalFlow = 10;
|
2014-07-09 11:26:55 +00:00
|
|
|
MaxFlow maxFlow = new MaxFlow();
|
|
|
|
|
for (int i = 0; i < tails.length; ++i) {
|
|
|
|
|
maxFlow.addArcWithCapacity(tails[i], heads[i], capacities[i]);
|
2011-03-29 13:53:49 +00:00
|
|
|
}
|
2014-07-09 11:26:55 +00:00
|
|
|
if (maxFlow.solve(0, 5) == MaxFlow.Status.OPTIMAL) {
|
2018-11-10 23:56:52 +01:00
|
|
|
System.out.println("Total flow " + maxFlow.getOptimalFlow() + "/" + expectedTotalFlow);
|
2014-07-09 11:26:55 +00:00
|
|
|
for (int i = 0; i < maxFlow.getNumArcs(); ++i) {
|
2019-05-06 10:31:03 +02:00
|
|
|
System.out.println("From source " + maxFlow.getTail(i) + " to target " + maxFlow.getHead(i)
|
|
|
|
|
+ ": " + maxFlow.getFlow(i) + " / " + maxFlow.getCapacity(i));
|
2011-07-06 21:38:12 +00:00
|
|
|
}
|
2014-07-09 11:26:55 +00:00
|
|
|
// TODO(user): Our SWIG configuration does not currently handle these
|
|
|
|
|
// functions correctly in Java:
|
|
|
|
|
// maxFlow.getSourceSideMinCut(...);
|
|
|
|
|
// maxFlow.getSinkSideMinCut(...);
|
2011-07-06 21:38:12 +00:00
|
|
|
} else {
|
2014-07-09 11:26:55 +00:00
|
|
|
System.out.println("There was an issue with the input.");
|
2011-03-29 13:53:49 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
public static void main(String[] args) throws Exception {
|
|
|
|
|
FlowExample.solveMinCostFlow();
|
|
|
|
|
FlowExample.solveMaxFlow();
|
|
|
|
|
}
|
|
|
|
|
}
|
