本文整理汇总了C#中IntVar.Flatten方法的典型用法代码示例。如果您正苦于以下问题：C# IntVar.Flatten方法的具体用法？C# IntVar.Flatten怎么用？C# IntVar.Flatten使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类IntVar的用法示例。
在下文中一共展示了IntVar.Flatten方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: Solve
/**
*
* Max flow problem.
*
* From Taha "Introduction to Operations Research", Example 6.4-2
*
* Translated from the AMPL code at
* http://taha.ineg.uark.edu/maxflo.txt
*
* Also see http://www.hakank.org/or-tools/max_flow_taha.py
*
*/
private static void Solve()
{
Solver solver = new Solver("MaxFlowTaha");
//
// Data
//
int n = 5;
int start = 0;
int end = n-1;
IEnumerable<int> NODES = Enumerable.Range(0, n);
// cost matrix
int[,] c = {
{0, 20, 30, 10, 0},
{0, 0, 40, 0, 30},
{0, 0, 0, 10, 20},
{0, 0, 5, 0, 20},
{0, 0, 0, 0, 0}
};
//
// Decision variables
//
IntVar[,] x = new IntVar[n,n];
foreach(int i in NODES) {
foreach(int j in NODES) {
x[i,j] = solver.MakeIntVar(0, c[i,j], "x");
}
}
IntVar[] x_flat = x.Flatten();
IntVar[] out_flow = solver.MakeIntVarArray(n, 0, 1000, "out_flow");
IntVar[] in_flow = solver.MakeIntVarArray(n, 0, 1000, "in_flow");
IntVar total = solver.MakeIntVar(0, 10000, "total");
//
// Constraints
//
solver.Add( (from j in NODES
where c[start,j] > 0
select x[start,j]
).ToArray().Sum() == total);
foreach(int i in NODES) {
var in_flow_sum = (from j in NODES
where c[j,i] > 0
select x[j,i]
);
if (in_flow_sum.Count() > 0) {
solver.Add(in_flow_sum.ToArray().Sum() == in_flow[i]);
}
var out_flow_sum = (from j in NODES
where c[i,j] > 0
select x[i,j]
);
if (out_flow_sum.Count() > 0) {
solver.Add(out_flow_sum.ToArray().Sum() == out_flow[i]);
}
}
// in_flow == out_flow
foreach(int i in NODES) {
if (i != start && i != end) {
solver.Add(out_flow[i] == in_flow[i]);
}
}
var s1 = (from i in NODES where c[i,start] > 0 select x[i,start]);
if (s1.Count() > 0) {
solver.Add(s1.ToArray().Sum() == 0);
}
var s2 = (from j in NODES where c[end, j] > 0 select x[end,j]);
if (s2.Count() > 0) {
solver.Add(s2.ToArray().Sum() == 0);
}
//
//.........这里部分代码省略.........