<ahref="SimpleMinCostFlowProgram_8cs.html">Go to the documentation of this file.</a><divclass="fragment"><divclass="line"><aname="l00001"></a><spanclass="lineno"> 1</span> <spanclass="comment">// Copyright 2010-2018 Google LLC</span></div><divclass="line"><aname="l00002"></a><spanclass="lineno"> 2</span> <spanclass="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><divclass="line"><aname="l00003"></a><spanclass="lineno"> 3</span> <spanclass="comment">// you may not use this file except in compliance with the License.</span></div><divclass="line"><aname="l00004"></a><spanclass="lineno"> 4</span> <spanclass="comment">// You may obtain a copy of the License at</span></div><divclass="line"><aname="l00005"></a><spanclass="lineno"> 5</span> <spanclass="comment">//</span></div><divclass="line"><aname="l00006"></a><spanclass="lineno"> 6</span> <spanclass="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><divclass="line"><aname="l00007"></a><spanclass="lineno"> 7</span> <spanclass="comment">//</span></div><divclass="line"><aname="l00008"></a><spanclass="lineno"> 8</span> <spanclass="comment">// Unless required by applicable law or agreed to in writing, software</span></div><divclass="line"><aname="l00009"></a><spanclass="lineno"> 9</span> <spanclass="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><divclass="line"><aname="l00010"></a><spanclass="lineno"> 10</span> <spanclass="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><divclass="line"><aname="l00011"></a><spanclass="lineno"> 11</span> <spanclass="comment">// See the License for the specific language governing permissions and</span></div><divclass="line"><aname="l00012"></a><spanclass="lineno"> 12</span> <spanclass="comment">// limitations under the License.</span></div><divclass="line"><aname="l00013"></a><spanclass="lineno"> 13</span> </div><divclass="line"><aname="l00014"></a><spanclass="lineno"> 14</span> <spanclass="comment">// """From Bradley, Hax, and Magnanti, 'Applied Mathematical Programming', figure 8.1."""</span></div><divclass="line"><aname="l00015"></a><spanclass="lineno"> 15</span> <spanclass="comment">// [START program]</span></div><divclass="line"><aname="l00016"></a><spanclass="lineno"> 16</span> <spanclass="keyword">using</span> System;</div><divclass="line"><aname="l00017"></a><spanclass="lineno"> 17</span> <spanclass="keyword">using</span><aclass="code"href="namespaceGoogle.html">Google</a>.<aclass="code"href="namespaceGoogle_1_1OrTools.html">OrTools</a>.<aclass="code"href="namespaceGoogle_1_1OrTools_1_1Graph.html">Graph</a>;</div><divclass="line"><aname="l00018"></a><spanclass="lineno"> 18</span> </div><divclass="line"><aname="l00019"></a><spanclass="lineno"><aclass="line"href="classSimpleMinCostFlowProgram.html"> 19</a></span> <spanclass="keyword">public</span><spanclass="keyword">class </span><aclass="code"href="classSimpleMinCostFlowProgram.html">SimpleMinCostFlowProgram</a></div><divclass="line"><aname="l00020"></a><spanclass="lineno"> 20</span> {</div><divclass="line"><aname="l00021"></a><spanclass="lineno"> 21</span> <spanclass="keyword">static</span><spanclass="keywordtype">void</span> Main()</div><divclass="line"><aname="l00022"></a><spanclass="lineno"> 22</span>  {</div><divclass="line"><aname="l00023"></a><spanclass="lineno"> 23</span> <spanclass="comment">// [START data]</span></div><divclass="line"><aname="l00024"></a><spanclass="lineno"> 24</span> <spanclass="comment">// Define four parallel arrays: sources, destinations, capacities, and unit costs</span></div><divclass="line"><aname="l00025"></a><spanclass="lineno"> 25</span> <s
<divclass="ttc"id="classGoogle_1_1OrTools_1_1Graph_1_1MinCostFlow_html_a775dc0ebf9ab30a1fad0addf962c9cb4"><divclass="ttname"><ahref="classGoogle_1_1OrTools_1_1Graph_1_1MinCostFlow.html#a775dc0ebf9ab30a1fad0addf962c9cb4">Google.OrTools.Graph.MinCostFlow.SetNodeSupply</a></div><divclass="ttdeci">void SetNodeSupply(int node, long supply)</div><divclass="ttdef"><b>Definition:</b><ahref="MinCostFlow_8cs_source.html#l00045">MinCostFlow.cs:45</a></div></div>
<divclass="ttc"id="classGoogle_1_1OrTools_1_1Graph_1_1MinCostFlow_html_a99b844152169f3268497ebe16e257521"><divclass="ttname"><ahref="classGoogle_1_1OrTools_1_1Graph_1_1MinCostFlow.html#a99b844152169f3268497ebe16e257521">Google.OrTools.Graph.MinCostFlow.AddArcWithCapacityAndUnitCost</a></div><divclass="ttdeci">int AddArcWithCapacityAndUnitCost(int tail, int head, long capacity, long unit_cost)</div><divclass="ttdef"><b>Definition:</b><ahref="MinCostFlow_8cs_source.html#l00040">MinCostFlow.cs:40</a></div></div>
