1385 lines
257 KiB
HTML
1385 lines
257 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: min_cost_flow.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">8.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('min__cost__flow_8cc_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">min_cost_flow.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="min__cost__flow_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="min__cost__flow_8h.html">ortools/graph/min_cost_flow.h</a>"</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  </div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <cmath></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  </div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "absl/strings/str_format.h"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="commandlineflags_8h.html">ortools/base/commandlineflags.h</a>"</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="mathutil_8h.html">ortools/base/mathutil.h</a>"</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="graph_8h.html">ortools/graph/graph.h</a>"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="graphs_8h.html">ortools/graph/graphs.h</a>"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="max__flow_8h.html">ortools/graph/max_flow.h</a>"</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  </div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// TODO(user): Remove these flags and expose the parameters in the API.</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// New clients, please do not use these flags!</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="min__cost__flow_8cc.html#a4bc17691c22aa339c9dd9b8fe305ce6f"> 29</a></span> <a class="code" href="min__cost__flow_8cc.html#a4bc17691c22aa339c9dd9b8fe305ce6f">ABSL_FLAG</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>, min_cost_flow_alpha, 5,</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="stringliteral">"Divide factor for epsilon at each refine step."</span>);</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"><a class="line" href="min__cost__flow_8cc.html#ab654e743d095008fe5ad6732d075b277"> 31</a></span> <a class="code" href="min__cost__flow_8cc.html#a4bc17691c22aa339c9dd9b8fe305ce6f">ABSL_FLAG</a>(<span class="keywordtype">bool</span>, min_cost_flow_check_feasibility, <span class="keyword">true</span>,</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="stringliteral">"Check that the graph has enough capacity to send all supplies "</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="stringliteral">"and serve all demands. Also check that the sum of supplies "</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="stringliteral">"is equal to the sum of demands."</span>);</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"><a class="line" href="min__cost__flow_8cc.html#a803ace201395b02478bfde7e58d49eaf"> 35</a></span> <a class="code" href="min__cost__flow_8cc.html#a4bc17691c22aa339c9dd9b8fe305ce6f">ABSL_FLAG</a>(<span class="keywordtype">bool</span>, min_cost_flow_check_balance, <span class="keyword">true</span>,</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="stringliteral">"Check that the sum of supplies is equal to the sum of demands."</span>);</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"><a class="line" href="min__cost__flow_8cc.html#aa70ea6448e7fd69d81e2021d94a2eab7"> 37</a></span> <a class="code" href="min__cost__flow_8cc.html#a4bc17691c22aa339c9dd9b8fe305ce6f">ABSL_FLAG</a>(<span class="keywordtype">bool</span>, min_cost_flow_check_costs, <span class="keyword">true</span>,</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="stringliteral">"Check that the magnitude of the costs will not exceed the "</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="stringliteral">"precision of the machine when scaled (multiplied) by the number "</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="stringliteral">"of nodes"</span>);</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"><a class="line" href="min__cost__flow_8cc.html#a12b05c4219aa2ee08e03b72c37c3e87e"> 41</a></span> <a class="code" href="min__cost__flow_8cc.html#a4bc17691c22aa339c9dd9b8fe305ce6f">ABSL_FLAG</a>(<span class="keywordtype">bool</span>, min_cost_flow_check_result, <span class="keyword">true</span>,</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="stringliteral">"Check that the result is valid."</span>);</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  </div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  </div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a34e6d785d3dc22ee8d54bad8f1cf6cc2"> 47</a></span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a34e6d785d3dc22ee8d54bad8f1cf6cc2">GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::GenericMinCostFlow</a>(</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">const</span> <a class="code" href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">Graph</a>* graph)</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  : graph_(graph),</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  node_excess_(),</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  node_potential_(),</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  residual_arc_capacity_(),</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  first_admissible_arc_(),</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  active_nodes_(),</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  epsilon_(0),</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  alpha_(<a class="code" href="namespaceabsl.html">absl</a>::GetFlag(FLAGS_min_cost_flow_alpha)),</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  cost_scaling_factor_(1),</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  scaled_arc_unit_cost_(),</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  total_flow_cost_(0),</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  status_(NOT_SOLVED),</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  initial_node_excess_(),</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  feasible_node_excess_(),</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  stats_(<span class="stringliteral">"MinCostFlow"</span>),</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  feasibility_checked_(false),</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  use_price_update_(false),</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  check_feasibility_(<a class="code" href="namespaceabsl.html">absl</a>::GetFlag(FLAGS_min_cost_flow_check_feasibility)) {</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> max_num_nodes = <a class="code" href="structoperations__research_1_1_graphs.html#a9d530d16efbea1a29d61cb0325980a50">Graphs<Graph>::NodeReservation</a>(*graph_);</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordflow">if</span> (max_num_nodes > 0) {</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  node_excess_.<a class="code" href="classoperations__research_1_1_z_vector.html#acb72619c157635319e049af6553960c8">Reserve</a>(0, max_num_nodes - 1);</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  node_excess_.<a class="code" href="classoperations__research_1_1_z_vector.html#ad5721f29af64d2e2ae014ead96192591">SetAll</a>(0);</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  node_potential_.<a class="code" href="classoperations__research_1_1_z_vector.html#acb72619c157635319e049af6553960c8">Reserve</a>(0, max_num_nodes - 1);</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  node_potential_.<a class="code" href="classoperations__research_1_1_z_vector.html#ad5721f29af64d2e2ae014ead96192591">SetAll</a>(0);</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  first_admissible_arc_.<a class="code" href="classoperations__research_1_1_z_vector.html#acb72619c157635319e049af6553960c8">Reserve</a>(0, max_num_nodes - 1);</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  first_admissible_arc_.<a class="code" href="classoperations__research_1_1_z_vector.html#ad5721f29af64d2e2ae014ead96192591">SetAll</a>(Graph::kNilArc);</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  initial_node_excess_.<a class="code" href="classoperations__research_1_1_z_vector.html#acb72619c157635319e049af6553960c8">Reserve</a>(0, max_num_nodes - 1);</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  initial_node_excess_.<a class="code" href="classoperations__research_1_1_z_vector.html#ad5721f29af64d2e2ae014ead96192591">SetAll</a>(0);</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  feasible_node_excess_.<a class="code" href="classoperations__research_1_1_z_vector.html#acb72619c157635319e049af6553960c8">Reserve</a>(0, max_num_nodes - 1);</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  feasible_node_excess_.<a class="code" href="classoperations__research_1_1_z_vector.html#ad5721f29af64d2e2ae014ead96192591">SetAll</a>(0);</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  }</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> max_num_arcs = <a class="code" href="structoperations__research_1_1_graphs.html#a42fb6857e088a176a53232b910715260">Graphs<Graph>::ArcReservation</a>(*graph_);</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">if</span> (max_num_arcs > 0) {</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  residual_arc_capacity_.Reserve(-max_num_arcs, max_num_arcs - 1);</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  residual_arc_capacity_.SetAll(0);</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  scaled_arc_unit_cost_.Reserve(-max_num_arcs, max_num_arcs - 1);</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  scaled_arc_unit_cost_.SetAll(0);</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  }</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> }</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  </div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a7cd2dc0776a9f339b56ffac996a7df8c"> 90</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a7cd2dc0776a9f339b56ffac996a7df8c">GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::SetNodeSupply</a>(</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node, <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> supply) {</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(graph_->IsNodeValid(node));</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  node_excess_.Set(node, supply);</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  initial_node_excess_.Set(node, supply);</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  status_ = NOT_SOLVED;</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  feasibility_checked_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> }</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  </div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#ab7f4041c8667d63761aecb9657823945"> 100</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#ab7f4041c8667d63761aecb9657823945">GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::SetArcUnitCost</a>(</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc, ArcScaledCostType unit_cost) {</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsArcDirect(arc));</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  scaled_arc_unit_cost_.Set(arc, unit_cost);</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  scaled_arc_unit_cost_.Set(Opposite(arc), -scaled_arc_unit_cost_[arc]);</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  status_ = NOT_SOLVED;</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  feasibility_checked_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> }</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  </div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#aeb6622ffa760bc9403144736f8ac4ad4"> 110</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#aeb6622ffa760bc9403144736f8ac4ad4">GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::SetArcCapacity</a>(</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc, ArcFlowType new_capacity) {</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(0, new_capacity);</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsArcDirect(arc));</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> free_capacity = residual_arc_capacity_[arc];</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> capacity_delta = new_capacity - Capacity(arc);</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">if</span> (capacity_delta == 0) {</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordflow">return</span>; <span class="comment">// Nothing to do.</span></div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  status_ = NOT_SOLVED;</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  feasibility_checked_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> new_availability = free_capacity + capacity_delta;</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">if</span> (new_availability >= 0) {</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="comment">// The above condition is true when one of two following holds:</span></div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="comment">// 1/ (capacity_delta > 0), meaning we are increasing the capacity</span></div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="comment">// 2/ (capacity_delta < 0 && free_capacity + capacity_delta >= 0)</span></div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// meaning we are reducing the capacity, but that the capacity</span></div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="comment">// reduction is not larger than the free capacity.</span></div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>((capacity_delta > 0) ||</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  (capacity_delta < 0 && new_availability >= 0));</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  residual_arc_capacity_.Set(arc, new_availability);</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(0, residual_arc_capacity_[arc]);</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="comment">// We have to reduce the flow on the arc, and update the excesses</span></div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="comment">// accordingly.</span></div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> flow = residual_arc_capacity_[Opposite(arc)];</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> flow_excess = flow - new_capacity;</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  residual_arc_capacity_.Set(arc, 0);</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  residual_arc_capacity_.Set(Opposite(arc), new_capacity);</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> = Tail(arc);</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  node_excess_.Set(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, node_excess_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>] + flow_excess);</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> = Head(arc);</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  node_excess_.Set(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>, node_excess_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>] - flow_excess);</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(0, residual_arc_capacity_[arc]);</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(0, residual_arc_capacity_[Opposite(arc)]);</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  }</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> }</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  </div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a89b020eea8abc71434d63071a1e38527"> 149</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a89b020eea8abc71434d63071a1e38527">GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::SetArcFlow</a>(</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc, ArcFlowType new_flow) {</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsArcValid(arc));</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a> = Capacity(arc);</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, new_flow);</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  residual_arc_capacity_.Set(Opposite(arc), new_flow);</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  residual_arc_capacity_.Set(arc, <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a> - new_flow);</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  status_ = NOT_SOLVED;</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  feasibility_checked_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> }</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  </div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html">GenericMinCostFlow</a><<a class="code" href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">Graph</a>, ArcFlowType,</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  ArcScaledCostType>::CheckInputConsistency()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> total_supply = 0;</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a> max_capacity = 0; <span class="comment">// uint64 because it is positive and will be used</span></div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="comment">// to check against FlowQuantity overflows.</span></div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc = 0; arc < graph_->num_arcs(); ++arc) {</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a> = <span class="keyword">static_cast<</span><a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a><span class="keyword">></span>(residual_arc_capacity_[arc]);</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  max_capacity = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, max_capacity);</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  }</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a> total_flow = 0; <span class="comment">// uint64 for the same reason as max_capacity.</span></div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node = 0; node < graph_->num_nodes(); ++node) {</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> excess = node_excess_[node];</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  total_supply += excess;</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">if</span> (excess > 0) {</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  total_flow += excess;</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">if</span> (<a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::numeric_limits<FlowQuantity>::max</a>() <</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  max_capacity + total_flow) {</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(DFATAL) << <span class="stringliteral">"Input consistency error: max capacity + flow exceed "</span></div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  << <span class="stringliteral">"precision"</span>;</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  }</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  }</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  }</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">if</span> (total_supply != 0) {</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(DFATAL) << <span class="stringliteral">"Input consistency error: unbalanced problem"</span>;</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  }</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span> }</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  </div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="keywordtype">bool</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::CheckResult()<span class="keyword"></span></div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node = 0; node < graph_->num_nodes(); ++node) {</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordflow">if</span> (node_excess_[node] != 0) {</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(DFATAL) << <span class="stringliteral">"node_excess_["</span> << node << <span class="stringliteral">"] != 0"</span>;</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  }</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">for</span> (OutgoingOrOppositeIncomingArcIterator it(*graph_, node); it.Ok();</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  it.Next()) {</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc = it.Index();</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordtype">bool</span> ok = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">if</span> (residual_arc_capacity_[arc] < 0) {</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(DFATAL) << <span class="stringliteral">"residual_arc_capacity_["</span> << arc << <span class="stringliteral">"] < 0"</span>;</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  ok = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  }</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keywordflow">if</span> (residual_arc_capacity_[arc] > 0 && ReducedCost(arc) < -epsilon_) {</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(DFATAL) << <span class="stringliteral">"residual_arc_capacity_["</span> << arc</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  << <span class="stringliteral">"] > 0 && ReducedCost("</span> << arc << <span class="stringliteral">") < "</span> << -epsilon_</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  << <span class="stringliteral">". (epsilon_ = "</span> << epsilon_ << <span class="stringliteral">")."</span>;</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  ok = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  }</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">if</span> (!ok) {</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(DFATAL) << DebugString(<span class="stringliteral">"CheckResult "</span>, arc);</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  }</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  }</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  }</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span> }</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  </div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="keywordtype">bool</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::CheckCostRange()<span class="keyword"></span></div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> min_cost_magnitude = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::numeric_limits<CostValue>::max</a>();</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> max_cost_magnitude = 0;</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="comment">// Traverse the initial arcs of the graph:</span></div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc = 0; arc < graph_->num_arcs(); ++arc) {</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> cost_magnitude = <a class="code" href="classoperations__research_1_1_math_util.html#a5a6f14696b2a09c97b58e4f0989b19e7">MathUtil::Abs</a>(scaled_arc_unit_cost_[arc]);</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  max_cost_magnitude = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(max_cost_magnitude, cost_magnitude);</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">if</span> (cost_magnitude != 0.0) {</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  min_cost_magnitude = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(min_cost_magnitude, cost_magnitude);</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  }</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  }</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(3) << <span class="stringliteral">"Min cost magnitude = "</span> << min_cost_magnitude</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  << <span class="stringliteral">", Max cost magnitude = "</span> << max_cost_magnitude;</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span> <span class="preprocessor">#if !defined(_MSC_VER)</span></div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">if</span> (log(<a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::numeric_limits<CostValue>::max</a>()) <</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  log(max_cost_magnitude + 1) + log(graph_->num_nodes() + 1)) {</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(DFATAL) << <span class="stringliteral">"Maximum cost magnitude "</span> << max_cost_magnitude << <span class="stringliteral">" is too "</span></div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  << <span class="stringliteral">"high for the number of nodes. Try changing the data."</span>;</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  }</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span> }</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  </div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="keywordtype">bool</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  CheckRelabelPrecondition(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="comment">// Note that the classical Relabel precondition assumes IsActive(node), i.e.,</span></div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="comment">// the node_excess_[node] > 0. However, to implement the Push Look-Ahead</span></div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="comment">// heuristic, we can relax this condition as explained in the section 4.3 of</span></div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="comment">// the article "An Efficient Implementation of a Scaling Minimum-Cost Flow</span></div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="comment">// Algorithm", A.V. Goldberg, Journal of Algorithms 22(1), January 1997, pp.</span></div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="comment">// 1-29.</span></div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(node_excess_[node], 0);</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">for</span> (OutgoingOrOppositeIncomingArcIterator it(*graph_, node); it.Ok();</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  it.Next()) {</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc = it.Index();</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!IsAdmissible(arc)) << DebugString(<span class="stringliteral">"CheckRelabelPrecondition:"</span>, arc);</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  }</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span> }</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  </div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span> std::string</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::DebugString(</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keyword">const</span> std::string& <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>, <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> = Tail(arc);</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> = Head(arc);</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="comment">// Reduced cost is computed directly without calling ReducedCost to avoid</span></div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="comment">// recursive calls between ReducedCost and DebugString in case a DCHECK in</span></div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="comment">// ReducedCost fails.</span></div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> reduced_cost = scaled_arc_unit_cost_[arc] +</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  node_potential_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>] - node_potential_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>];</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">return</span> absl::StrFormat(</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="stringliteral">"%s Arc %d, from %d to %d, "</span></div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="stringliteral">"Capacity = %d, Residual capacity = %d, "</span></div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="stringliteral">"Flow = residual capacity for reverse arc = %d, "</span></div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="stringliteral">"Height(tail) = %d, Height(head) = %d, "</span></div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="stringliteral">"Excess(tail) = %d, Excess(head) = %d, "</span></div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="stringliteral">"Cost = %d, Reduced cost = %d, "</span>,</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>, arc, <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>, Capacity(arc),</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keyword">static_cast<</span><a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a><span class="keyword">></span>(residual_arc_capacity_[arc]), Flow(arc),</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  node_potential_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>], node_potential_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>], node_excess_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>],</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  node_excess_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>], <span class="keyword">static_cast<</span><a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a><span class="keyword">></span>(scaled_arc_unit_cost_[arc]),</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  reduced_cost);</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span> }</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  </div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a92607deae80e69a2a63cc2d8f5205bd5"> 292</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a92607deae80e69a2a63cc2d8f5205bd5">GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::</a></div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a92607deae80e69a2a63cc2d8f5205bd5"> CheckFeasibility</a>(std::vector<NodeIndex>* <span class="keyword">const</span> infeasible_supply_node,</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  std::vector<NodeIndex>* <span class="keyword">const</span> infeasible_demand_node) {</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="comment">// Create a new graph, which is a copy of graph_, with the following</span></div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="comment">// modifications:</span></div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="comment">// Two nodes are added: a source and a sink.</span></div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="comment">// The source is linked to each supply node (whose supply > 0) by an arc whose</span></div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="comment">// capacity is equal to the supply at the supply node.</span></div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="comment">// The sink is linked to each demand node (whose supply < 0) by an arc whose</span></div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="comment">// capacity is the demand (-supply) at the demand node.</span></div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="comment">// There are no supplies or demands or costs in the graph, as we will run</span></div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="comment">// max-flow.</span></div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="comment">// TODO(user): make it possible to share a graph by MaxFlow and MinCostFlow.</span></div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="comment">// For this it is necessary to make StarGraph resizable.</span></div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  feasibility_checked_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> num_extra_arcs = 0;</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node = 0; node < graph_->num_nodes(); ++node) {</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">if</span> (initial_node_excess_[node] != 0) {</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  ++num_extra_arcs;</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  }</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  }</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> num_nodes_in_max_flow = graph_->num_nodes() + 2;</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> num_arcs_in_max_flow = graph_->num_arcs() + num_extra_arcs;</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> source = num_nodes_in_max_flow - 2;</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> sink = num_nodes_in_max_flow - 1;</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <a class="code" href="classoperations__research_1_1_ebert_graph.html">StarGraph</a> checker_graph(num_nodes_in_max_flow, num_arcs_in_max_flow);</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <a class="code" href="classoperations__research_1_1_max_flow.html">MaxFlow</a> checker(&checker_graph, source, sink);</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  checker.<a class="code" href="classoperations__research_1_1_generic_max_flow.html#aa76638d2f8eddf2c3d9778b3c1285010">SetCheckInput</a>(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  checker.<a class="code" href="classoperations__research_1_1_generic_max_flow.html#aa4e5f2ba9abcf71460c68a4903abc7bc">SetCheckResult</a>(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="comment">// Copy graph_ to checker_graph.</span></div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc = 0; arc < graph_->num_arcs(); ++arc) {</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> new_arc =</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  checker_graph.<a class="code" href="classoperations__research_1_1_ebert_graph_base.html#a7b505ba4a01bce342d049f5a8674da72">AddArc</a>(graph_->Tail(arc), graph_->Head(arc));</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(arc, new_arc);</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  checker.<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a21776d0248204801a49c42b46902c1a1">SetArcCapacity</a>(new_arc, Capacity(arc));</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  }</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> total_demand = 0;</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> total_supply = 0;</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="comment">// Create the source-to-supply node arcs and the demand-node-to-sink arcs.</span></div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node = 0; node < graph_->num_nodes(); ++node) {</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> supply = initial_node_excess_[node];</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keywordflow">if</span> (supply > 0) {</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> new_arc = checker_graph.<a class="code" href="classoperations__research_1_1_ebert_graph_base.html#a7b505ba4a01bce342d049f5a8674da72">AddArc</a>(source, node);</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  checker.<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a21776d0248204801a49c42b46902c1a1">SetArcCapacity</a>(new_arc, supply);</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  total_supply += supply;</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a34e6d785d3dc22ee8d54bad8f1cf6cc2"> 338</a></span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (supply < 0) {</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> new_arc = checker_graph.<a class="code" href="classoperations__research_1_1_ebert_graph_base.html#a7b505ba4a01bce342d049f5a8674da72">AddArc</a>(node, sink);</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  checker.<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a21776d0248204801a49c42b46902c1a1">SetArcCapacity</a>(new_arc, -supply);</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  total_demand -= supply;</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  }</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  }</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordflow">if</span> (total_supply != total_demand) {</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(DFATAL) << <span class="stringliteral">"total_supply("</span> << total_supply << <span class="stringliteral">") != total_demand("</span></div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  << total_demand << <span class="stringliteral">")."</span>;</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  }</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keywordflow">if</span> (!checker.<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a942f29030f08426e7e318204e987e2f7">Solve</a>()) {</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a7cd2dc0776a9f339b56ffac996a7df8c"> 350</a></span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(DFATAL) << <span class="stringliteral">"Max flow could not be computed."</span>;</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  }</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#ab7f4041c8667d63761aecb9657823945"> 353</a></span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> optimal_max_flow = checker.<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a142146c1af2855fc821d7bd4c0af6130">GetOptimalFlow</a>();</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  feasible_node_excess_.SetAll(0);</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordflow">for</span> (StarGraph::OutgoingArcIterator it(checker_graph, source); it.Ok();</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#aeb6622ffa760bc9403144736f8ac4ad4"> 356</a></span>  it.Next()) {</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc = it.Index();</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node = checker_graph.<a class="code" href="classoperations__research_1_1_star_graph_base.html#a5237cfbb86ec8f305e498e873e5c4e95">Head</a>(arc);</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> flow = checker.<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a2a420ad8221c326064736ccf148d2f93">Flow</a>(arc);</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a89b020eea8abc71434d63071a1e38527"> 360</a></span>  feasible_node_excess_.Set(node, flow);</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">if</span> (infeasible_supply_node != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  infeasible_supply_node->push_back(node);</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a942f29030f08426e7e318204e987e2f7"> 363</a></span>  }</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  }</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">for</span> (StarGraph::IncomingArcIterator it(checker_graph, sink); it.Ok();</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  it.Next()) {</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc = it.Index();</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node = checker_graph.<a class="code" href="classoperations__research_1_1_ebert_graph.html#aae684b1eb132c8c201f437d88e367b55">Tail</a>(arc);</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> flow = checker.<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a2a420ad8221c326064736ccf148d2f93">Flow</a>(arc);</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  feasible_node_excess_.Set(node, -flow);</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keywordflow">if</span> (infeasible_demand_node != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  infeasible_demand_node->push_back(node);</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a92607deae80e69a2a63cc2d8f5205bd5"> 373</a></span>  }</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  }</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  feasibility_checked_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordflow">return</span> optimal_max_flow == total_supply;</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span> }</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  </div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a3051a4b6d1a5a9fb5444f6d5a295a95c"> 380</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a3051a4b6d1a5a9fb5444f6d5a295a95c">GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::MakeFeasible</a>() {</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a3051a4b6d1a5a9fb5444f6d5a295a95c"> 381</a></span>  <span class="keywordflow">if</span> (!feasibility_checked_) {</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  }</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node = 0; node < graph_->num_nodes(); ++node) {</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> excess = feasible_node_excess_[node];</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  node_excess_.Set(node, excess);</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  initial_node_excess_.Set(node, excess);</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a2a420ad8221c326064736ccf148d2f93"> 388</a></span>  }</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span> }</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a9dcd8610149406a1593d2a0725290482"> 391</a></span>  </div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a2a420ad8221c326064736ccf148d2f93"> 393</a></span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a2a420ad8221c326064736ccf148d2f93">GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::Flow</a>(</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a1057f1a98821c9237d75967b575f3829"> 394</a></span>  <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="keywordflow">if</span> (IsArcDirect(arc)) {</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keywordflow">return</span> residual_arc_capacity_[Opposite(arc)];</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#aafd4139404e4f42af650481c3ff10cc7"> 398</a></span>  <span class="keywordflow">return</span> -residual_arc_capacity_[arc];</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  }</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span> }</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a84859dfe0d913de5132fd421bf5d002d"> 401</a></span>  </div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span> <span class="comment">// We use the equations given in the comment of residual_arc_capacity_.</span></div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a></div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a9dcd8610149406a1593d2a0725290482"> 405</a></span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a9dcd8610149406a1593d2a0725290482">GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::Capacity</a>(</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a27a137ef3b0fb7f787eb460dcfd52591"> 407</a></span>  <span class="keywordflow">if</span> (IsArcDirect(arc)) {</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keywordflow">return</span> residual_arc_capacity_[arc] + residual_arc_capacity_[Opposite(arc)];</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  }</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span> }</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  </div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a1057f1a98821c9237d75967b575f3829"> 415</a></span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a1057f1a98821c9237d75967b575f3829">GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::UnitCost</a>(</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsArcValid(arc));</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(<a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a>{1}, cost_scaling_factor_);</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordflow">return</span> scaled_arc_unit_cost_[arc];</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span> }</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  </div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#aafd4139404e4f42af650481c3ff10cc7"> 423</a></span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#aafd4139404e4f42af650481c3ff10cc7">GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::Supply</a>(</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(graph_->IsNodeValid(node));</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keywordflow">return</span> node_excess_[node];</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span> }</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  </div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a></div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a84859dfe0d913de5132fd421bf5d002d"> 431</a></span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a84859dfe0d913de5132fd421bf5d002d">GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::InitialSupply</a>(</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="keywordflow">return</span> initial_node_excess_[node];</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span> }</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  </div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a></div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a27a137ef3b0fb7f787eb460dcfd52591"> 438</a></span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a27a137ef3b0fb7f787eb460dcfd52591">GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::FeasibleSupply</a>(</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keywordflow">return</span> feasible_node_excess_[node];</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span> }</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  </div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html">GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::IsAdmissible</a>(</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordflow">return</span> FastIsAdmissible(arc, node_potential_[Tail(arc)]);</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span> }</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  </div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span> <span class="keywordtype">bool</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  FastIsAdmissible(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc, <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> tail_potential)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(node_potential_[Tail(arc)], tail_potential);</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="keywordflow">return</span> residual_arc_capacity_[arc] > 0 &&</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  FastReducedCost(arc, tail_potential) < 0;</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span> }</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  </div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span> <span class="keywordtype">bool</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::IsActive(</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keywordflow">return</span> node_excess_[node] > 0;</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span> }</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  </div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a></div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::ReducedCost(</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keywordflow">return</span> FastReducedCost(arc, node_potential_[Tail(arc)]);</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span> }</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  </div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a></div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::FastReducedCost(</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc, <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> tail_potential)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(node_potential_[Tail(arc)], tail_potential);</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(graph_->IsNodeValid(Tail(arc)));</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(graph_->IsNodeValid(Head(arc)));</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(node_potential_[Tail(arc)], 0) << DebugString(<span class="stringliteral">"ReducedCost:"</span>, arc);</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(node_potential_[Head(arc)], 0) << DebugString(<span class="stringliteral">"ReducedCost:"</span>, arc);</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keywordflow">return</span> scaled_arc_unit_cost_[arc] + tail_potential -</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  node_potential_[Head(arc)];</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span> }</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  </div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span> <span class="keyword">typename</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::ArcIndex</a></div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  GetFirstOutgoingOrOppositeIncomingArc(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  OutgoingOrOppositeIncomingArcIterator arc_it(*graph_, node);</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keywordflow">return</span> arc_it.Index();</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span> }</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  </div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_min_cost_flow.html#a942f29030f08426e7e318204e987e2f7"> 492</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a942f29030f08426e7e318204e987e2f7">GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::Solve</a>() {</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  status_ = NOT_SOLVED;</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keywordflow">if</span> (absl::GetFlag(FLAGS_min_cost_flow_check_balance) &&</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  !CheckInputConsistency()) {</div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  status_ = UNBALANCED;</div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  }</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">if</span> (absl::GetFlag(FLAGS_min_cost_flow_check_costs) && !CheckCostRange()) {</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  status_ = BAD_COST_RANGE;</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  }</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keywordflow">if</span> (check_feasibility_ && !CheckFeasibility(<span class="keyword">nullptr</span>, <span class="keyword">nullptr</span>)) {</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  status_ = INFEASIBLE;</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  }</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  node_potential_.SetAll(0);</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  ResetFirstAdmissibleArcs();</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  ScaleCosts();</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  Optimize();</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordflow">if</span> (absl::GetFlag(FLAGS_min_cost_flow_check_result) && !CheckResult()) {</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  status_ = BAD_RESULT;</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  UnscaleCosts();</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  }</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  UnscaleCosts();</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordflow">if</span> (status_ != OPTIMAL) {</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(DFATAL) << <span class="stringliteral">"Status != OPTIMAL"</span>;</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  total_flow_cost_ = 0;</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  }</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  total_flow_cost_ = 0;</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc = 0; arc < graph_->num_arcs(); ++arc) {</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> flow_on_arc = residual_arc_capacity_[Opposite(arc)];</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  total_flow_cost_ += scaled_arc_unit_cost_[arc] * flow_on_arc;</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  }</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  status_ = OPTIMAL;</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <a class="code" href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a>(<a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << stats_.StatString());</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span> }</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  </div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_min_cost_flow.html">GenericMinCostFlow</a><<a class="code" href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">Graph</a>, ArcFlowType,</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  ArcScaledCostType>::ResetFirstAdmissibleArcs() {</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node = 0; node < graph_->num_nodes(); ++node) {</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  first_admissible_arc_.Set(node,</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  GetFirstOutgoingOrOppositeIncomingArc(node));</div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  }</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span> }</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  </div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span> <span class="keywordtype">void</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::ScaleCosts() {</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  cost_scaling_factor_ = graph_->num_nodes() + 1;</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  epsilon_ = 1LL;</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(3) << <span class="stringliteral">"Number of nodes in the graph = "</span> << graph_->num_nodes();</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(3) << <span class="stringliteral">"Number of arcs in the graph = "</span> << graph_->num_arcs();</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc = 0; arc < graph_->num_arcs(); ++arc) {</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> = scaled_arc_unit_cost_[arc] * cost_scaling_factor_;</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  scaled_arc_unit_cost_.Set(arc, <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>);</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  scaled_arc_unit_cost_.Set(Opposite(arc), -<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>);</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  epsilon_ = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(epsilon_, <a class="code" href="classoperations__research_1_1_math_util.html#a5a6f14696b2a09c97b58e4f0989b19e7">MathUtil::Abs</a>(<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>));</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  }</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(3) << <span class="stringliteral">"Initial epsilon = "</span> << epsilon_;</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(3) << <span class="stringliteral">"Cost scaling factor = "</span> << cost_scaling_factor_;</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span> }</div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  </div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span> <span class="keywordtype">void</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::UnscaleCosts() {</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc = 0; arc < graph_->num_arcs(); ++arc) {</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> = scaled_arc_unit_cost_[arc] / cost_scaling_factor_;</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  scaled_arc_unit_cost_.Set(arc, <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>);</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  scaled_arc_unit_cost_.Set(Opposite(arc), -<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>);</div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  }</div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  cost_scaling_factor_ = 1;</div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span> }</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  </div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span> <span class="keywordtype">void</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::Optimize() {</div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> kEpsilonMin = 1LL;</div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  num_relabels_since_last_price_update_ = 0;</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="keywordflow">do</span> {</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="comment">// Avoid epsilon_ == 0.</span></div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  epsilon_ = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(epsilon_ / alpha_, kEpsilonMin);</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(3) << <span class="stringliteral">"Epsilon changed to: "</span> << epsilon_;</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  Refine();</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  } <span class="keywordflow">while</span> (epsilon_ != 1LL && status_ != INFEASIBLE);</div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keywordflow">if</span> (status_ == NOT_SOLVED) {</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  status_ = <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2579881e7c83261bc21bafb5a5c92cad">OPTIMAL</a>;</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  }</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span> }</div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  </div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span> <span class="keywordtype">void</span> GenericMinCostFlow<<a class="code" href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">Graph</a>, ArcFlowType,</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  ArcScaledCostType>::SaturateAdmissibleArcs() {</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node = 0; node < graph_->num_nodes(); ++node) {</div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> tail_potential = node_potential_[node];</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keywordflow">for</span> (OutgoingOrOppositeIncomingArcIterator it(*graph_, node,</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  first_admissible_arc_[node]);</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  it.Ok(); it.Next()) {</div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc = it.Index();</div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keywordflow">if</span> (FastIsAdmissible(arc, tail_potential)) {</div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  FastPushFlow(residual_arc_capacity_[arc], arc, node);</div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  }</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  }</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  </div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="comment">// We just saturated all the admissible arcs, so there are no arcs with a</span></div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="comment">// positive residual capacity that are incident to the current node.</span></div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="comment">// Moreover, during the course of the algorithm, if the residual capacity of</span></div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="comment">// such an arc becomes positive again, then the arc is still not admissible</span></div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="comment">// until we relabel the node (because the reverse arc was admissible for</span></div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="comment">// this to happen). In conclusion, the optimization below is correct.</span></div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  first_admissible_arc_[node] = Graph::kNilArc;</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  }</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span> }</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  </div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span> <span class="keywordtype">void</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::PushFlow(</div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> flow, <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc) {</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  FastPushFlow(flow, arc, Tail(arc));</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span> }</div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  </div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span> <span class="keywordtype">void</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::FastPushFlow(</div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> flow, <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc, <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>) {</div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(Tail(arc), <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>);</div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(residual_arc_capacity_[arc], 0);</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(flow, residual_arc_capacity_[arc]);</div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="comment">// Reduce the residual capacity on the arc by flow.</span></div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  residual_arc_capacity_.Set(arc, residual_arc_capacity_[arc] - flow);</div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="comment">// Increase the residual capacity on the opposite arc by flow.</span></div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> opposite = Opposite(arc);</div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  residual_arc_capacity_.Set(opposite, residual_arc_capacity_[opposite] + flow);</div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="comment">// Update the excesses at the tail and head of the arc.</span></div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  node_excess_.Set(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, node_excess_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>] - flow);</div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> = Head(arc);</div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  node_excess_.Set(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>, node_excess_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>] + flow);</div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span> }</div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  </div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span> <span class="keywordtype">void</span> GenericMinCostFlow<<a class="code" href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">Graph</a>, ArcFlowType,</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  ArcScaledCostType>::InitializeActiveNodeStack() {</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(active_nodes_.empty());</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node = 0; node < graph_->num_nodes(); ++node) {</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="keywordflow">if</span> (IsActive(node)) {</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  active_nodes_.push(node);</div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  }</div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  }</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span> }</div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  </div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span> <span class="keywordtype">void</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::UpdatePrices() {</div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  </div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="comment">// The algorithm works as follows. Start with a set of nodes S containing all</span></div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="comment">// the nodes with negative excess. Expand the set along reverse admissible</span></div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="comment">// arcs. If at the end, the complement of S contains at least one node with</span></div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="comment">// positive excess, relabel all the nodes in the complement of S by</span></div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="comment">// subtracting epsilon from their current potential. See the paper cited in</span></div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="comment">// the .h file.</span></div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="comment">// After this relabeling is done, the heuristic is reapplied by extending S as</span></div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="comment">// much as possible, relabeling the complement of S, and so on until there is</span></div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="comment">// no node with positive excess that is not in S. Note that this is not</span></div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="comment">// described in the paper.</span></div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="comment">// Note(user): The triggering mechanism of this UpdatePrices() is really</span></div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="comment">// important; if it is not done properly it may degrade performance!</span></div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  </div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="comment">// This represents the set S.</span></div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> num_nodes = graph_->num_nodes();</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  std::vector<NodeIndex> bfs_queue;</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  std::vector<bool> node_in_queue(num_nodes, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  </div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="comment">// This is used to update the potential of the nodes not in S.</span></div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> kMinCostValue = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::numeric_limits<CostValue>::min</a>();</div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  std::vector<CostValue> min_non_admissible_potential(num_nodes, kMinCostValue);</div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  std::vector<NodeIndex> nodes_to_process;</div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  </div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="comment">// Sum of the positive excesses out of S, used for early exit.</span></div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> remaining_excess = 0;</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  </div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="comment">// First consider the nodes which have a negative excess.</span></div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node = 0; node < num_nodes; ++node) {</div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keywordflow">if</span> (node_excess_[node] < 0) {</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  bfs_queue.push_back(node);</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  node_in_queue[node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  </div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="comment">// This uses the fact that the sum of excesses is always 0.</span></div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  remaining_excess -= node_excess_[node];</div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  }</div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  }</div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  </div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <span class="comment">// All the nodes not yet in the bfs_queue will have their potential changed by</span></div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="comment">// +potential_delta (which becomes more and more negative at each pass). This</span></div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="comment">// update is applied when a node is pushed into the queue and at the end of</span></div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="comment">// the function for the nodes that are still unprocessed.</span></div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> potential_delta = 0;</div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  </div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keywordtype">int</span> queue_index = 0;</div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keywordflow">while</span> (remaining_excess > 0) {</div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="comment">// Reverse BFS that expands S as much as possible in the reverse admissible</span></div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="comment">// graph. Once S cannot be expanded anymore, perform a relabeling on the</span></div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="comment">// nodes not in S but that can reach it in one arc and try to expand S</span></div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <span class="comment">// again.</span></div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="keywordflow">for</span> (; queue_index < bfs_queue.size(); ++queue_index) {</div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(num_nodes, bfs_queue.size());</div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node = bfs_queue[queue_index];</div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="keywordflow">for</span> (OutgoingOrOppositeIncomingArcIterator it(*graph_, node); it.Ok();</div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  it.Next()) {</div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> = Head(it.Index());</div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="keywordflow">if</span> (node_in_queue[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> opposite_arc = Opposite(it.Index());</div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keywordflow">if</span> (residual_arc_capacity_[opposite_arc] > 0) {</div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  node_potential_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>] += potential_delta;</div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="keywordflow">if</span> (ReducedCost(opposite_arc) < 0) {</div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsAdmissible(opposite_arc));</div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  </div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="comment">// TODO(user): Try to steal flow if node_excess_[head] > 0.</span></div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="comment">// An initial experiment didn't show a big speedup though.</span></div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  </div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  remaining_excess -= node_excess_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>];</div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="keywordflow">if</span> (remaining_excess == 0) {</div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  node_potential_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>] -= potential_delta;</div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  }</div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  bfs_queue.push_back(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  node_in_queue[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="keywordflow">if</span> (potential_delta < 0) {</div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  first_admissible_arc_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>] =</div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  GetFirstOutgoingOrOppositeIncomingArc(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  }</div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="comment">// The opposite_arc is not admissible but is in the residual graph;</span></div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <span class="comment">// this updates its min_non_admissible_potential.</span></div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  node_potential_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>] -= potential_delta;</div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  <span class="keywordflow">if</span> (min_non_admissible_potential[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>] == kMinCostValue) {</div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  nodes_to_process.push_back(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  }</div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  min_non_admissible_potential[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>] = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(</div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  min_non_admissible_potential[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>],</div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  node_potential_[node] - scaled_arc_unit_cost_[opposite_arc]);</div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  }</div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  }</div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  }</div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <span class="keywordflow">if</span> (remaining_excess == 0) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  }</div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="keywordflow">if</span> (remaining_excess == 0) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  </div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <span class="comment">// Decrease by as much as possible instead of decreasing by epsilon.</span></div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  <span class="comment">// TODO(user): Is it worth the extra loop?</span></div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> max_potential_diff = kMinCostValue;</div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nodes_to_process.size(); ++i) {</div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node = nodes_to_process[i];</div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="keywordflow">if</span> (node_in_queue[node]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  max_potential_diff =</div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(max_potential_diff,</div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  min_non_admissible_potential[node] - node_potential_[node]);</div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  <span class="keywordflow">if</span> (max_potential_diff == potential_delta) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  }</div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(max_potential_diff, potential_delta);</div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  potential_delta = max_potential_diff - epsilon_;</div>
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  </div>
|
|
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="comment">// Loop over nodes_to_process_ and for each node, apply the first of the</span></div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="comment">// rules below that match or leave it in the queue for later iteration:</span></div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="comment">// - Remove it if it is already in the queue.</span></div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="comment">// - If the node is connected to S by an admissible arc after it is</span></div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="comment">// relabeled by +potential_delta, add it to bfs_queue_ and remove it from</span></div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="comment">// nodes_to_process.</span></div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0;</div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nodes_to_process.size(); ++i) {</div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node = nodes_to_process[i];</div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  <span class="keywordflow">if</span> (node_in_queue[node]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="keywordflow">if</span> (node_potential_[node] + potential_delta <</div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  min_non_admissible_potential[node]) {</div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  node_potential_[node] += potential_delta;</div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  first_admissible_arc_[node] =</div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  GetFirstOutgoingOrOppositeIncomingArc(node);</div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  bfs_queue.push_back(node);</div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  node_in_queue[node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  remaining_excess -= node_excess_[node];</div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  }</div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  </div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="comment">// Keep the node for later iteration.</span></div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  nodes_to_process[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = node;</div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  }</div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  nodes_to_process.resize(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  }</div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  </div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="comment">// Update the potentials of the nodes not yet processed.</span></div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  <span class="keywordflow">if</span> (potential_delta == 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node = 0; node < num_nodes; ++node) {</div>
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <span class="keywordflow">if</span> (!node_in_queue[node]) {</div>
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  node_potential_[node] += potential_delta;</div>
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  first_admissible_arc_[node] = GetFirstOutgoingOrOppositeIncomingArc(node);</div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  }</div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  }</div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span> }</div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  </div>
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span> <span class="keywordtype">void</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::Refine() {</div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  SaturateAdmissibleArcs();</div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  InitializeActiveNodeStack();</div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  </div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> num_nodes = graph_->num_nodes();</div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keywordflow">while</span> (status_ != INFEASIBLE && !active_nodes_.empty()) {</div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="comment">// TODO(user): Experiment with different factors in front of num_nodes.</span></div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <span class="keywordflow">if</span> (num_relabels_since_last_price_update_ >= num_nodes) {</div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  num_relabels_since_last_price_update_ = 0;</div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="keywordflow">if</span> (use_price_update_) {</div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  UpdatePrices();</div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  }</div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  }</div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node = active_nodes_.top();</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  active_nodes_.pop();</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsActive(node));</div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  Discharge(node);</div>
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  }</div>
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span> }</div>
|
|
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  </div>
|
|
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span> <span class="keywordtype">void</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::Discharge(</div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node) {</div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  <span class="keywordflow">do</span> {</div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="comment">// The node is initially active, and we exit as soon as it becomes</span></div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="comment">// inactive.</span></div>
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsActive(node));</div>
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> tail_potential = node_potential_[node];</div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  <span class="keywordflow">for</span> (OutgoingOrOppositeIncomingArcIterator it(*graph_, node,</div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  first_admissible_arc_[node]);</div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  it.Ok(); it.Next()) {</div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc = it.Index();</div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="keywordflow">if</span> (FastIsAdmissible(arc, tail_potential)) {</div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> = Head(arc);</div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="keywordflow">if</span> (!LookAhead(arc, tail_potential, <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> head_active_before_push = IsActive(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a> =</div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(node_excess_[node],</div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <span class="keyword">static_cast<</span><a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a><span class="keyword">></span>(residual_arc_capacity_[arc]));</div>
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  FastPushFlow(<a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>, arc, node);</div>
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <span class="keywordflow">if</span> (IsActive(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>) && !head_active_before_push) {</div>
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  active_nodes_.push(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  }</div>
|
|
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="keywordflow">if</span> (node_excess_[node] == 0) {</div>
|
|
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="comment">// arc may still be admissible.</span></div>
|
|
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  first_admissible_arc_.Set(node, arc);</div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  }</div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  }</div>
|
|
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  }</div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  Relabel(node);</div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  } <span class="keywordflow">while</span> (status_ != INFEASIBLE);</div>
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span> }</div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  </div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span> <span class="keywordtype">bool</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::LookAhead(</div>
|
|
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> in_arc, <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> in_tail_potential, <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node) {</div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(Head(in_arc), node);</div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(node_potential_[Tail(in_arc)], in_tail_potential);</div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="keywordflow">if</span> (node_excess_[node] < 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> tail_potential = node_potential_[node];</div>
|
|
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <span class="keywordflow">for</span> (OutgoingOrOppositeIncomingArcIterator it(*graph_, node,</div>
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  first_admissible_arc_[node]);</div>
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  it.Ok(); it.Next()) {</div>
|
|
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc = it.Index();</div>
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  <span class="keywordflow">if</span> (FastIsAdmissible(arc, tail_potential)) {</div>
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  first_admissible_arc_.Set(node, arc);</div>
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  }</div>
|
|
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  }</div>
|
|
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  </div>
|
|
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="comment">// The node we looked ahead has no admissible arc at its current potential.</span></div>
|
|
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  <span class="comment">// We relabel it and return true if the original arc is still admissible.</span></div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  Relabel(node);</div>
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <span class="keywordflow">return</span> FastIsAdmissible(in_arc, in_tail_potential);</div>
|
|
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span> }</div>
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  </div>
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span> <span class="keywordtype">void</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::Relabel(</div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node) {</div>
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(CheckRelabelPrecondition(node));</div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  ++num_relabels_since_last_price_update_;</div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  </div>
|
|
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="comment">// By setting node_potential_[node] to the guaranteed_new_potential we are</span></div>
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="comment">// sure to keep epsilon-optimality of the pseudo-flow. Note that we could</span></div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="comment">// return right away with this value, but we prefer to check that this value</span></div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="comment">// will lead to at least one admissible arc, and if not, to decrease the</span></div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="comment">// potential as much as possible.</span></div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> guaranteed_new_potential = node_potential_[node] - epsilon_;</div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  </div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="comment">// This will be updated to contain the minimum node potential for which</span></div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  <span class="comment">// the node has no admissible arc. We know that:</span></div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="comment">// - min_non_admissible_potential <= node_potential_[node]</span></div>
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <span class="comment">// - We can set the new node potential to min_non_admissible_potential -</span></div>
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="comment">// epsilon_ and still keep the epsilon-optimality of the pseudo flow.</span></div>
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> kMinCostValue = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::numeric_limits<CostValue>::min</a>();</div>
|
|
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> min_non_admissible_potential = kMinCostValue;</div>
|
|
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  </div>
|
|
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <span class="comment">// The following variables help setting the first_admissible_arc_[node] to a</span></div>
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="comment">// value different from GetFirstOutgoingOrOppositeIncomingArc(node) which</span></div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="comment">// avoids looking again at some arcs.</span></div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> previous_min_non_admissible_potential = kMinCostValue;</div>
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> first_arc = Graph::kNilArc;</div>
|
|
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  </div>
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="keywordflow">for</span> (OutgoingOrOppositeIncomingArcIterator it(*graph_, node); it.Ok();</div>
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  it.Next()) {</div>
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc = it.Index();</div>
|
|
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="keywordflow">if</span> (residual_arc_capacity_[arc] > 0) {</div>
|
|
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> min_non_admissible_potential_for_arc =</div>
|
|
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  node_potential_[Head(arc)] - scaled_arc_unit_cost_[arc];</div>
|
|
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="keywordflow">if</span> (min_non_admissible_potential_for_arc > min_non_admissible_potential) {</div>
|
|
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <span class="keywordflow">if</span> (min_non_admissible_potential_for_arc > guaranteed_new_potential) {</div>
|
|
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="comment">// We found an admissible arc for the guaranteed_new_potential. We</span></div>
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <span class="comment">// stop right now instead of trying to compute the minimum possible</span></div>
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  <span class="comment">// new potential that keeps the epsilon-optimality of the pseudo flow.</span></div>
|
|
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  node_potential_.Set(node, guaranteed_new_potential);</div>
|
|
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  first_admissible_arc_.Set(node, arc);</div>
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  }</div>
|
|
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  previous_min_non_admissible_potential = min_non_admissible_potential;</div>
|
|
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  min_non_admissible_potential = min_non_admissible_potential_for_arc;</div>
|
|
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  first_arc = arc;</div>
|
|
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  }</div>
|
|
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  }</div>
|
|
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  }</div>
|
|
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  </div>
|
|
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  <span class="comment">// No admissible arc leaves this node!</span></div>
|
|
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  <span class="keywordflow">if</span> (min_non_admissible_potential == kMinCostValue) {</div>
|
|
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="keywordflow">if</span> (node_excess_[node] != 0) {</div>
|
|
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="comment">// Note that this infeasibility detection is incomplete.</span></div>
|
|
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="comment">// Only max flow can detect that a min-cost flow problem is infeasible.</span></div>
|
|
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  status_ = <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2884fa43446c0cbc9c7a9b74d41d7483">INFEASIBLE</a>;</div>
|
|
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ac9bcbe19995a8140cd4ec61773cd6e67">ERROR</a>) << <span class="stringliteral">"Infeasible problem."</span>;</div>
|
|
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="comment">// This source saturates all its arcs, we can actually decrease the</span></div>
|
|
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="comment">// potential by as much as we want.</span></div>
|
|
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  <span class="comment">// TODO(user): Set it to a minimum value, but be careful of overflow.</span></div>
|
|
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  node_potential_.Set(node, guaranteed_new_potential);</div>
|
|
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  first_admissible_arc_.Set(node,</div>
|
|
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  GetFirstOutgoingOrOppositeIncomingArc(node));</div>
|
|
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  }</div>
|
|
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  }</div>
|
|
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  </div>
|
|
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <span class="comment">// We decrease the potential as much as possible, but we do not know the first</span></div>
|
|
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  <span class="comment">// admissible arc (most of the time). Keeping the</span></div>
|
|
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  <span class="comment">// previous_min_non_admissible_potential makes it faster by a few percent.</span></div>
|
|
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> new_potential = min_non_admissible_potential - epsilon_;</div>
|
|
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  node_potential_.Set(node, new_potential);</div>
|
|
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  <span class="keywordflow">if</span> (previous_min_non_admissible_potential <= new_potential) {</div>
|
|
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  first_admissible_arc_.Set(node, first_arc);</div>
|
|
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  <span class="comment">// We have no indication of what may be the first admissible arc.</span></div>
|
|
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  first_admissible_arc_.Set(node,</div>
|
|
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  GetFirstOutgoingOrOppositeIncomingArc(node));</div>
|
|
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  }</div>
|
|
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span> }</div>
|
|
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  </div>
|
|
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span> <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">Graph::ArcIndex</a></div>
|
|
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::Opposite(</div>
|
|
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1_graphs.html#ae9cc106c6139c0b4e57057594bf56ea8">Graphs<Graph>::OppositeArc</a>(*graph_, arc);</div>
|
|
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span> }</div>
|
|
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  </div>
|
|
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span> <span class="keywordtype">bool</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::IsArcValid(</div>
|
|
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1_graphs.html#ae02cd8602383e4fb48a8a933325db5fd">Graphs<Graph>::IsArcValid</a>(*graph_, arc);</div>
|
|
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span> }</div>
|
|
<div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  </div>
|
|
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph, <span class="keyword">typename</span> ArcFlowType, <span class="keyword">typename</span> ArcScaledCostType></div>
|
|
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span> <span class="keywordtype">bool</span> GenericMinCostFlow<Graph, ArcFlowType, ArcScaledCostType>::IsArcDirect(</div>
|
|
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsArcValid(arc));</div>
|
|
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  <span class="keywordflow">return</span> arc >= 0;</div>
|
|
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span> }</div>
|
|
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  </div>
|
|
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span> <span class="comment">// Explicit instantiations that can be used by a client.</span></div>
|
|
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span> <span class="comment">// TODO(user): Move this code out of a .cc file and include it at the end of</span></div>
|
|
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span> <span class="comment">// the header so it can work with any graph implementation?</span></div>
|
|
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span> <span class="keyword">template</span> <span class="keyword">class </span>GenericMinCostFlow<StarGraph>;</div>
|
|
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span> <span class="keyword">template</span> <span class="keyword">class </span>GenericMinCostFlow<::util::ReverseArcListGraph<>>;</div>
|
|
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span> <span class="keyword">template</span> <span class="keyword">class </span>GenericMinCostFlow<::util::ReverseArcStaticGraph<>>;</div>
|
|
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span> <span class="keyword">template</span> <span class="keyword">class </span>GenericMinCostFlow<::util::ReverseArcMixedGraph<>>;</div>
|
|
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span> <span class="keyword">template</span> <span class="keyword">class </span>GenericMinCostFlow<::util::ReverseArcStaticGraph<uint16, int32>>;</div>
|
|
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  </div>
|
|
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span> <span class="comment">// A more memory-efficient version for large graphs.</span></div>
|
|
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span> <span class="keyword">template</span> <span class="keyword">class </span>GenericMinCostFlow<::util::ReverseArcStaticGraph<uint16, int32>,</div>
|
|
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  <span class="comment">/*ArcFlowType=*/</span><a class="code" href="integral__types_8h.html#a4355d16fcf9f644c9ac84293f0b1801f">int16</a>,</div>
|
|
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  <span class="comment">/*ArcScaledCostType=*/</span><a class="code" href="integral__types_8h.html#a56f1a81c92849566ae864511088eb7e8">int32</a>>;</div>
|
|
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  </div>
|
|
<div class="line"><a name="l00995"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_min_cost_flow.html#a6d65a7ab08c98b332781f187776683e5"> 995</a></span> <a class="code" href="classoperations__research_1_1_simple_min_cost_flow.html#a6d65a7ab08c98b332781f187776683e5">SimpleMinCostFlow::SimpleMinCostFlow</a>(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> reserve_num_nodes,</div>
|
|
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> reserve_num_arcs) {</div>
|
|
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  <span class="keywordflow">if</span> (reserve_num_nodes > 0) {</div>
|
|
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  node_supply_.reserve(reserve_num_nodes);</div>
|
|
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  }</div>
|
|
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  <span class="keywordflow">if</span> (reserve_num_arcs > 0) {</div>
|
|
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  arc_tail_.reserve(reserve_num_arcs);</div>
|
|
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  arc_head_.reserve(reserve_num_arcs);</div>
|
|
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  arc_capacity_.reserve(reserve_num_arcs);</div>
|
|
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  arc_cost_.reserve(reserve_num_arcs);</div>
|
|
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  arc_permutation_.reserve(reserve_num_arcs);</div>
|
|
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  arc_flow_.reserve(reserve_num_arcs);</div>
|
|
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  }</div>
|
|
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span> }</div>
|
|
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  </div>
|
|
<div class="line"><a name="l01010"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_min_cost_flow.html#a7cd2dc0776a9f339b56ffac996a7df8c"> 1010</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_simple_min_cost_flow.html#a7cd2dc0776a9f339b56ffac996a7df8c">SimpleMinCostFlow::SetNodeSupply</a>(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node, <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> supply) {</div>
|
|
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  ResizeNodeVectors(node);</div>
|
|
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  node_supply_[node] = supply;</div>
|
|
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span> }</div>
|
|
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  </div>
|
|
<div class="line"><a name="l01015"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_min_cost_flow.html#a20e10ea36c32c30c5130f300f1ffde2e"> 1015</a></span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> <a class="code" href="classoperations__research_1_1_simple_min_cost_flow.html#a20e10ea36c32c30c5130f300f1ffde2e">SimpleMinCostFlow::AddArcWithCapacityAndUnitCost</a>(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>,</div>
|
|
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>,</div>
|
|
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>,</div>
|
|
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> unit_cost) {</div>
|
|
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  ResizeNodeVectors(<a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>));</div>
|
|
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc = arc_tail_.size();</div>
|
|
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  arc_tail_.push_back(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>);</div>
|
|
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  arc_head_.push_back(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  arc_capacity_.push_back(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>);</div>
|
|
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  arc_cost_.push_back(unit_cost);</div>
|
|
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  <span class="keywordflow">return</span> arc;</div>
|
|
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span> }</div>
|
|
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  </div>
|
|
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> SimpleMinCostFlow::PermutedArc(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc) {</div>
|
|
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="keywordflow">return</span> arc < arc_permutation_.size() ? arc_permutation_[arc] : arc;</div>
|
|
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span> }</div>
|
|
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  </div>
|
|
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span> <a class="code" href="classoperations__research_1_1_min_cost_flow_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SimpleMinCostFlow::Status</a> SimpleMinCostFlow::SolveWithPossibleAdjustment(</div>
|
|
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  SupplyAdjustment adjustment) {</div>
|
|
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  optimal_cost_ = 0;</div>
|
|
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  maximum_flow_ = 0;</div>
|
|
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  arc_flow_.clear();</div>
|
|
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> num_nodes = node_supply_.size();</div>
|
|
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> num_arcs = arc_capacity_.size();</div>
|
|
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  <span class="keywordflow">if</span> (num_nodes == 0) <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_min_cost_flow_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad">OPTIMAL</a>;</div>
|
|
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  </div>
|
|
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  <span class="keywordtype">int</span> supply_node_count = 0, demand_node_count = 0;</div>
|
|
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> total_supply = 0, total_demand = 0;</div>
|
|
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node = 0; node < num_nodes; ++node) {</div>
|
|
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  <span class="keywordflow">if</span> (node_supply_[node] > 0) {</div>
|
|
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  ++supply_node_count;</div>
|
|
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  total_supply += node_supply_[node];</div>
|
|
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (node_supply_[node] < 0) {</div>
|
|
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  ++demand_node_count;</div>
|
|
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  total_demand -= node_supply_[node];</div>
|
|
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  }</div>
|
|
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  }</div>
|
|
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  <span class="keywordflow">if</span> (adjustment == DONT_ADJUST && total_supply != total_demand) {</div>
|
|
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_min_cost_flow_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba6a2175a75814f119266396a0e9681718">UNBALANCED</a>;</div>
|
|
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  }</div>
|
|
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  </div>
|
|
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  <span class="comment">// Feasibility checking, and possible supply/demand adjustment, is done by:</span></div>
|
|
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  <span class="comment">// 1. Creating a new source and sink node.</span></div>
|
|
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  <span class="comment">// 2. Taking all nodes that have a non-zero supply or demand and</span></div>
|
|
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  <span class="comment">// connecting them to the source or sink respectively. The arc thus</span></div>
|
|
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  <span class="comment">// added has a capacity of the supply or demand.</span></div>
|
|
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  <span class="comment">// 3. Computing the max flow between the new source and sink.</span></div>
|
|
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  <span class="comment">// 4. If adjustment isn't being done, checking that the max flow is equal</span></div>
|
|
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  <span class="comment">// to the total supply/demand (and returning INFEASIBLE if it isn't).</span></div>
|
|
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  <span class="comment">// 5. Running min-cost max-flow on this augmented graph, using the max</span></div>
|
|
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  <span class="comment">// flow computed in step 3 as the supply of the source and demand of</span></div>
|
|
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  <span class="comment">// the sink.</span></div>
|
|
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> augmented_num_arcs =</div>
|
|
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  num_arcs + supply_node_count + demand_node_count;</div>
|
|
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> source = num_nodes;</div>
|
|
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> sink = num_nodes + 1;</div>
|
|
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> augmented_num_nodes = num_nodes + 2;</div>
|
|
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  </div>
|
|
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  <a class="code" href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">Graph</a> graph(augmented_num_nodes, augmented_num_arcs);</div>
|
|
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc = 0; arc < num_arcs; ++arc) {</div>
|
|
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  graph.AddArc(arc_tail_[arc], arc_head_[arc]);</div>
|
|
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  }</div>
|
|
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  </div>
|
|
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node = 0; node < num_nodes; ++node) {</div>
|
|
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <span class="keywordflow">if</span> (node_supply_[node] > 0) {</div>
|
|
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  graph.AddArc(source, node);</div>
|
|
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (node_supply_[node] < 0) {</div>
|
|
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  graph.AddArc(node, sink);</div>
|
|
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  }</div>
|
|
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  }</div>
|
|
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  </div>
|
|
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  graph.Build(&arc_permutation_);</div>
|
|
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  </div>
|
|
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  {</div>
|
|
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  GenericMaxFlow<Graph> max_flow(&graph, source, sink);</div>
|
|
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc;</div>
|
|
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  <span class="keywordflow">for</span> (arc = 0; arc < num_arcs; ++arc) {</div>
|
|
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  max_flow.SetArcCapacity(PermutedArc(arc), arc_capacity_[arc]);</div>
|
|
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  }</div>
|
|
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node = 0; node < num_nodes; ++node) {</div>
|
|
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  <span class="keywordflow">if</span> (node_supply_[node] != 0) {</div>
|
|
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  max_flow.SetArcCapacity(PermutedArc(arc), std::abs(node_supply_[node]));</div>
|
|
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  ++arc;</div>
|
|
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  }</div>
|
|
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  }</div>
|
|
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(arc, augmented_num_arcs);</div>
|
|
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="keywordflow">if</span> (!max_flow.Solve()) {</div>
|
|
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ac9bcbe19995a8140cd4ec61773cd6e67">ERROR</a>) << <span class="stringliteral">"Max flow could not be computed."</span>;</div>
|
|
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  <span class="keywordflow">switch</span> (max_flow.status()) {</div>
|
|
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1_max_flow_status_class.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba0e6873a155f86a4695f463bf8601d05f">MaxFlowStatusClass::NOT_SOLVED</a>:</div>
|
|
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_min_cost_flow_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba0e6873a155f86a4695f463bf8601d05f">NOT_SOLVED</a>;</div>
|
|
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1_max_flow_status_class.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad">MaxFlowStatusClass::OPTIMAL</a>:</div>
|
|
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ac9bcbe19995a8140cd4ec61773cd6e67">ERROR</a>)</div>
|
|
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  << <span class="stringliteral">"Max flow failed but claimed to have an optimal solution"</span>;</div>
|
|
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  ABSL_FALLTHROUGH_INTENDED;</div>
|
|
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_min_cost_flow_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac76ecfd837bdc6d4150bb02c403356e4">BAD_RESULT</a>;</div>
|
|
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  }</div>
|
|
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  }</div>
|
|
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  maximum_flow_ = max_flow.GetOptimalFlow();</div>
|
|
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  }</div>
|
|
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  </div>
|
|
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  <span class="keywordflow">if</span> (adjustment == DONT_ADJUST && maximum_flow_ != total_supply) {</div>
|
|
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_min_cost_flow_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">INFEASIBLE</a>;</div>
|
|
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  }</div>
|
|
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  </div>
|
|
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  GenericMinCostFlow<Graph> min_cost_flow(&graph);</div>
|
|
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc;</div>
|
|
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  <span class="keywordflow">for</span> (arc = 0; arc < num_arcs; ++arc) {</div>
|
|
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> permuted_arc = PermutedArc(arc);</div>
|
|
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  min_cost_flow.SetArcUnitCost(permuted_arc, arc_cost_[arc]);</div>
|
|
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  min_cost_flow.SetArcCapacity(permuted_arc, arc_capacity_[arc]);</div>
|
|
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  }</div>
|
|
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node = 0; node < num_nodes; ++node) {</div>
|
|
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  <span class="keywordflow">if</span> (node_supply_[node] != 0) {</div>
|
|
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> permuted_arc = PermutedArc(arc);</div>
|
|
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  min_cost_flow.SetArcCapacity(permuted_arc, std::abs(node_supply_[node]));</div>
|
|
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  min_cost_flow.SetArcUnitCost(permuted_arc, 0);</div>
|
|
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  ++arc;</div>
|
|
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  }</div>
|
|
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  }</div>
|
|
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  min_cost_flow.SetNodeSupply(source, maximum_flow_);</div>
|
|
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  min_cost_flow.SetNodeSupply(sink, -maximum_flow_);</div>
|
|
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  min_cost_flow.SetCheckFeasibility(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  </div>
|
|
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  arc_flow_.resize(num_arcs);</div>
|
|
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  <span class="keywordflow">if</span> (min_cost_flow.Solve()) {</div>
|
|
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  optimal_cost_ = min_cost_flow.GetOptimalCost();</div>
|
|
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  <span class="keywordflow">for</span> (arc = 0; arc < num_arcs; ++arc) {</div>
|
|
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  arc_flow_[arc] = min_cost_flow.Flow(PermutedArc(arc));</div>
|
|
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  }</div>
|
|
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  }</div>
|
|
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  <span class="keywordflow">return</span> min_cost_flow.status();</div>
|
|
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span> }</div>
|
|
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  </div>
|
|
<div class="line"><a name="l01150"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_min_cost_flow.html#ad39ce7ee10c34a3ce1f69f179aa4f1e9"> 1150</a></span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code" href="classoperations__research_1_1_simple_min_cost_flow.html#ad39ce7ee10c34a3ce1f69f179aa4f1e9">SimpleMinCostFlow::OptimalCost</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> optimal_cost_; }</div>
|
|
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  </div>
|
|
<div class="line"><a name="l01152"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_min_cost_flow.html#a3351fc1eb1dce4a7f6b937db874b5de1"> 1152</a></span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="classoperations__research_1_1_simple_min_cost_flow.html#a3351fc1eb1dce4a7f6b937db874b5de1">SimpleMinCostFlow::MaximumFlow</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> maximum_flow_; }</div>
|
|
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  </div>
|
|
<div class="line"><a name="l01154"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_min_cost_flow.html#a2a420ad8221c326064736ccf148d2f93"> 1154</a></span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="classoperations__research_1_1_simple_min_cost_flow.html#a2a420ad8221c326064736ccf148d2f93">SimpleMinCostFlow::Flow</a>(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  <span class="keywordflow">return</span> arc_flow_[arc];</div>
|
|
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span> }</div>
|
|
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  </div>
|
|
<div class="line"><a name="l01158"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_min_cost_flow.html#a3be0f6fcc44bc6a4a1e976c1e60b31d0"> 1158</a></span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="classoperations__research_1_1_simple_min_cost_flow.html#a3be0f6fcc44bc6a4a1e976c1e60b31d0">SimpleMinCostFlow::NumNodes</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> node_supply_.size(); }</div>
|
|
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  </div>
|
|
<div class="line"><a name="l01160"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_min_cost_flow.html#a7898be8b7efbfe53a58fcf621cf41315"> 1160</a></span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> <a class="code" href="classoperations__research_1_1_simple_min_cost_flow.html#a7898be8b7efbfe53a58fcf621cf41315">SimpleMinCostFlow::NumArcs</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> arc_tail_.size(); }</div>
|
|
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  </div>
|
|
<div class="line"><a name="l01162"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_min_cost_flow.html#a8f17f2cebe15f0a8f2b072738093379d"> 1162</a></span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> <a class="code" href="classoperations__research_1_1_simple_min_cost_flow.html#a8f17f2cebe15f0a8f2b072738093379d">SimpleMinCostFlow::Tail</a>(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> arc_tail_[arc]; }</div>
|
|
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  </div>
|
|
<div class="line"><a name="l01164"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_min_cost_flow.html#acf6f87e72f7535b5dfe004740ef52a1d"> 1164</a></span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> <a class="code" href="classoperations__research_1_1_simple_min_cost_flow.html#acf6f87e72f7535b5dfe004740ef52a1d">SimpleMinCostFlow::Head</a>(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> arc_head_[arc]; }</div>
|
|
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  </div>
|
|
<div class="line"><a name="l01166"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_min_cost_flow.html#a9dcd8610149406a1593d2a0725290482"> 1166</a></span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="classoperations__research_1_1_simple_min_cost_flow.html#a9dcd8610149406a1593d2a0725290482">SimpleMinCostFlow::Capacity</a>(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  <span class="keywordflow">return</span> arc_capacity_[arc];</div>
|
|
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span> }</div>
|
|
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  </div>
|
|
<div class="line"><a name="l01170"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_min_cost_flow.html#a1057f1a98821c9237d75967b575f3829"> 1170</a></span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code" href="classoperations__research_1_1_simple_min_cost_flow.html#a1057f1a98821c9237d75967b575f3829">SimpleMinCostFlow::UnitCost</a>(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  <span class="keywordflow">return</span> arc_cost_[arc];</div>
|
|
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span> }</div>
|
|
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  </div>
|
|
<div class="line"><a name="l01174"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_min_cost_flow.html#aafd4139404e4f42af650481c3ff10cc7"> 1174</a></span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="classoperations__research_1_1_simple_min_cost_flow.html#aafd4139404e4f42af650481c3ff10cc7">SimpleMinCostFlow::Supply</a>(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  <span class="keywordflow">return</span> node_supply_[node];</div>
|
|
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span> }</div>
|
|
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  </div>
|
|
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span> <span class="keywordtype">void</span> SimpleMinCostFlow::ResizeNodeVectors(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node) {</div>
|
|
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  <span class="keywordflow">if</span> (node < node_supply_.size()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  node_supply_.resize(node + 1);</div>
|
|
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span> }</div>
|
|
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  </div>
|
|
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a021e695f54a13bd809c34b2f4ca87c37"><div class="ttname"><a href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">min</a></div><div class="ttdeci">int64 min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00138">alldiff_cst.cc:138</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a9d0c202d5fdd62f4fa2c613339ff168a"><div class="ttname"><a href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">max</a></div><div class="ttdeci">int64 max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a4395e95bab44e222cb2e77251017a0e2"><div class="ttname"><a href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a></div><div class="ttdeci">#define DCHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00887">base/logging.h:887</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00697">base/logging.h:697</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_aae2dc65d9ea248d54bf39daa986dd295"><div class="ttname"><a href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a></div><div class="ttdeci">#define DCHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00889">base/logging.h:889</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab4f56aa24c4c9cddc47a6abd2d747f9a"><div class="ttname"><a href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a></div><div class="ttdeci">#define DCHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00890">base/logging.h:890</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_accad43a85d781d53381cd53a9894b6ae"><div class="ttname"><a href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a></div><div class="ttdeci">#define LOG(severity)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00420">base/logging.h:420</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00884">base/logging.h:884</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00885">base/logging.h:885</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00978">base/logging.h:978</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_ebert_graph_base_html_a7b505ba4a01bce342d049f5a8674da72"><div class="ttname"><a href="classoperations__research_1_1_ebert_graph_base.html#a7b505ba4a01bce342d049f5a8674da72">operations_research::EbertGraphBase::AddArc</a></div><div class="ttdeci">ArcIndexType AddArc(NodeIndexType tail, NodeIndexType head)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01001">ebert_graph.h:1001</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_ebert_graph_html"><div class="ttname"><a href="classoperations__research_1_1_ebert_graph.html">operations_research::EbertGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01186">ebert_graph.h:1188</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_ebert_graph_html_aae684b1eb132c8c201f437d88e367b55"><div class="ttname"><a href="classoperations__research_1_1_ebert_graph.html#aae684b1eb132c8c201f437d88e367b55">operations_research::EbertGraph::Tail</a></div><div class="ttdeci">NodeIndexType Tail(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01376">ebert_graph.h:1376</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a142146c1af2855fc821d7bd4c0af6130"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a142146c1af2855fc821d7bd4c0af6130">operations_research::GenericMaxFlow::GetOptimalFlow</a></div><div class="ttdeci">FlowQuantity GetOptimalFlow() const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00361">max_flow.h:361</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a21776d0248204801a49c42b46902c1a1"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a21776d0248204801a49c42b46902c1a1">operations_research::GenericMaxFlow::SetArcCapacity</a></div><div class="ttdeci">void SetArcCapacity(ArcIndex arc, FlowQuantity new_capacity)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00175">max_flow.cc:175</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a2a420ad8221c326064736ccf148d2f93"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a2a420ad8221c326064736ccf148d2f93">operations_research::GenericMaxFlow::Flow</a></div><div class="ttdeci">FlowQuantity Flow(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00365">max_flow.h:365</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a942f29030f08426e7e318204e987e2f7"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a942f29030f08426e7e318204e987e2f7">operations_research::GenericMaxFlow::Solve</a></div><div class="ttdeci">bool Solve()</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00334">max_flow.cc:334</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_aa4e5f2ba9abcf71460c68a4903abc7bc"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#aa4e5f2ba9abcf71460c68a4903abc7bc">operations_research::GenericMaxFlow::SetCheckResult</a></div><div class="ttdeci">void SetCheckResult(bool value)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00420">max_flow.h:420</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_aa76638d2f8eddf2c3d9778b3c1285010"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#aa76638d2f8eddf2c3d9778b3c1285010">operations_research::GenericMaxFlow::SetCheckInput</a></div><div class="ttdeci">void SetCheckInput(bool value)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00419">max_flow.h:419</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_min_cost_flow_html"><div class="ttname"><a href="classoperations__research_1_1_generic_min_cost_flow.html">operations_research::GenericMinCostFlow</a></div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8h_source.html#l00326">min_cost_flow.h:326</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_min_cost_flow_html_a1057f1a98821c9237d75967b575f3829"><div class="ttname"><a href="classoperations__research_1_1_generic_min_cost_flow.html#a1057f1a98821c9237d75967b575f3829">operations_research::GenericMinCostFlow::UnitCost</a></div><div class="ttdeci">CostValue UnitCost(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l00415">min_cost_flow.cc:415</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_min_cost_flow_html_a27a137ef3b0fb7f787eb460dcfd52591"><div class="ttname"><a href="classoperations__research_1_1_generic_min_cost_flow.html#a27a137ef3b0fb7f787eb460dcfd52591">operations_research::GenericMinCostFlow::FeasibleSupply</a></div><div class="ttdeci">FlowQuantity FeasibleSupply(NodeIndex node) const</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l00438">min_cost_flow.cc:438</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_min_cost_flow_html_a2a420ad8221c326064736ccf148d2f93"><div class="ttname"><a href="classoperations__research_1_1_generic_min_cost_flow.html#a2a420ad8221c326064736ccf148d2f93">operations_research::GenericMinCostFlow::Flow</a></div><div class="ttdeci">FlowQuantity Flow(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l00393">min_cost_flow.cc:393</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_min_cost_flow_html_a3051a4b6d1a5a9fb5444f6d5a295a95c"><div class="ttname"><a href="classoperations__research_1_1_generic_min_cost_flow.html#a3051a4b6d1a5a9fb5444f6d5a295a95c">operations_research::GenericMinCostFlow::MakeFeasible</a></div><div class="ttdeci">bool MakeFeasible()</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l00380">min_cost_flow.cc:380</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_min_cost_flow_html_a34e6d785d3dc22ee8d54bad8f1cf6cc2"><div class="ttname"><a href="classoperations__research_1_1_generic_min_cost_flow.html#a34e6d785d3dc22ee8d54bad8f1cf6cc2">operations_research::GenericMinCostFlow::GenericMinCostFlow</a></div><div class="ttdeci">GenericMinCostFlow(const Graph *graph)</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l00047">min_cost_flow.cc:47</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_min_cost_flow_html_a44aa9e2f47277c91d8064c7126a2ff48"><div class="ttname"><a href="classoperations__research_1_1_generic_min_cost_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">operations_research::GenericMinCostFlow::ArcIndex</a></div><div class="ttdeci">Graph::ArcIndex ArcIndex</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8h_source.html#l00329">min_cost_flow.h:329</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_min_cost_flow_html_a4ddaeee9414a17257bb052c459325caf"><div class="ttname"><a href="classoperations__research_1_1_generic_min_cost_flow.html#a4ddaeee9414a17257bb052c459325caf">operations_research::GenericMinCostFlow::NodeIndex</a></div><div class="ttdeci">Graph::NodeIndex NodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8h_source.html#l00328">min_cost_flow.h:328</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_min_cost_flow_html_a7cd2dc0776a9f339b56ffac996a7df8c"><div class="ttname"><a href="classoperations__research_1_1_generic_min_cost_flow.html#a7cd2dc0776a9f339b56ffac996a7df8c">operations_research::GenericMinCostFlow::SetNodeSupply</a></div><div class="ttdeci">void SetNodeSupply(NodeIndex node, FlowQuantity supply)</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l00090">min_cost_flow.cc:90</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_min_cost_flow_html_a84859dfe0d913de5132fd421bf5d002d"><div class="ttname"><a href="classoperations__research_1_1_generic_min_cost_flow.html#a84859dfe0d913de5132fd421bf5d002d">operations_research::GenericMinCostFlow::InitialSupply</a></div><div class="ttdeci">FlowQuantity InitialSupply(NodeIndex node) const</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l00431">min_cost_flow.cc:431</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_min_cost_flow_html_a89b020eea8abc71434d63071a1e38527"><div class="ttname"><a href="classoperations__research_1_1_generic_min_cost_flow.html#a89b020eea8abc71434d63071a1e38527">operations_research::GenericMinCostFlow::SetArcFlow</a></div><div class="ttdeci">void SetArcFlow(ArcIndex arc, ArcFlowType new_flow)</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l00149">min_cost_flow.cc:149</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_min_cost_flow_html_a92607deae80e69a2a63cc2d8f5205bd5"><div class="ttname"><a href="classoperations__research_1_1_generic_min_cost_flow.html#a92607deae80e69a2a63cc2d8f5205bd5">operations_research::GenericMinCostFlow::CheckFeasibility</a></div><div class="ttdeci">bool CheckFeasibility(std::vector< NodeIndex > *const infeasible_supply_node, std::vector< NodeIndex > *const infeasible_demand_node)</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l00292">min_cost_flow.cc:293</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_min_cost_flow_html_a942f29030f08426e7e318204e987e2f7"><div class="ttname"><a href="classoperations__research_1_1_generic_min_cost_flow.html#a942f29030f08426e7e318204e987e2f7">operations_research::GenericMinCostFlow::Solve</a></div><div class="ttdeci">bool Solve()</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l00492">min_cost_flow.cc:492</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_min_cost_flow_html_a9dcd8610149406a1593d2a0725290482"><div class="ttname"><a href="classoperations__research_1_1_generic_min_cost_flow.html#a9dcd8610149406a1593d2a0725290482">operations_research::GenericMinCostFlow::Capacity</a></div><div class="ttdeci">FlowQuantity Capacity(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l00405">min_cost_flow.cc:405</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_min_cost_flow_html_aafd4139404e4f42af650481c3ff10cc7"><div class="ttname"><a href="classoperations__research_1_1_generic_min_cost_flow.html#aafd4139404e4f42af650481c3ff10cc7">operations_research::GenericMinCostFlow::Supply</a></div><div class="ttdeci">FlowQuantity Supply(NodeIndex node) const</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l00423">min_cost_flow.cc:423</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_min_cost_flow_html_ab7f4041c8667d63761aecb9657823945"><div class="ttname"><a href="classoperations__research_1_1_generic_min_cost_flow.html#ab7f4041c8667d63761aecb9657823945">operations_research::GenericMinCostFlow::SetArcUnitCost</a></div><div class="ttdeci">void SetArcUnitCost(ArcIndex arc, ArcScaledCostType unit_cost)</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l00100">min_cost_flow.cc:100</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_min_cost_flow_html_aeb6622ffa760bc9403144736f8ac4ad4"><div class="ttname"><a href="classoperations__research_1_1_generic_min_cost_flow.html#aeb6622ffa760bc9403144736f8ac4ad4">operations_research::GenericMinCostFlow::SetArcCapacity</a></div><div class="ttdeci">void SetArcCapacity(ArcIndex arc, ArcFlowType new_capacity)</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l00110">min_cost_flow.cc:110</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_math_util_html_a5a6f14696b2a09c97b58e4f0989b19e7"><div class="ttname"><a href="classoperations__research_1_1_math_util.html#a5a6f14696b2a09c97b58e4f0989b19e7">operations_research::MathUtil::Abs</a></div><div class="ttdeci">static T Abs(const T x)</div><div class="ttdef"><b>Definition:</b> <a href="mathutil_8h_source.html#l00095">mathutil.h:95</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_max_flow_html"><div class="ttname"><a href="classoperations__research_1_1_max_flow.html">operations_research::MaxFlow</a></div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00652">max_flow.h:652</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_max_flow_status_class_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba0e6873a155f86a4695f463bf8601d05f"><div class="ttname"><a href="classoperations__research_1_1_max_flow_status_class.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba0e6873a155f86a4695f463bf8601d05f">operations_research::MaxFlowStatusClass::NOT_SOLVED</a></div><div class="ttdeci">@ NOT_SOLVED</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00303">max_flow.h:303</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_max_flow_status_class_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad"><div class="ttname"><a href="classoperations__research_1_1_max_flow_status_class.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad">operations_research::MaxFlowStatusClass::OPTIMAL</a></div><div class="ttdeci">@ OPTIMAL</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00304">max_flow.h:304</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_flow_base_html_a67a0db04d321a74b7e7fcfd3f1a3f70b"><div class="ttname"><a href="classoperations__research_1_1_min_cost_flow_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">operations_research::MinCostFlowBase::Status</a></div><div class="ttdeci">Status</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8h_source.html#l00194">min_cost_flow.h:194</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_flow_base_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba0e6873a155f86a4695f463bf8601d05f"><div class="ttname"><a href="classoperations__research_1_1_min_cost_flow_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba0e6873a155f86a4695f463bf8601d05f">operations_research::MinCostFlowBase::NOT_SOLVED</a></div><div class="ttdeci">@ NOT_SOLVED</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8h_source.html#l00195">min_cost_flow.h:195</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_flow_base_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad"><div class="ttname"><a href="classoperations__research_1_1_min_cost_flow_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad">operations_research::MinCostFlowBase::OPTIMAL</a></div><div class="ttdeci">@ OPTIMAL</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8h_source.html#l00196">min_cost_flow.h:196</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_flow_base_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483"><div class="ttname"><a href="classoperations__research_1_1_min_cost_flow_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">operations_research::MinCostFlowBase::INFEASIBLE</a></div><div class="ttdeci">@ INFEASIBLE</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8h_source.html#l00198">min_cost_flow.h:198</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_flow_base_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba6a2175a75814f119266396a0e9681718"><div class="ttname"><a href="classoperations__research_1_1_min_cost_flow_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba6a2175a75814f119266396a0e9681718">operations_research::MinCostFlowBase::UNBALANCED</a></div><div class="ttdeci">@ UNBALANCED</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8h_source.html#l00199">min_cost_flow.h:199</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_flow_base_html_a67a0db04d321a74b7e7fcfd3f1a3f70bac76ecfd837bdc6d4150bb02c403356e4"><div class="ttname"><a href="classoperations__research_1_1_min_cost_flow_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac76ecfd837bdc6d4150bb02c403356e4">operations_research::MinCostFlowBase::BAD_RESULT</a></div><div class="ttdeci">@ BAD_RESULT</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8h_source.html#l00200">min_cost_flow.h:200</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_min_cost_flow_html_a1057f1a98821c9237d75967b575f3829"><div class="ttname"><a href="classoperations__research_1_1_simple_min_cost_flow.html#a1057f1a98821c9237d75967b575f3829">operations_research::SimpleMinCostFlow::UnitCost</a></div><div class="ttdeci">CostValue UnitCost(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l01170">min_cost_flow.cc:1170</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_min_cost_flow_html_a20e10ea36c32c30c5130f300f1ffde2e"><div class="ttname"><a href="classoperations__research_1_1_simple_min_cost_flow.html#a20e10ea36c32c30c5130f300f1ffde2e">operations_research::SimpleMinCostFlow::AddArcWithCapacityAndUnitCost</a></div><div class="ttdeci">ArcIndex AddArcWithCapacityAndUnitCost(NodeIndex tail, NodeIndex head, FlowQuantity capacity, CostValue unit_cost)</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l01015">min_cost_flow.cc:1015</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_min_cost_flow_html_a2a420ad8221c326064736ccf148d2f93"><div class="ttname"><a href="classoperations__research_1_1_simple_min_cost_flow.html#a2a420ad8221c326064736ccf148d2f93">operations_research::SimpleMinCostFlow::Flow</a></div><div class="ttdeci">FlowQuantity Flow(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l01154">min_cost_flow.cc:1154</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_min_cost_flow_html_a3351fc1eb1dce4a7f6b937db874b5de1"><div class="ttname"><a href="classoperations__research_1_1_simple_min_cost_flow.html#a3351fc1eb1dce4a7f6b937db874b5de1">operations_research::SimpleMinCostFlow::MaximumFlow</a></div><div class="ttdeci">FlowQuantity MaximumFlow() const</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l01152">min_cost_flow.cc:1152</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_min_cost_flow_html_a3be0f6fcc44bc6a4a1e976c1e60b31d0"><div class="ttname"><a href="classoperations__research_1_1_simple_min_cost_flow.html#a3be0f6fcc44bc6a4a1e976c1e60b31d0">operations_research::SimpleMinCostFlow::NumNodes</a></div><div class="ttdeci">NodeIndex NumNodes() const</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l01158">min_cost_flow.cc:1158</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_min_cost_flow_html_a6d65a7ab08c98b332781f187776683e5"><div class="ttname"><a href="classoperations__research_1_1_simple_min_cost_flow.html#a6d65a7ab08c98b332781f187776683e5">operations_research::SimpleMinCostFlow::SimpleMinCostFlow</a></div><div class="ttdeci">SimpleMinCostFlow(NodeIndex reserve_num_nodes=0, ArcIndex reserve_num_arcs=0)</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l00995">min_cost_flow.cc:995</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_min_cost_flow_html_a7898be8b7efbfe53a58fcf621cf41315"><div class="ttname"><a href="classoperations__research_1_1_simple_min_cost_flow.html#a7898be8b7efbfe53a58fcf621cf41315">operations_research::SimpleMinCostFlow::NumArcs</a></div><div class="ttdeci">ArcIndex NumArcs() const</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l01160">min_cost_flow.cc:1160</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_min_cost_flow_html_a7cd2dc0776a9f339b56ffac996a7df8c"><div class="ttname"><a href="classoperations__research_1_1_simple_min_cost_flow.html#a7cd2dc0776a9f339b56ffac996a7df8c">operations_research::SimpleMinCostFlow::SetNodeSupply</a></div><div class="ttdeci">void SetNodeSupply(NodeIndex node, FlowQuantity supply)</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l01010">min_cost_flow.cc:1010</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_min_cost_flow_html_a8f17f2cebe15f0a8f2b072738093379d"><div class="ttname"><a href="classoperations__research_1_1_simple_min_cost_flow.html#a8f17f2cebe15f0a8f2b072738093379d">operations_research::SimpleMinCostFlow::Tail</a></div><div class="ttdeci">NodeIndex Tail(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l01162">min_cost_flow.cc:1162</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_min_cost_flow_html_a9dcd8610149406a1593d2a0725290482"><div class="ttname"><a href="classoperations__research_1_1_simple_min_cost_flow.html#a9dcd8610149406a1593d2a0725290482">operations_research::SimpleMinCostFlow::Capacity</a></div><div class="ttdeci">FlowQuantity Capacity(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l01166">min_cost_flow.cc:1166</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_min_cost_flow_html_aafd4139404e4f42af650481c3ff10cc7"><div class="ttname"><a href="classoperations__research_1_1_simple_min_cost_flow.html#aafd4139404e4f42af650481c3ff10cc7">operations_research::SimpleMinCostFlow::Supply</a></div><div class="ttdeci">FlowQuantity Supply(NodeIndex node) const</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l01174">min_cost_flow.cc:1174</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_min_cost_flow_html_acf6f87e72f7535b5dfe004740ef52a1d"><div class="ttname"><a href="classoperations__research_1_1_simple_min_cost_flow.html#acf6f87e72f7535b5dfe004740ef52a1d">operations_research::SimpleMinCostFlow::Head</a></div><div class="ttdeci">NodeIndex Head(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l01164">min_cost_flow.cc:1164</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_min_cost_flow_html_ad39ce7ee10c34a3ce1f69f179aa4f1e9"><div class="ttname"><a href="classoperations__research_1_1_simple_min_cost_flow.html#ad39ce7ee10c34a3ce1f69f179aa4f1e9">operations_research::SimpleMinCostFlow::OptimalCost</a></div><div class="ttdeci">CostValue OptimalCost() const</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8cc_source.html#l01150">min_cost_flow.cc:1150</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_star_graph_base_html_a5237cfbb86ec8f305e498e873e5c4e95"><div class="ttname"><a href="classoperations__research_1_1_star_graph_base.html#a5237cfbb86ec8f305e498e873e5c4e95">operations_research::StarGraphBase::Head</a></div><div class="ttdeci">NodeIndexType Head(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00297">ebert_graph.h:297</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_z_vector_html_acb72619c157635319e049af6553960c8"><div class="ttname"><a href="classoperations__research_1_1_z_vector.html#acb72619c157635319e049af6553960c8">operations_research::ZVector::Reserve</a></div><div class="ttdeci">bool Reserve(int64 new_min_index, int64 new_max_index)</div><div class="ttdef"><b>Definition:</b> <a href="zvector_8h_source.html#l00098">zvector.h:98</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_z_vector_html_ad5721f29af64d2e2ae014ead96192591"><div class="ttname"><a href="classoperations__research_1_1_z_vector.html#ad5721f29af64d2e2ae014ead96192591">operations_research::ZVector::SetAll</a></div><div class="ttdeci">void SetAll(T value)</div><div class="ttdef"><b>Definition:</b> <a href="zvector_8h_source.html#l00133">zvector.h:133</a></div></div>
|
|
<div class="ttc" id="acommandlineflags_8h_html"><div class="ttname"><a href="commandlineflags_8h.html">commandlineflags.h</a></div></div>
|
|
<div class="ttc" id="agraph_8h_html"><div class="ttname"><a href="graph_8h.html">graph.h</a></div></div>
|
|
<div class="ttc" id="agraphs_8h_html"><div class="ttname"><a href="graphs_8h.html">graphs.h</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a5f287b83a753915ae862fed64f8640a6"><div class="ttname"><a href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a></div><div class="ttdeci">GurobiMPCallbackContext * context</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00512">gurobi_interface.cc:512</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a4355d16fcf9f644c9ac84293f0b1801f"><div class="ttname"><a href="integral__types_8h.html#a4355d16fcf9f644c9ac84293f0b1801f">int16</a></div><div class="ttdeci">short int16</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00032">integral_types.h:32</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a56f1a81c92849566ae864511088eb7e8"><div class="ttname"><a href="integral__types_8h.html#a56f1a81c92849566ae864511088eb7e8">int32</a></div><div class="ttdeci">int int32</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00033">integral_types.h:33</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a"><div class="ttname"><a href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a></div><div class="ttdeci">int64_t int64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00034">integral_types.h:34</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_abc0f5bc07737e498f287334775dff2b6"><div class="ttname"><a href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a></div><div class="ttdeci">uint64_t uint64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00039">integral_types.h:39</a></div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_ac9bcbe19995a8140cd4ec61773cd6e67"><div class="ttname"><a href="log__severity_8h.html#ac9bcbe19995a8140cd4ec61773cd6e67">ERROR</a></div><div class="ttdeci">const int ERROR</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00032">log_severity.h:32</a></div></div>
|
|
<div class="ttc" id="amathutil_8h_html"><div class="ttname"><a href="mathutil_8h.html">mathutil.h</a></div></div>
|
|
<div class="ttc" id="amax__flow_8h_html"><div class="ttname"><a href="max__flow_8h.html">max_flow.h</a></div></div>
|
|
<div class="ttc" id="amin__cost__flow_8cc_html_a4bc17691c22aa339c9dd9b8fe305ce6f"><div class="ttname"><a href="min__cost__flow_8cc.html#a4bc17691c22aa339c9dd9b8fe305ce6f">ABSL_FLAG</a></div><div class="ttdeci">ABSL_FLAG(int64, min_cost_flow_alpha, 5, "Divide factor for epsilon at each refine step.")</div></div>
|
|
<div class="ttc" id="amin__cost__flow_8h_html"><div class="ttname"><a href="min__cost__flow_8h.html">min_cost_flow.h</a></div></div>
|
|
<div class="ttc" id="anamespaceabsl_html"><div class="ttname"><a href="namespaceabsl.html">absl</a></div><div class="ttdef"><b>Definition:</b> <a href="cleanup_8h_source.html#l00022">cleanup.h:22</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aedc4ddb96acc28481c09828d2e016815a2579881e7c83261bc21bafb5a5c92cad"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2579881e7c83261bc21bafb5a5c92cad">operations_research::sat::OPTIMAL</a></div><div class="ttdeci">@ OPTIMAL</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l00239">cp_model.pb.h:239</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aedc4ddb96acc28481c09828d2e016815a2884fa43446c0cbc9c7a9b74d41d7483"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2884fa43446c0cbc9c7a9b74d41d7483">operations_research::sat::INFEASIBLE</a></div><div class="ttdeci">@ INFEASIBLE</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l00238">cp_model.pb.h:238</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a7ae31ba4c3b4899478e53ca13df35dfc"><div class="ttname"><a href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">operations_research::NodeIndex</a></div><div class="ttdeci">int32 NodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00200">ebert_graph.h:192</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ab161c9ccc8667340cc3dc656d490f260"><div class="ttname"><a href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">operations_research::FlowQuantity</a></div><div class="ttdeci">int64 FlowQuantity</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00202">ebert_graph.h:202</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ad90a9fc7d16bb2c98a088a4162bbbc9d"><div class="ttname"><a href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">operations_research::ArcIndex</a></div><div class="ttdeci">int32 ArcIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00201">ebert_graph.h:201</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aee97ac67f280d35acdef2c5d461a85c3"><div class="ttname"><a href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">operations_research::CostValue</a></div><div class="ttdeci">int64 CostValue</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00203">ebert_graph.h:203</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_html_a2f76166dbe0c4055a1f256235ad00478"><div class="ttname"><a href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">util::Graph</a></div><div class="ttdeci">ListGraph Graph</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02360">graph.h:2360</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00508">pack.cc:508</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_a73461c37822b6ebb75b54ba1a9ffb442"><div class="ttname"><a href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a></div><div class="ttdeci">int64 delta</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01684">resource.cc:1684</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a10b672faee4b99c6a02feb0e343f3b0f"><div class="ttname"><a href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a></div><div class="ttdeci">int64 tail</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00127">routing_flow.cc:127</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a26a8cbbc7bcf4117c2bf65104b4a54b4"><div class="ttname"><a href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a></div><div class="ttdeci">int64 cost</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00130">routing_flow.cc:130</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_ac891d9f514e55ec8ee1212757a147888"><div class="ttname"><a href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a></div><div class="ttdeci">int64 head</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00128">routing_flow.cc:128</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_adf3be22c64f10c0783c0cf277e857adf"><div class="ttname"><a href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a></div><div class="ttdeci">int64 capacity</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00129">routing_flow.cc:129</a></div></div>
|
|
<div class="ttc" id="astats_8h_html_a3c3e6b102f0d91c523099325c98e1887"><div class="ttname"><a href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a></div><div class="ttdeci">#define IF_STATS_ENABLED(instructions)</div><div class="ttdef"><b>Definition:</b> <a href="stats_8h_source.html#l00435">stats.h:435</a></div></div>
|
|
<div class="ttc" id="astats_8h_html_a9995704aaaf45fc21e08c847551a8d04"><div class="ttname"><a href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a></div><div class="ttdeci">#define SCOPED_TIME_STAT(stats)</div><div class="ttdef"><b>Definition:</b> <a href="stats_8h_source.html#l00436">stats.h:436</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_graphs_html_a42fb6857e088a176a53232b910715260"><div class="ttname"><a href="structoperations__research_1_1_graphs.html#a42fb6857e088a176a53232b910715260">operations_research::Graphs::ArcReservation</a></div><div class="ttdeci">static ArcIndex ArcReservation(const Graph &graph)</div><div class="ttdef"><b>Definition:</b> <a href="graphs_8h_source.html#l00039">graphs.h:39</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_graphs_html_a9d530d16efbea1a29d61cb0325980a50"><div class="ttname"><a href="structoperations__research_1_1_graphs.html#a9d530d16efbea1a29d61cb0325980a50">operations_research::Graphs::NodeReservation</a></div><div class="ttdeci">static NodeIndex NodeReservation(const Graph &graph)</div><div class="ttdef"><b>Definition:</b> <a href="graphs_8h_source.html#l00036">graphs.h:36</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_graphs_html_ae02cd8602383e4fb48a8a933325db5fd"><div class="ttname"><a href="structoperations__research_1_1_graphs.html#ae02cd8602383e4fb48a8a933325db5fd">operations_research::Graphs::IsArcValid</a></div><div class="ttdeci">static bool IsArcValid(const Graph &graph, ArcIndex arc)</div><div class="ttdef"><b>Definition:</b> <a href="graphs_8h_source.html#l00033">graphs.h:33</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_graphs_html_ae9cc106c6139c0b4e57057594bf56ea8"><div class="ttname"><a href="structoperations__research_1_1_graphs.html#ae9cc106c6139c0b4e57057594bf56ea8">operations_research::Graphs::OppositeArc</a></div><div class="ttdeci">static ArcIndex OppositeArc(const Graph &graph, ArcIndex arc)</div><div class="ttdef"><b>Definition:</b> <a href="graphs_8h_source.html#l00030">graphs.h:30</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_725f3a5915051842f84e3ea508be2a62.html">graph</a></li><li class="navelem"><a class="el" href="min__cost__flow_8cc.html">min_cost_flow.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|