always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Sync Google to Github

Browse Source
This commit is contained in:
Corentin Le Molgat
2021-10-13 23:17:11 +02:00
parent 66637a3226
commit 0863b128c4
29 changed files with 331 additions and 252 deletions
Download Patch File Download Diff File Expand all files Collapse all files

40
ortools/graph/samples/AssignmentMinFlow.java
View File

@@ -16,11 +16,10 @@ package com.google.ortools.graph.samples;
// [START import]
import com.google.ortools.Loader;
import com.google.ortools.graph.MinCostFlow;
import java.util.ArrayList;
import java.util.List;
import com.google.ortools.graph.MinCostFlowBase;
// [END import]
/** Minimal Assignment Min Flow.*/
/** Minimal Assignment Min Flow. */
public class AssignmentMinFlow {
public static void main(String[] args) throws Exception {
Loader.loadNativeLibraries();
@@ -32,22 +31,14 @@ public class AssignmentMinFlow {
// [START data]
// Define four parallel arrays: sources, destinations, capacities, and unit costs
// between each pair.
int[] startNodes = new int[] {
0, 0, 0, 0,
1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4,
5, 6, 7, 8};
int[] endNodes = new int[] {
1, 2, 3, 4,
5, 6, 7, 8, 5, 6, 7, 8, 5, 6, 7, 8, 5, 6, 7, 8,
9, 9, 9, 9};
int[] capacities = new int[] {
1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1};
int[] startNodes =
new int[] {0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 6, 7, 8};
int[] endNodes =
new int[] {1, 2, 3, 4, 5, 6, 7, 8, 5, 6, 7, 8, 5, 6, 7, 8, 5, 6, 7, 8, 9, 9, 9, 9};
int[] capacities =
new int[] {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1};
int[] unitCosts = new int[] {
0, 0, 0, 0,
90, 76, 75, 70, 35, 85, 55, 65, 125, 95, 90, 105, 45, 110, 95, 115,
0, 0, 0, 0};
0, 0, 0, 0, 90, 76, 75, 70, 35, 85, 55, 65, 125, 95, 90, 105, 45, 110, 95, 115, 0, 0, 0, 0};
int source = 0;
int sink = 9;
@@ -60,8 +51,9 @@ public class AssignmentMinFlow {
for (int i = 0; i < startNodes.length; ++i) {
int arc = minCostFlow.addArcWithCapacityAndUnitCost(
startNodes[i], endNodes[i], capacities[i], unitCosts[i]);
if (arc != i)
if (arc != i) {
throw new Exception("Internal error");
}
}
// Add node supplies.
@@ -72,23 +64,21 @@ public class AssignmentMinFlow {
// [START solve]
// Find the min cost flow.
MinCostFlow.Status status = minCostFlow.solve();
MinCostFlowBase.Status status = minCostFlow.solve();
// [END solve]
// [START print_solution]
if (status == MinCostFlow.Status.OPTIMAL) {
System.out.println("Total cost: " + minCostFlow.getOptimalCost());
System.out.println("");
System.out.println();
for (int i = 0; i < minCostFlow.getNumArcs(); ++i) {
// Can ignore arcs leading out of source or into sink.
if (minCostFlow.getTail(i) != source && minCostFlow.getHead(i) != sink) {
// Arcs in the solution have a flow value of 1. Their start and end nodes
// give an assignment of worker to task.
if (minCostFlow.getFlow(i) > 0) {
System.out.println(
"Worker " + minCostFlow.getTail(i) +
" assigned to task " + minCostFlow.getHead(i) +
" Cost: " + minCostFlow.getUnitCost(i));
System.out.println("Worker " + minCostFlow.getTail(i) + " assigned to task "
+ minCostFlow.getHead(i) + " Cost: " + minCostFlow.getUnitCost(i));
}
}
}