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

Format all .Net using Microsoft style

Browse Source
This commit is contained in:
Corentin Le Molgat
2020-11-03 10:04:19 +01:00
parent eefa058d24
commit a9385fc3d2
196 changed files with 26140 additions and 23301 deletions
Download Patch File Download Diff File Expand all files Collapse all files

116
ortools/graph/samples/SimpleMinCostFlowProgram.cs
View File

@@ -16,63 +16,71 @@
using System;
using Google.OrTools.Graph;
public class SimpleMinCostFlowProgram {
static void Main() {
// [START data]
// Define four parallel arrays: sources, destinations, capacities, and unit costs
// between each pair. For instance, the arc from node 0 to node 1 has a
// capacity of 15.
// Problem taken From Taha's 'Introduction to Operations Research',
// example 6.4-2.
int[] startNodes = { 0, 0, 1, 1, 1, 2, 2, 3, 4 };
int[] endNodes = { 1, 2, 2, 3, 4, 3, 4, 4, 2 };
int[] capacities = { 15, 8, 20, 4, 10, 15, 4, 20, 5 };
int[] unitCosts = { 4, 4, 2, 2, 6, 1, 3, 2, 3 };
public class SimpleMinCostFlowProgram
{
static void Main()
{
// [START data]
// Define four parallel arrays: sources, destinations, capacities, and unit costs
// between each pair. For instance, the arc from node 0 to node 1 has a
// capacity of 15.
// Problem taken From Taha's 'Introduction to Operations Research',
// example 6.4-2.
int[] startNodes = { 0, 0, 1, 1, 1, 2, 2, 3, 4 };
int[] endNodes = { 1, 2, 2, 3, 4, 3, 4, 4, 2 };
int[] capacities = { 15, 8, 20, 4, 10, 15, 4, 20, 5 };
int[] unitCosts = { 4, 4, 2, 2, 6, 1, 3, 2, 3 };
// Define an array of supplies at each node.
int[] supplies = { 20, 0, 0, -5, -15 };
// [END data]
// Define an array of supplies at each node.
int[] supplies = { 20, 0, 0, -5, -15 };
// [END data]
// [START constraints]
// Instantiate a SimpleMinCostFlow solver.
MinCostFlow minCostFlow = new MinCostFlow();
// [START constraints]
// Instantiate a SimpleMinCostFlow solver.
MinCostFlow minCostFlow = new MinCostFlow();
// Add each arc.
for (int i = 0; i < startNodes.Length; ++i) {
int arc = minCostFlow.AddArcWithCapacityAndUnitCost(startNodes[i], endNodes[i], capacities[i],
unitCosts[i]);
if (arc != i)
throw new Exception("Internal error");
// Add each arc.
for (int i = 0; i < startNodes.Length; ++i)
{
int arc =
minCostFlow.AddArcWithCapacityAndUnitCost(startNodes[i], endNodes[i], capacities[i], unitCosts[i]);
if (arc != i)
throw new Exception("Internal error");
}
// Add node supplies.
for (int i = 0; i < supplies.Length; ++i)
{
minCostFlow.SetNodeSupply(i, supplies[i]);
}
// [END constraints]
// [START solve]
// Find the min cost flow.
MinCostFlow.Status solveStatus = minCostFlow.Solve();
// [END solve]
// [START print_solution]
if (solveStatus == MinCostFlow.Status.OPTIMAL)
{
Console.WriteLine("Minimum cost: " + minCostFlow.OptimalCost());
Console.WriteLine("");
Console.WriteLine(" Edge Flow / Capacity Cost");
for (int i = 0; i < minCostFlow.NumArcs(); ++i)
{
long cost = minCostFlow.Flow(i) * minCostFlow.UnitCost(i);
Console.WriteLine(minCostFlow.Tail(i) + " -> " + minCostFlow.Head(i) + " " +
string.Format("{0,3}", minCostFlow.Flow(i)) + " / " +
string.Format("{0,3}", minCostFlow.Capacity(i)) + " " +
string.Format("{0,3}", cost));
}
}
else
{
Console.WriteLine("Solving the min cost flow problem failed. Solver status: " + solveStatus);
}
// [END print_solution]
}
// Add node supplies.
for (int i = 0; i < supplies.Length; ++i) {
minCostFlow.SetNodeSupply(i, supplies[i]);
}
// [END constraints]
// [START solve]
// Find the min cost flow.
MinCostFlow.Status solveStatus = minCostFlow.Solve();
// [END solve]
// [START print_solution]
if (solveStatus == MinCostFlow.Status.OPTIMAL) {
Console.WriteLine("Minimum cost: " + minCostFlow.OptimalCost());
Console.WriteLine("");
Console.WriteLine(" Edge Flow / Capacity Cost");
for (int i = 0; i < minCostFlow.NumArcs(); ++i) {
long cost = minCostFlow.Flow(i) * minCostFlow.UnitCost(i);
Console.WriteLine(minCostFlow.Tail(i) + " -> " + minCostFlow.Head(i) + " " +
string.Format("{0,3}", minCostFlow.Flow(i)) + " / " +
string.Format("{0,3}", minCostFlow.Capacity(i)) + " " +
string.Format("{0,3}", cost));
}
} else {
Console.WriteLine("Solving the min cost flow problem failed. Solver status: " + solveStatus);
}
// [END print_solution]
}
}
// [END program]