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

format all C# files

Browse Source
This commit is contained in:
Mizux Seiha
2020-10-26 18:36:17 +01:00
parent 976ab9d82b
commit 335cf3df3d
197 changed files with 10040 additions and 12226 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,21 +11,18 @@
// See the License for the specific language governing permissions and
// limitations under the License.
// """From Bradley, Hax, and Magnanti, 'Applied Mathematical Programming', figure 8.1."""
// [START program]
// """From Bradley, Hax, and Magnanti, 'Applied Mathematical Programming',
// figure 8.1.""" [START program]
using System;
using Google.OrTools.Graph;
public class SimpleMinCostFlowProgram
{
static void Main()
{
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.
// 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};
@@ -40,16 +37,14 @@ public class SimpleMinCostFlowProgram
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]);
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)
{
// Add node supplies.
for (int i = 0; i < supplies.Length; ++i) {
minCostFlow.SetNodeSupply(i, supplies[i]);
}
@@ -61,25 +56,22 @@ public class SimpleMinCostFlowProgram
// [END solve]
// [START print_solution]
if (solveStatus == MinCostFlow.Status.OPTIMAL)
{
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)
{
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));
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);
} else {
Console.WriteLine(
"Solving the min cost flow problem failed. Solver status: " +
solveStatus);
}
// [END print_solution]
}