1195 lines
223 KiB
HTML
1195 lines
223 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: max_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('max__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">max_flow.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="max__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="max__flow_8h.html">ortools/graph/max_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>  </div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include "absl/memory/memory.h"</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include "absl/strings/str_format.h"</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "<a class="code" href="graph_8h.html">ortools/graph/graph.h</a>"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="graphs_8h.html">ortools/graph/graphs.h</a>"</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  </div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  </div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_max_flow.html#a0b218e6bdef5560b441d7dc1b47d897f"> 25</a></span> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a0b218e6bdef5560b441d7dc1b47d897f">SimpleMaxFlow::SimpleMaxFlow</a>() : num_nodes_(0) {}</div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  </div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_max_flow.html#a9d8699dbc3e3b9cadc36d4fd5ee29dce"> 27</a></span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a9d8699dbc3e3b9cadc36d4fd5ee29dce">SimpleMaxFlow::AddArcWithCapacity</a>(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, <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="l00028"></a><span class="lineno"> 28</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="l00029"></a><span class="lineno"> 29</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> num_arcs = arc_tail_.size();</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  num_nodes_ = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(num_nodes_, <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> + 1);</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  num_nodes_ = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(num_nodes_, <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> + 1);</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  arc_tail_.push_back(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>);</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  arc_head_.push_back(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  arc_capacity_.push_back(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>);</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keywordflow">return</span> num_arcs;</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> }</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  </div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_max_flow.html#a3be0f6fcc44bc6a4a1e976c1e60b31d0"> 38</a></span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a3be0f6fcc44bc6a4a1e976c1e60b31d0">SimpleMaxFlow::NumNodes</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> num_nodes_; }</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  </div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_max_flow.html#a7898be8b7efbfe53a58fcf621cf41315"> 40</a></span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a7898be8b7efbfe53a58fcf621cf41315">SimpleMaxFlow::NumArcs</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> arc_tail_.size(); }</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  </div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_max_flow.html#ab49dbdb731f80e626e575bdf66835f46"> 42</a></span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#ab49dbdb731f80e626e575bdf66835f46">SimpleMaxFlow::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="l00043"></a><span class="lineno"> 43</span>  </div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_max_flow.html#aa5f729a6274027e5e5478e4bd76603ca"> 44</a></span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#aa5f729a6274027e5e5478e4bd76603ca">SimpleMaxFlow::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="l00045"></a><span class="lineno"> 45</span>  </div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_max_flow.html#a9dcd8610149406a1593d2a0725290482"> 46</a></span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a9dcd8610149406a1593d2a0725290482">SimpleMaxFlow::Capacity</a>(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">return</span> arc_capacity_[arc];</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> }</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  </div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_max_flow.html#ac7bfd46bed70e12f118aa53df0c26769"> 50</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#ac7bfd46bed70e12f118aa53df0c26769">SimpleMaxFlow::SetArcCapacity</a>(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc, <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="l00051"></a><span class="lineno"> 51</span>  arc_capacity_[arc] = <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>;</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> }</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  </div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_max_flow.html#a57f5767b51471aa3c021db1cb451726e"> 54</a></span> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SimpleMaxFlow::Status</a> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a57f5767b51471aa3c021db1cb451726e">SimpleMaxFlow::Solve</a>(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> source, <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> sink) {</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</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="l00056"></a><span class="lineno"> 56</span>  arc_flow_.assign(num_arcs, 0);</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  underlying_max_flow_.reset();</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  underlying_graph_.reset();</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  optimal_flow_ = 0;</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">if</span> (source == sink || source < 0 || sink < 0) {</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac2811be86dd03c6735e3b0db51ad914f">BAD_INPUT</a>;</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  }</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">if</span> (source >= num_nodes_ || sink >= num_nodes_) {</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad">OPTIMAL</a>;</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  }</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  underlying_graph_ = absl::make_unique<Graph>(num_nodes_, num_arcs);</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  underlying_graph_->AddNode(source);</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  underlying_graph_->AddNode(sink);</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> arc = 0; arc < num_arcs; ++arc) {</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  underlying_graph_->AddArc(arc_tail_[arc], arc_head_[arc]);</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  }</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  underlying_graph_->Build(&arc_permutation_);</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  underlying_max_flow_ = absl::make_unique<GenericMaxFlow<Graph>>(</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  underlying_graph_.get(), source, sink);</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</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="l00076"></a><span class="lineno"> 76</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> permuted_arc =</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  arc < arc_permutation_.size() ? arc_permutation_[arc] : arc;</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  underlying_max_flow_->SetArcCapacity(permuted_arc, arc_capacity_[arc]);</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="keywordflow">if</span> (underlying_max_flow_->Solve()) {</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  optimal_flow_ = underlying_max_flow_->GetOptimalFlow();</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</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="l00083"></a><span class="lineno"> 83</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> permuted_arc =</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  arc < arc_permutation_.size() ? arc_permutation_[arc] : arc;</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  arc_flow_[arc] = underlying_max_flow_->Flow(permuted_arc);</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>  <span class="comment">// Translate the GenericMaxFlow::Status. It is different because NOT_SOLVED</span></div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="comment">// does not make sense in the simple api.</span></div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">switch</span> (underlying_max_flow_->status()) {</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html">GenericMaxFlow<Graph>::NOT_SOLVED</a>:</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac76ecfd837bdc6d4150bb02c403356e4">BAD_RESULT</a>;</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html">GenericMaxFlow<Graph>::OPTIMAL</a>:</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad">OPTIMAL</a>;</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html">GenericMaxFlow<Graph>::INT_OVERFLOW</a>:</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba63e6c2750d99f3c548e6a08bb6822fe2">POSSIBLE_OVERFLOW</a>;</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html">GenericMaxFlow<Graph>::BAD_INPUT</a>:</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac2811be86dd03c6735e3b0db51ad914f">BAD_INPUT</a>;</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html">GenericMaxFlow<Graph>::BAD_RESULT</a>:</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac76ecfd837bdc6d4150bb02c403356e4">BAD_RESULT</a>;</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  }</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac76ecfd837bdc6d4150bb02c403356e4">BAD_RESULT</a>;</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> }</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  </div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_max_flow.html#a865dfd15177ea8b4cd75a34ab9cee1b1"> 105</a></span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a865dfd15177ea8b4cd75a34ab9cee1b1">SimpleMaxFlow::OptimalFlow</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> optimal_flow_; }</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  </div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_max_flow.html#a2a420ad8221c326064736ccf148d2f93"> 107</a></span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a2a420ad8221c326064736ccf148d2f93">SimpleMaxFlow::Flow</a>(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> arc_flow_[arc]; }</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  </div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_max_flow.html#a4ede8a987bfe0972a51942bbca22d4c1"> 109</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a4ede8a987bfe0972a51942bbca22d4c1">SimpleMaxFlow::GetSourceSideMinCut</a>(std::vector<NodeIndex>* result) {</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">if</span> (underlying_max_flow_ == <span class="keyword">nullptr</span>) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  underlying_max_flow_->GetSourceSideMinCut(result);</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> }</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  </div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_max_flow.html#ad8ca9f0f372e03f5cf3af1e163230792"> 114</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_simple_max_flow.html#ad8ca9f0f372e03f5cf3af1e163230792">SimpleMaxFlow::GetSinkSideMinCut</a>(std::vector<NodeIndex>* result) {</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">if</span> (underlying_max_flow_ == <span class="keyword">nullptr</span>) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  underlying_max_flow_->GetSinkSideMinCut(result);</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</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"><a class="line" href="classoperations__research_1_1_simple_max_flow.html#a4d39b4f2db0792ccce2a922c74f43ecf"> 119</a></span> FlowModel <a class="code" href="classoperations__research_1_1_simple_max_flow.html#a4d39b4f2db0792ccce2a922c74f43ecf">SimpleMaxFlow::CreateFlowModelOfLastSolve</a>() {</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">if</span> (underlying_max_flow_ == <span class="keyword">nullptr</span>) <span class="keywordflow">return</span> FlowModel();</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">return</span> underlying_max_flow_->CreateFlowModel();</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> }</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  </div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#acef9fcefb0d5124677a8a9b460c30410"> 125</a></span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#acef9fcefb0d5124677a8a9b460c30410">GenericMaxFlow<Graph>::GenericMaxFlow</a>(<span class="keyword">const</span> <a class="code" href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">Graph</a>* graph, <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> source,</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> sink)</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  : graph_(graph),</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  node_excess_(),</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  node_potential_(),</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  residual_arc_capacity_(),</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  first_admissible_arc_(),</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  active_nodes_(),</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  source_(source),</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  sink_(sink),</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  use_global_update_(true),</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  use_two_phase_algorithm_(true),</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  process_node_by_height_(true),</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  check_input_(true),</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  check_result_(true),</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  stats_(<span class="stringliteral">"MaxFlow"</span>) {</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a7c6fc06ca542eed0ff0b6ed4b1ecbcda">stats_</a>);</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a10bcb8f7f63b390821ae5e95fe4822cc">graph</a>->IsNodeValid(source));</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a10bcb8f7f63b390821ae5e95fe4822cc">graph</a>->IsNodeValid(sink));</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> max_num_nodes = <a class="code" href="structoperations__research_1_1_graphs.html#a9d530d16efbea1a29d61cb0325980a50">Graphs<Graph>::NodeReservation</a>(*<a class="code" href="classoperations__research_1_1_generic_max_flow.html#ad88eea96f82ba29e252f3e07cdb84378">graph_</a>);</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">if</span> (max_num_nodes > 0) {</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <a class="code" href="classoperations__research_1_1_generic_max_flow.html#af63274e5211be9578b29f56f29936964">node_excess_</a>.<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="l00147"></a><span class="lineno"> 147</span>  <a class="code" href="classoperations__research_1_1_generic_max_flow.html#af63274e5211be9578b29f56f29936964">node_excess_</a>.<a class="code" href="classoperations__research_1_1_z_vector.html#ad5721f29af64d2e2ae014ead96192591">SetAll</a>(0);</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a5b7429be4ec8b98658d0b035261b1483">node_potential_</a>.<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="l00149"></a><span class="lineno"> 149</span>  <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a5b7429be4ec8b98658d0b035261b1483">node_potential_</a>.<a class="code" href="classoperations__research_1_1_z_vector.html#ad5721f29af64d2e2ae014ead96192591">SetAll</a>(0);</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a3702055ec6affa60e6862cd0e63f9a7b">first_admissible_arc_</a>.<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="l00151"></a><span class="lineno"> 151</span>  <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a3702055ec6affa60e6862cd0e63f9a7b">first_admissible_arc_</a>.<a class="code" href="classoperations__research_1_1_z_vector.html#ad5721f29af64d2e2ae014ead96192591">SetAll</a>(Graph::kNilArc);</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a2b834b1bfbaef46bbf4a3f991a26f9a3">bfs_queue_</a>.reserve(max_num_nodes);</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a19193cb3045a42a4154d3860b92dc65b">active_nodes_</a>.reserve(max_num_nodes);</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  }</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> max_num_arcs = <a class="code" href="structoperations__research_1_1_graphs.html#a42fb6857e088a176a53232b910715260">Graphs<Graph>::ArcReservation</a>(*<a class="code" href="classoperations__research_1_1_generic_max_flow.html#ad88eea96f82ba29e252f3e07cdb84378">graph_</a>);</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">if</span> (max_num_arcs > 0) {</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <a class="code" href="classoperations__research_1_1_generic_max_flow.html#ab478e83cea51fd1e9656030ea4667286">residual_arc_capacity_</a>.<a class="code" href="classoperations__research_1_1_z_vector.html#acb72619c157635319e049af6553960c8">Reserve</a>(-max_num_arcs, max_num_arcs - 1);</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <a class="code" href="classoperations__research_1_1_generic_max_flow.html#ab478e83cea51fd1e9656030ea4667286">residual_arc_capacity_</a>.<a class="code" href="classoperations__research_1_1_z_vector.html#ad5721f29af64d2e2ae014ead96192591">SetAll</a>(0);</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> }</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  </div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a12ffc143b8d66de80c07572cc8509037"> 163</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a12ffc143b8d66de80c07572cc8509037">GenericMaxFlow<Graph>::CheckInputConsistency</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordtype">bool</span> ok = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc = 0; arc < graph_->num_arcs(); ++arc) {</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">if</span> (residual_arc_capacity_[arc] < 0) {</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  ok = <span class="keyword">false</span>;</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>  }</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordflow">return</span> ok;</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span> }</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  </div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a21776d0248204801a49c42b46902c1a1"> 175</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a21776d0248204801a49c42b46902c1a1">GenericMaxFlow<Graph>::SetArcCapacity</a>(<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc,</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> new_capacity) {</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(0, new_capacity);</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsArcDirect(arc));</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</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="l00181"></a><span class="lineno"> 181</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="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">if</span> (capacity_delta == 0) {</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordflow">return</span>; <span class="comment">// Nothing to do.</span></div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  }</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  status_ = NOT_SOLVED;</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">if</span> (free_capacity + capacity_delta >= 0) {</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">// The above condition is true if one of the two conditions is true:</span></div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="comment">// 1/ (capacity_delta > 0), meaning we are increasing the capacity</span></div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="comment">// 2/ (capacity_delta < 0 && free_capacity + capacity_delta >= 0)</span></div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">// meaning we are reducing the capacity, but that the capacity</span></div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// reduction is not larger than the free capacity.</span></div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>((capacity_delta > 0) ||</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  (capacity_delta < 0 && free_capacity + capacity_delta >= 0));</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  residual_arc_capacity_.Set(arc, free_capacity + capacity_delta);</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(0, residual_arc_capacity_[arc]);</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="comment">// Note that this breaks the preflow invariants but it is currently not an</span></div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// issue since we restart from scratch on each Solve() and we set the status</span></div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">// to NOT_SOLVED.</span></div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="comment">// TODO(user): The easiest is probably to allow negative node excess in</span></div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="comment">// other places than the source, but the current implementation does not</span></div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">// deal with this.</span></div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  SetCapacityAndClearFlow(arc, new_capacity);</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</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>  </div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a38f480b60f3812345680d2267770ee5c"> 209</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a38f480b60f3812345680d2267770ee5c">GenericMaxFlow<Graph>::SetArcFlow</a>(<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc, <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> new_flow) {</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsArcValid(arc));</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(new_flow, 0);</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</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="l00214"></a><span class="lineno"> 214</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="l00215"></a><span class="lineno"> 215</span>  </div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="comment">// Note that this breaks the preflow invariants but it is currently not an</span></div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="comment">// issue since we restart from scratch on each Solve() and we set the status</span></div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="comment">// to NOT_SOLVED.</span></div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  residual_arc_capacity_.Set(Opposite(arc), -new_flow);</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</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="l00221"></a><span class="lineno"> 221</span>  status_ = NOT_SOLVED;</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span> }</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  </div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a4ede8a987bfe0972a51942bbca22d4c1"> 225</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ede8a987bfe0972a51942bbca22d4c1">GenericMaxFlow<Graph>::GetSourceSideMinCut</a>(</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  std::vector<NodeIndex>* result) {</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  ComputeReachableNodes<false>(source_, result);</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span> }</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  </div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#ad8ca9f0f372e03f5cf3af1e163230792"> 231</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#ad8ca9f0f372e03f5cf3af1e163230792">GenericMaxFlow<Graph>::GetSinkSideMinCut</a>(std::vector<NodeIndex>* result) {</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  ComputeReachableNodes<true>(sink_, result);</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> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#aac87a51b41d88b6976a12007bae9b91d"> 236</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#aac87a51b41d88b6976a12007bae9b91d">GenericMaxFlow<Graph>::CheckResult</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordtype">bool</span> ok = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordflow">if</span> (node_excess_[source_] != -node_excess_[sink_]) {</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">"-node_excess_[source_] = "</span> << -node_excess_[source_]</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  << <span class="stringliteral">" != node_excess_[sink_] = "</span> << node_excess_[sink_];</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  ok = <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="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node = 0; node < graph_->num_nodes(); ++node) {</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordflow">if</span> (node != source_ && node != sink_) {</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordflow">if</span> (node_excess_[node] != 0) {</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(DFATAL) << <span class="stringliteral">"node_excess_["</span> << node << <span class="stringliteral">"] = "</span> << node_excess_[node]</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  << <span class="stringliteral">" != 0"</span>;</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  ok = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  }</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  }</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  }</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc = 0; arc < graph_->num_arcs(); ++arc) {</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> opposite = Opposite(arc);</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> direct_capacity = residual_arc_capacity_[arc];</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> opposite_capacity = residual_arc_capacity_[opposite];</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">if</span> (direct_capacity < 0) {</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</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="l00259"></a><span class="lineno"> 259</span>  << <span class="stringliteral">"] = "</span> << direct_capacity << <span class="stringliteral">" < 0"</span>;</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  ok = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  }</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">if</span> (opposite_capacity < 0) {</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(DFATAL) << <span class="stringliteral">"residual_arc_capacity_["</span> << opposite</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  << <span class="stringliteral">"] = "</span> << opposite_capacity << <span class="stringliteral">" < 0"</span>;</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  ok = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  }</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="comment">// The initial capacity of the direct arcs is non-negative.</span></div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">if</span> (direct_capacity + opposite_capacity < 0) {</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(DFATAL) << <span class="stringliteral">"initial capacity ["</span> << arc</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  << <span class="stringliteral">"] = "</span> << direct_capacity + opposite_capacity << <span class="stringliteral">" < 0"</span>;</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  ok = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  }</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  }</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">return</span> ok;</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span> }</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  </div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#ad3f0f2aad2e5ba39481e3aad8de1fcda"> 278</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#ad3f0f2aad2e5ba39481e3aad8de1fcda">GenericMaxFlow<Graph>::AugmentingPathExists</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  </div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="comment">// We simply compute the reachability from the source in the residual graph.</span></div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> num_nodes = graph_->num_nodes();</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  std::vector<bool> is_reached(num_nodes, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  std::vector<NodeIndex> to_process;</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  </div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  to_process.push_back(source_);</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  is_reached[source_] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordflow">while</span> (!to_process.empty()) {</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node = to_process.back();</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  to_process.pop_back();</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a277838ded7171a604a67babdbea05988">OutgoingOrOppositeIncomingArcIterator</a> it(*graph_, node); it.Ok();</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  it.Next()) {</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc = it.Index();</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">if</span> (residual_arc_capacity_[arc] > 0) {</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> = graph_->Head(arc);</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">if</span> (!is_reached[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>]) {</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  is_reached[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  to_process.push_back(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  }</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  }</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  }</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  }</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordflow">return</span> is_reached[sink_];</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span> }</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  </div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a2a555ba2dc0a468e6fee4a0665b12272"> 307</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a2a555ba2dc0a468e6fee4a0665b12272">GenericMaxFlow<Graph>::CheckRelabelPrecondition</a>(<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsActive(node));</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_max_flow.html#a277838ded7171a604a67babdbea05988">OutgoingOrOppositeIncomingArcIterator</a> it(*graph_, node); it.Ok();</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  it.Next()) {</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc = it.Index();</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</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="l00313"></a><span class="lineno"> 313</span>  }</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span> }</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  </div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a2212ce00ee245370c5cb71234244027a"> 318</a></span> std::string <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a2212ce00ee245370c5cb71234244027a">GenericMaxFlow<Graph>::DebugString</a>(<span class="keyword">const</span> std::string& <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>,</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> = Tail(arc);</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> = Head(arc);</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordflow">return</span> absl::StrFormat(</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="stringliteral">"%s Arc %d, from %d to %d, "</span></div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="stringliteral">"Capacity = %d, Residual capacity = %d, "</span></div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="stringliteral">"Flow = residual capacity for reverse arc = %d, "</span></div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="stringliteral">"Height(tail) = %d, Height(head) = %d, "</span></div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="stringliteral">"Excess(tail) = %d, Excess(head) = %d"</span>,</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</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), residual_arc_capacity_[arc],</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  Flow(arc), 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="l00330"></a><span class="lineno"> 330</span>  node_excess_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>], node_excess_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>]);</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span> }</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  </div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#acef9fcefb0d5124677a8a9b460c30410"> 334</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a942f29030f08426e7e318204e987e2f7">GenericMaxFlow<Graph>::Solve</a>() {</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  status_ = NOT_SOLVED;</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keywordflow">if</span> (check_input_ && !CheckInputConsistency()) {</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  status_ = BAD_INPUT;</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  }</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  InitializePreflow();</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  </div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="comment">// Deal with the case when source_ or sink_ is not inside graph_.</span></div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="comment">// Since they are both specified independently of the graph, we do need to</span></div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="comment">// take care of this corner case.</span></div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> num_nodes = graph_->num_nodes();</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">if</span> (sink_ >= num_nodes || source_ >= num_nodes) {</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="comment">// Behave like a normal graph where source_ and sink_ are disconnected.</span></div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="comment">// Note that the arc flow is set to 0 by InitializePreflow().</span></div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  status_ = OPTIMAL;</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  }</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a21776d0248204801a49c42b46902c1a1"> 352</a></span>  <span class="keywordflow">if</span> (use_global_update_) {</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  RefineWithGlobalUpdate();</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a38f480b60f3812345680d2267770ee5c"> 355</a></span>  Refine();</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  }</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordflow">if</span> (check_result_) {</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a942f29030f08426e7e318204e987e2f7"> 358</a></span>  <span class="keywordflow">if</span> (!CheckResult()) {</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  status_ = BAD_RESULT;</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  }</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordflow">if</span> (GetOptimalFlow() < kMaxFlowQuantity && AugmentingPathExists()) {</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</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">"The algorithm terminated, but the flow is not maximal!"</span>;</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  status_ = BAD_RESULT;</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  }</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  }</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(node_excess_[sink_], -node_excess_[source_]);</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  status_ = <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2579881e7c83261bc21bafb5a5c92cad">OPTIMAL</a>;</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">if</span> (GetOptimalFlow() == kMaxFlowQuantity && AugmentingPathExists()) {</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="comment">// In this case, we are sure that the flow is > kMaxFlowQuantity.</span></div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  status_ = INT_OVERFLOW;</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  }</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</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="l00375"></a><span class="lineno"> 375</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span> }</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> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a0f81f6e049ffb2b2a27c8e45dc0a25a0"> 379</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a0f81f6e049ffb2b2a27c8e45dc0a25a0">GenericMaxFlow<Graph>::InitializePreflow</a>() {</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="comment">// InitializePreflow() clears the whole flow that could have been computed</span></div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="comment">// by a previous Solve(). This is not optimal in terms of complexity.</span></div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="comment">// TODO(user): find a way to make the re-solving incremental (not an obvious</span></div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="comment">// task, and there has not been a lot of literature on the subject.)</span></div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  node_excess_.SetAll(0);</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a4ede8a987bfe0972a51942bbca22d4c1"> 386</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> num_arcs = graph_->num_arcs();</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc = 0; arc < num_arcs; ++arc) {</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  SetCapacityAndClearFlow(arc, Capacity(arc));</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</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"> 391</span>  <span class="comment">// All the initial heights are zero except for the source whose height is</span></div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="comment">// equal to the number of nodes and will never change during the algorithm.</span></div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  node_potential_.SetAll(0);</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  node_potential_.Set(source_, graph_->num_nodes());</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#ad8ca9f0f372e03f5cf3af1e163230792"> 395</a></span>  </div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="comment">// Initially no arcs are admissible except maybe the one leaving the source,</span></div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="comment">// but we treat the source in a special way, see</span></div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="comment">// SaturateOutgoingArcsFromSource().</span></div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a12ffc143b8d66de80c07572cc8509037"> 399</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> num_nodes = graph_->num_nodes();</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node = 0; node < num_nodes; ++node) {</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  first_admissible_arc_[node] = Graph::kNilArc;</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  }</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span> }</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#aac87a51b41d88b6976a12007bae9b91d"> 404</a></span>  </div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="comment">// Note(user): Calling this function will break the property on the node</span></div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span> <span class="comment">// potentials because of the way we cancel flow on cycle. However, we only call</span></div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span> <span class="comment">// that at the end of the algorithm, or just before a GlobalUpdate() that will</span></div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span> <span class="comment">// restore the precondition on the node potentials.</span></div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#ad3f0f2aad2e5ba39481e3aad8de1fcda"> 410</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a3a4afd902c22768de7955ba9983fb282">GenericMaxFlow<Graph>::PushFlowExcessBackToSource</a>() {</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> num_nodes = graph_->num_nodes();</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="comment">// We implement a variation of Tarjan's strongly connected component algorithm</span></div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="comment">// to detect cycles published in: Tarjan, R. E. (1972), "Depth-first search</span></div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="comment">// and linear graph algorithms", SIAM Journal on Computing. A description can</span></div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="comment">// also be found in wikipedia.</span></div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  </div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="comment">// Stored nodes are settled nodes already stored in the</span></div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="comment">// reverse_topological_order (except the sink_ that we do not actually store).</span></div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  std::vector<bool> stored(num_nodes, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  stored[sink_] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  </div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="comment">// The visited nodes that are not yet stored are all the nodes from the</span></div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="comment">// source_ to the current node in the current dfs branch.</span></div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#afbd2be8210b3c04ac5ee3a879f1e62de"> 426</a></span>  std::vector<bool> visited(num_nodes, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  visited[sink_] = <span class="keyword">true</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="comment">// Stack of arcs to explore in the dfs search.</span></div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="comment">// The current node is Head(arc_stack.back()).</span></div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  std::vector<ArcIndex> arc_stack;</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  </div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="comment">// Increasing list of indices into the arc_stack that correspond to the list</span></div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="comment">// of arcs in the current dfs branch from the source_ to the current node.</span></div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  std::vector<int> index_branch;</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  </div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="comment">// Node in reverse_topological_order in the final dfs tree.</span></div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  std::vector<NodeIndex> reverse_topological_order;</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  </div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="comment">// We start by pushing all the outgoing arcs from the source on the stack to</span></div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="comment">// avoid special conditions in the code. As a result, source_ will not be</span></div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="comment">// stored in reverse_topological_order, and this is what we want.</span></div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a0d012d3907b8306ddfc1a7089342fbe2">OutgoingArcIterator</a> it(*graph_, source_); it.Ok(); it.Next()) {</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc = it.Index();</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> flow = Flow(arc);</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordflow">if</span> (flow > 0) {</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  arc_stack.push_back(arc);</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>  }</div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a2a555ba2dc0a468e6fee4a0665b12272"> 450</a></span>  visited[source_] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  </div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="comment">// Start the dfs on the subgraph formed by the direct arcs with positive flow.</span></div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="keywordflow">while</span> (!arc_stack.empty()) {</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a2212ce00ee245370c5cb71234244027a"> 454</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node = Head(arc_stack.back());</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>  <span class="comment">// If the node is visited, it means we have explored all its arcs and we</span></div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a7316c54af53df2e1f2ebc3d7fa1d5c45"> 457</a></span>  <span class="comment">// have just backtracked in the dfs. Store it if it is not already stored</span></div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="comment">// and process the next arc on the stack.</span></div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordflow">if</span> (visited[node]) {</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keywordflow">if</span> (!stored[node]) {</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  stored[node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  reverse_topological_order.push_back(node);</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!index_branch.empty());</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  index_branch.pop_back();</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  }</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  arc_stack.pop_back();</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keywordflow">continue</span>;</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="comment">// The node is a new unexplored node, add all its outgoing arcs with</span></div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="comment">// positive flow to the stack and go deeper in the dfs.</span></div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!stored[node]);</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(index_branch.empty() ||</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  (arc_stack.size() - 1 > index_branch.back()));</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  visited[node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  index_branch.push_back(arc_stack.size() - 1);</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  </div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keywordflow">for</span> (OutgoingArcIterator it(*graph_, node); it.Ok(); it.Next()) {</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</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="l00480"></a><span class="lineno"> 480</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> flow = Flow(arc);</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</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="l00482"></a><span class="lineno"> 482</span>  <span class="keywordflow">if</span> (flow > 0 && !stored[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>]) {</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordflow">if</span> (!visited[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>]) {</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  arc_stack.push_back(arc);</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#ad45b094d532baccee95649c24192f87a"> 486</a></span>  <span class="comment">// There is a cycle.</span></div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#ad28be43d46715cda54108a189081d139"> 487</a></span>  <span class="comment">// Find the first index to consider,</span></div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="comment">// arc_stack[index_branch[cycle_begin]] will be the first arc on the</span></div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="comment">// cycle.</span></div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="keywordtype">int</span> cycle_begin = index_branch.size();</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#af4b75883cbba15f442c627f5da96f470"> 491</a></span>  <span class="keywordflow">while</span> (cycle_begin > 0 &&</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  Head(arc_stack[index_branch[cycle_begin - 1]]) != <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>) {</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  --cycle_begin;</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a0f81f6e049ffb2b2a27c8e45dc0a25a0"> 494</a></span>  }</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  </div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="comment">// Compute the maximum flow that can be canceled on the cycle and the</span></div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="comment">// min index such that arc_stack[index_branch[i]] will be saturated.</span></div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> max_flow = flow;</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordtype">int</span> first_saturated_index = index_branch.size();</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = index_branch.size() - 1; i >= cycle_begin; --i) {</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc_on_cycle = arc_stack[index_branch[i]];</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a3a4afd902c22768de7955ba9983fb282"> 502</a></span>  <span class="keywordflow">if</span> (Flow(arc_on_cycle) <= max_flow) {</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  max_flow = Flow(arc_on_cycle);</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  first_saturated_index = i;</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</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>  </div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="comment">// This is just here for a DCHECK() below.</span></div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> excess = node_excess_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>];</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  </div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a28b52dfd2da6e91a8e1e0d039c1d4154"> 511</a></span>  <span class="comment">// Cancel the flow on the cycle, and set visited[node] = false for</span></div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="comment">// the node that will be backtracked over.</span></div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  PushFlow(-max_flow, arc);</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = index_branch.size() - 1; i >= cycle_begin; --i) {</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc_on_cycle = arc_stack[index_branch[i]];</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  PushFlow(-max_flow, arc_on_cycle);</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a24f768765349e100ca2ef7697d1b52d5"> 517</a></span>  <span class="keywordflow">if</span> (i >= first_saturated_index) {</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(visited[Head(arc_on_cycle)]);</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  visited[Head(arc_on_cycle)] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(Flow(arc_on_cycle), 0);</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#abedc5621560431c2527859bd5d1ab8fc"> 522</a></span>  }</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  }</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  </div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="comment">// This is a simple check that the flow was pushed properly.</span></div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(excess, node_excess_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>]);</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  </div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="comment">// Backtrack the dfs just before index_branch[first_saturated_index].</span></div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a187f8b09657eacdfef77202c595543f6"> 529</a></span>  <span class="comment">// If the current node is still active, there is nothing to do.</span></div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keywordflow">if</span> (first_saturated_index < index_branch.size()) {</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  arc_stack.resize(index_branch[first_saturated_index]);</div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  index_branch.resize(first_saturated_index);</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  </div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#ae5ff1c955df682c39482f2cc5e23e900"> 534</a></span>  <span class="comment">// We backtracked over the current node, so there is no need to</span></div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#af3a76f97fe869af7137bbc9a165353b1"> 535</a></span>  <span class="comment">// continue looping over its arcs.</span></div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#ac17ea9ef2dc1b5eace76f625abe36475"> 536</a></span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  }</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"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#ac0290c8f8892c50d7b29e9770fda4923"> 541</a></span>  }</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(arc_stack.empty());</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(index_branch.empty());</div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  </div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="comment">// Return the flow to the sink. Note that the sink_ and the source_ are not</span></div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="comment">// stored in reverse_topological_order.</span></div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < reverse_topological_order.size(); i++) {</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node = reverse_topological_order[i];</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordflow">if</span> (node_excess_[node] == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keywordflow">for</span> (IncomingArcIterator it(*graph_, node); it.Ok(); it.Next()) {</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</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="l00552"></a><span class="lineno"> 552</span>  <span class="keywordflow">if</span> (residual_arc_capacity_[opposite_arc] > 0) {</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> flow =</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(node_excess_[node], residual_arc_capacity_[opposite_arc]);</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  PushFlow(flow, opposite_arc);</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keywordflow">if</span> (node_excess_[node] == 0) <span class="keywordflow">break</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>  }</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(0, node_excess_[node]);</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  }</div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(-node_excess_[source_], node_excess_[sink_]);</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span> }</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  </div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a28b52dfd2da6e91a8e1e0d039c1d4154"> 565</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a28b52dfd2da6e91a8e1e0d039c1d4154">GenericMaxFlow<Graph>::GlobalUpdate</a>() {</div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  bfs_queue_.clear();</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keywordtype">int</span> queue_index = 0;</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> num_nodes = graph_->num_nodes();</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  node_in_bfs_queue_.assign(num_nodes, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  node_in_bfs_queue_[sink_] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  node_in_bfs_queue_[source_] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  </div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="comment">// We do two BFS in the reverse residual graph, one from the sink and one from</span></div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="comment">// the source. Because all the arcs from the source are saturated (except in</span></div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="comment">// presence of integer overflow), the source cannot reach the sink in the</span></div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="comment">// residual graph. However, we still want to relabel all the nodes that cannot</span></div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="comment">// reach the sink but can reach the source (because if they have excess, we</span></div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="comment">// need to push it back to the source).</span></div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="comment">// Note that the second pass is not needed here if we use a two-pass algorithm</span></div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="comment">// to return the flow to the source after we found the min cut.</span></div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_passes = use_two_phase_algorithm_ ? 1 : 2;</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pass = 0; pass < num_passes; ++pass) {</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keywordflow">if</span> (pass == 0) {</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  bfs_queue_.push_back(sink_);</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  bfs_queue_.push_back(source_);</div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  }</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  </div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordflow">while</span> (queue_index != bfs_queue_.size()) {</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node = bfs_queue_[queue_index];</div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  ++queue_index;</div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> candidate_distance = node_potential_[node] + 1;</div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a277838ded7171a604a67babdbea05988">OutgoingOrOppositeIncomingArcIterator</a> it(*graph_, node); it.Ok();</div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  it.Next()) {</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc = it.Index();</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> = Head(arc);</div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  </div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="comment">// Skip the arc if the height of head was already set to the correct</span></div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="comment">// value (Remember we are doing reverse BFS).</span></div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keywordflow">if</span> (node_in_bfs_queue_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  </div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="comment">// TODO(user): By using more memory we can speed this up quite a bit by</span></div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="comment">// avoiding to take the opposite arc here, too options:</span></div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="comment">// - if (residual_arc_capacity_[arc] != arc_capacity_[arc])</span></div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="comment">// - if (opposite_arc_is_admissible_[arc]) // need updates.</span></div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="comment">// Experiment with the first option shows more than 10% gain on this</span></div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="comment">// function running time, which is the bottleneck on many instances.</span></div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> opposite_arc = Opposite(arc);</div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keywordflow">if</span> (residual_arc_capacity_[opposite_arc] > 0) {</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="comment">// Note(user): We used to have a DCHECK_GE(candidate_distance,</span></div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="comment">// node_potential_[head]); which is always true except in the case</span></div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="comment">// where we can push more than kMaxFlowQuantity out of the source. The</span></div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="comment">// problem comes from the fact that in this case, we call</span></div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="comment">// PushFlowExcessBackToSource() in the middle of the algorithm. The</span></div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="comment">// later call will break the properties of the node potential. Note</span></div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="comment">// however, that this function will recompute a good node potential</span></div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="comment">// for all the nodes and thus fix the issue.</span></div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  </div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="comment">// If head is active, we can steal some or all of its excess.</span></div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="comment">// This brings a huge gain on some problems.</span></div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="comment">// Note(user): I haven't seen this anywhere in the literature.</span></div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="comment">// TODO(user): Investigate more and maybe write a publication :)</span></div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keywordflow">if</span> (node_excess_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>] > 0) {</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#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> flow = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(</div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  node_excess_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>], residual_arc_capacity_[opposite_arc]);</div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  PushFlow(flow, opposite_arc);</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  </div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="comment">// If the arc became saturated, it is no longer in the residual</span></div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="comment">// graph, so we do not need to consider head at this time.</span></div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="keywordflow">if</span> (residual_arc_capacity_[opposite_arc] == 0) <span class="keywordflow">continue</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>  </div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="comment">// Note that there is no need to touch first_admissible_arc_[node]</span></div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="comment">// because of the relaxed Relabel() we use.</span></div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  node_potential_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>] = candidate_distance;</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  node_in_bfs_queue_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  bfs_queue_.push_back(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  }</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  }</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>  <span class="comment">// At the end of the search, some nodes may not be in the bfs_queue_. Such</span></div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="comment">// nodes cannot reach the sink_ or source_ in the residual graph, so there is</span></div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="comment">// no point trying to push flow toward them. We obtain this effect by setting</span></div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="comment">// their height to something unreachable.</span></div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="comment">// Note that this also prevents cycling due to our anti-overflow procedure.</span></div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="comment">// For instance, suppose there is an edge s -> n outgoing from the source. If</span></div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="comment">// node n has no other connection and some excess, we will push the flow back</span></div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="comment">// to the source, but if we don't update the height of n</span></div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="comment">// SaturateOutgoingArcsFromSource() will push the flow to n again.</span></div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="comment">// TODO(user): This is another argument for another anti-overflow algorithm.</span></div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node = 0; node < num_nodes; ++node) {</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="keywordflow">if</span> (!node_in_bfs_queue_[node]) {</div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  node_potential_[node] = 2 * num_nodes - 1;</div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  }</div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  }</div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  </div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="comment">// Reset the active nodes. Doing it like this pushes the nodes in increasing</span></div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="comment">// order of height. Note that bfs_queue_[0] is the sink_ so we skip it.</span></div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsEmptyActiveNodeContainer());</div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < bfs_queue_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node = bfs_queue_[i];</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="keywordflow">if</span> (node_excess_[node] > 0) {</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsActive(node));</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  PushActiveNode(node);</div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  }</div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  }</div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span> }</div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  </div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a24f768765349e100ca2ef7697d1b52d5"> 675</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a24f768765349e100ca2ef7697d1b52d5">GenericMaxFlow<Graph>::SaturateOutgoingArcsFromSource</a>() {</div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> num_nodes = graph_->num_nodes();</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  </div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="comment">// If sink_ or source_ already have kMaxFlowQuantity, then there is no</span></div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="comment">// point pushing more flow since it will cause an integer overflow.</span></div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="keywordflow">if</span> (node_excess_[sink_] == kMaxFlowQuantity) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <span class="keywordflow">if</span> (node_excess_[source_] == -kMaxFlowQuantity) <span class="keywordflow">return</span> <span class="keyword">false</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="keywordtype">bool</span> flow_pushed = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a0d012d3907b8306ddfc1a7089342fbe2">OutgoingArcIterator</a> it(*graph_, source_); it.Ok(); it.Next()) {</div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc = it.Index();</div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> flow = residual_arc_capacity_[arc];</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">// This is a special IsAdmissible() condition for the source.</span></div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keywordflow">if</span> (flow == 0 || node_potential_[Head(arc)] >= num_nodes) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  </div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="comment">// We are careful in case the sum of the flow out of the source is greater</span></div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="comment">// than kMaxFlowQuantity to avoid overflow.</span></div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> current_flow_out_of_source = -node_excess_[source_];</div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(flow, 0) << flow;</div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(current_flow_out_of_source, 0) << current_flow_out_of_source;</div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> capped_flow =</div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  kMaxFlowQuantity - current_flow_out_of_source;</div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="keywordflow">if</span> (capped_flow < flow) {</div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <span class="comment">// We push as much flow as we can so the current flow on the network will</span></div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="comment">// be kMaxFlowQuantity.</span></div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  </div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="comment">// Since at the beginning of the function, current_flow_out_of_source</span></div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="comment">// was different from kMaxFlowQuantity, we are sure to have pushed some</span></div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="comment">// flow before if capped_flow is 0.</span></div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keywordflow">if</span> (capped_flow == 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  PushFlow(capped_flow, arc);</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  }</div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  PushFlow(flow, arc);</div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  flow_pushed = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  }</div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(node_excess_[source_], 0);</div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="keywordflow">return</span> flow_pushed;</div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</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> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#abedc5621560431c2527859bd5d1ab8fc"> 718</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#abedc5621560431c2527859bd5d1ab8fc">GenericMaxFlow<Graph>::PushFlow</a>(<a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> flow, <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc) {</div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="comment">// TODO(user): Do not allow a zero flow after fixing the UniformMaxFlow code.</span></div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(residual_arc_capacity_[Opposite(arc)] + flow, 0);</div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(residual_arc_capacity_[arc] - flow, 0);</div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  </div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="comment">// node_excess_ should be always greater than or equal to 0 except for the</span></div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="comment">// source where it should always be smaller than or equal to 0. Note however</span></div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="comment">// that we cannot check this because when we cancel the flow on a cycle in</span></div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="comment">// PushFlowExcessBackToSource(), we may break this invariant during the</span></div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="comment">// operation even if it is still valid at the end.</span></div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  </div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <span class="comment">// Update the residual capacity of the arc and its opposite arc.</span></div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  residual_arc_capacity_[arc] -= flow;</div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  residual_arc_capacity_[Opposite(arc)] += flow;</div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  </div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <span class="comment">// Update the excesses at the tail and head of the arc.</span></div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  node_excess_[Tail(arc)] -= flow;</div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  node_excess_[Head(arc)] += flow;</div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span> }</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> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a7316c54af53df2e1f2ebc3d7fa1d5c45"> 740</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a7316c54af53df2e1f2ebc3d7fa1d5c45">GenericMaxFlow<Graph>::InitializeActiveNodeContainer</a>() {</div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsEmptyActiveNodeContainer());</div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> num_nodes = graph_->num_nodes();</div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node = 0; node < num_nodes; ++node) {</div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <span class="keywordflow">if</span> (IsActive(node)) {</div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  <span class="keywordflow">if</span> (use_two_phase_algorithm_ && node_potential_[node] >= num_nodes) {</div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  }</div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  PushActiveNode(node);</div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  }</div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  }</div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span> }</div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  </div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#ad45b094d532baccee95649c24192f87a"> 755</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#ad45b094d532baccee95649c24192f87a">GenericMaxFlow<Graph>::Refine</a>() {</div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="comment">// Usually SaturateOutgoingArcsFromSource() will saturate all the arcs from</span></div>
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <span class="comment">// the source in one go, and we will loop just once. But in case we can push</span></div>
|
|
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="comment">// more than kMaxFlowQuantity out of the source the loop is as follow:</span></div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="comment">// - Push up to kMaxFlowQuantity out of the source on the admissible outgoing</span></div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="comment">// arcs. Stop if no flow was pushed.</span></div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="comment">// - Compute the current max-flow. This will push some flow back to the</span></div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="comment">// source and render more outgoing arcs from the source not admissible.</span></div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="comment">// TODO(user): This may not be the most efficient algorithm if we need to loop</span></div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="comment">// many times. An alternative may be to handle the source like the other nodes</span></div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="comment">// in the algorithm, initially putting an excess of kMaxFlowQuantity on it,</span></div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  <span class="comment">// and making the source active like any other node with positive excess. To</span></div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="comment">// investigate.</span></div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <span class="comment">// TODO(user): The code below is buggy when more than kMaxFlowQuantity can be</span></div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  <span class="comment">// pushed out of the source (i.e. when we loop more than once in the while()).</span></div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <span class="comment">// This is not critical, since this code is not used in the default algorithm</span></div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="comment">// computation. The issue is twofold:</span></div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="comment">// - InitializeActiveNodeContainer() doesn't push the nodes in</span></div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="comment">// the correct order.</span></div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="comment">// - PushFlowExcessBackToSource() may break the node potential properties, and</span></div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="comment">// we will need a call to GlobalUpdate() to fix that.</span></div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  <span class="keywordflow">while</span> (SaturateOutgoingArcsFromSource()) {</div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsEmptyActiveNodeContainer());</div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  InitializeActiveNodeContainer();</div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <span class="keywordflow">while</span> (!IsEmptyActiveNodeContainer()) {</div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node = GetAndRemoveFirstActiveNode();</div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="keywordflow">if</span> (node == source_ || node == sink_) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  Discharge(node);</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="keywordflow">if</span> (use_two_phase_algorithm_) {</div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  PushFlowExcessBackToSource();</div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  }</div>
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  }</div>
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span> }</div>
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  </div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#ad28be43d46715cda54108a189081d139"> 794</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#ad28be43d46715cda54108a189081d139">GenericMaxFlow<Graph>::RefineWithGlobalUpdate</a>() {</div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</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="comment">// TODO(user): This should be graph_->num_nodes(), but ebert graph does not</span></div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <span class="comment">// have a correct size if the highest index nodes have no arcs.</span></div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> num_nodes = <a class="code" href="structoperations__research_1_1_graphs.html#a9d530d16efbea1a29d61cb0325980a50">Graphs<Graph>::NodeReservation</a>(*graph_);</div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  std::vector<int> skip_active_node;</div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  </div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keywordflow">while</span> (SaturateOutgoingArcsFromSource()) {</div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  <span class="keywordtype">int</span> num_skipped;</div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keywordflow">do</span> {</div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  num_skipped = 0;</div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  skip_active_node.assign(num_nodes, 0);</div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  skip_active_node[sink_] = 2;</div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  skip_active_node[source_] = 2;</div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  GlobalUpdate();</div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keywordflow">while</span> (!IsEmptyActiveNodeContainer()) {</div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node = GetAndRemoveFirstActiveNode();</div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keywordflow">if</span> (skip_active_node[node] > 1) {</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="keywordflow">if</span> (node != sink_ && node != source_) ++num_skipped;</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  }</div>
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> old_height = node_potential_[node];</div>
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  Discharge(node);</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="comment">// The idea behind this is that if a node height augments by more than</span></div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <span class="comment">// one, then it is likely to push flow back the way it came. This can</span></div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="comment">// lead to very costly loops. A bad case is: source -> n1 -> n2 and n2</span></div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  <span class="comment">// just recently isolated from the sink. Then n2 will push flow back to</span></div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  <span class="comment">// n1, and n1 to n2 and so on. The height of each node will increase by</span></div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="comment">// steps of two until the height of the source is reached, which can</span></div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="comment">// take a long time. If the chain is longer, the situation is even</span></div>
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  <span class="comment">// worse. The behavior of this heuristic is related to the Gap</span></div>
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <span class="comment">// heuristic.</span></div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <span class="comment">// Note that the global update will fix all such cases efficiently. So</span></div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <span class="comment">// the idea is to discharge the active node as much as possible, and</span></div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="comment">// then do a global update.</span></div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="comment">// We skip a node when this condition was true 2 times to avoid doing a</span></div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="comment">// global update too frequently.</span></div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <span class="keywordflow">if</span> (node_potential_[node] > old_height + 1) {</div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  ++skip_active_node[node];</div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  }</div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  }</div>
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  } <span class="keywordflow">while</span> (num_skipped > 0);</div>
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <span class="keywordflow">if</span> (use_two_phase_algorithm_) {</div>
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  PushFlowExcessBackToSource();</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>  }</div>
|
|
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span> }</div>
|
|
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  </div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#af4b75883cbba15f442c627f5da96f470"> 847</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#af4b75883cbba15f442c627f5da96f470">GenericMaxFlow<Graph>::Discharge</a>(<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node) {</div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> num_nodes = graph_->num_nodes();</div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsActive(node));</div>
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a277838ded7171a604a67babdbea05988">OutgoingOrOppositeIncomingArcIterator</a> it(*graph_, node,</div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  first_admissible_arc_[node]);</div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  it.Ok(); it.Next()) {</div>
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc = it.Index();</div>
|
|
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="keywordflow">if</span> (IsAdmissible(arc)) {</div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsActive(node));</div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> = Head(arc);</div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="keywordflow">if</span> (node_excess_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>] == 0) {</div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="comment">// The push below will make the node active for sure. Note that we may</span></div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="comment">// push the sink_, but that is handled properly in Refine().</span></div>
|
|
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  PushActiveNode(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  }</div>
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</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="l00865"></a><span class="lineno"> 865</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(node_excess_[node], residual_arc_capacity_[arc]);</div>
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  PushFlow(<a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>, arc);</div>
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <span class="keywordflow">if</span> (node_excess_[node] == 0) {</div>
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  first_admissible_arc_[node] = arc; <span class="comment">// arc may still be admissible.</span></div>
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="keywordflow">return</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>  }</div>
|
|
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  Relabel(node);</div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  <span class="keywordflow">if</span> (use_two_phase_algorithm_ && node_potential_[node] >= num_nodes) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  }</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></div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#a187f8b09657eacdfef77202c595543f6"> 879</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a187f8b09657eacdfef77202c595543f6">GenericMaxFlow<Graph>::Relabel</a>(<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node) {</div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="comment">// Because we use a relaxed version, this is no longer true if the</span></div>
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <span class="comment">// first_admissible_arc_[node] was not actually the first arc!</span></div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <span class="comment">// DCHECK(CheckRelabelPrecondition(node));</span></div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a798f41062d76af3baabada0c4c0580ea">NodeHeight</a> min_height = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::numeric_limits<NodeHeight>::max</a>();</div>
|
|
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> first_admissible_arc = Graph::kNilArc;</div>
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a277838ded7171a604a67babdbea05988">OutgoingOrOppositeIncomingArcIterator</a> it(*graph_, node); it.Ok();</div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  it.Next()) {</div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc = it.Index();</div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="keywordflow">if</span> (residual_arc_capacity_[arc] > 0) {</div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="comment">// Update min_height only for arcs with available capacity.</span></div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a798f41062d76af3baabada0c4c0580ea">NodeHeight</a> head_height = node_potential_[Head(arc)];</div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="keywordflow">if</span> (head_height < min_height) {</div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  min_height = head_height;</div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  first_admissible_arc = arc;</div>
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  </div>
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="comment">// We found an admissible arc at the current height, just stop there.</span></div>
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="comment">// This is the true first_admissible_arc_[node].</span></div>
|
|
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <span class="keywordflow">if</span> (min_height + 1 == node_potential_[node]) <span class="keywordflow">break</span>;</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>  }</div>
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  }</div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(first_admissible_arc, Graph::kNilArc);</div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  node_potential_[node] = min_height + 1;</div>
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  </div>
|
|
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="comment">// Note that after a Relabel(), the loop will continue in Discharge(), and</span></div>
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="comment">// we are sure that all the arcs before first_admissible_arc are not</span></div>
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  <span class="comment">// admissible since their height is > min_height.</span></div>
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  first_admissible_arc_[node] = first_admissible_arc;</div>
|
|
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span> }</div>
|
|
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  </div>
|
|
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00912"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#ae5ff1c955df682c39482f2cc5e23e900"> 912</a></span> <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">Graph::ArcIndex</a> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#ae5ff1c955df682c39482f2cc5e23e900">GenericMaxFlow<Graph>::Opposite</a>(<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00913"></a><span class="lineno"> 913</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="l00914"></a><span class="lineno"> 914</span> }</div>
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  </div>
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00917"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#af3a76f97fe869af7137bbc9a165353b1"> 917</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#af3a76f97fe869af7137bbc9a165353b1">GenericMaxFlow<Graph>::IsArcDirect</a>(<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <span class="keywordflow">return</span> IsArcValid(arc) && arc >= 0;</div>
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</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> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00922"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#ac17ea9ef2dc1b5eace76f625abe36475"> 922</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#ac17ea9ef2dc1b5eace76f625abe36475">GenericMaxFlow<Graph>::IsArcValid</a>(<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00923"></a><span class="lineno"> 923</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="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> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span> <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="classoperations__research_1_1_generic_max_flow.html">GenericMaxFlow<Graph>::kMaxFlowQuantity</a> =</div>
|
|
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::numeric_limits<FlowQuantity>::max</a>();</div>
|
|
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  </div>
|
|
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> reverse></div>
|
|
<div class="line"><a name="l00932"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#ac0290c8f8892c50d7b29e9770fda4923"> 932</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#ac0290c8f8892c50d7b29e9770fda4923">GenericMaxFlow<Graph>::ComputeReachableNodes</a>(</div>
|
|
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> start, std::vector<NodeIndex>* result) {</div>
|
|
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  <span class="comment">// If start is not a valid node index, it can reach only itself.</span></div>
|
|
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="comment">// Note(user): This is needed because source and sink are given independently</span></div>
|
|
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="comment">// of the graph and sometimes before it is even constructed.</span></div>
|
|
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> num_nodes = graph_->num_nodes();</div>
|
|
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  <span class="keywordflow">if</span> (start >= num_nodes) {</div>
|
|
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  result->clear();</div>
|
|
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  result->push_back(start);</div>
|
|
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  <span class="keywordflow">return</span>;</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>  bfs_queue_.clear();</div>
|
|
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  node_in_bfs_queue_.assign(num_nodes, <span class="keyword">false</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="keywordtype">int</span> queue_index = 0;</div>
|
|
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  bfs_queue_.push_back(start);</div>
|
|
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  node_in_bfs_queue_[start] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  <span class="keywordflow">while</span> (queue_index != bfs_queue_.size()) {</div>
|
|
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node = bfs_queue_[queue_index];</div>
|
|
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  ++queue_index;</div>
|
|
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_generic_max_flow.html#a277838ded7171a604a67babdbea05988">OutgoingOrOppositeIncomingArcIterator</a> it(*graph_, node); it.Ok();</div>
|
|
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  it.Next()) {</div>
|
|
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc = it.Index();</div>
|
|
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> = Head(arc);</div>
|
|
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  <span class="keywordflow">if</span> (node_in_bfs_queue_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  <span class="keywordflow">if</span> (residual_arc_capacity_[reverse ? Opposite(arc) : arc] == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  node_in_bfs_queue_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  bfs_queue_.push_back(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  }</div>
|
|
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  }</div>
|
|
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  *result = bfs_queue_;</div>
|
|
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span> }</div>
|
|
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  </div>
|
|
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00966"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_generic_max_flow.html#afbd2be8210b3c04ac5ee3a879f1e62de"> 966</a></span> FlowModel <a class="code" href="classoperations__research_1_1_generic_max_flow.html#afbd2be8210b3c04ac5ee3a879f1e62de">GenericMaxFlow<Graph>::CreateFlowModel</a>() {</div>
|
|
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  FlowModel <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>;</div>
|
|
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.set_problem_type(FlowModel::MAX_FLOW);</div>
|
|
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> n = 0; n < graph_->num_nodes(); ++n) {</div>
|
|
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  Node* node = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.add_node();</div>
|
|
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  node->set_id(n);</div>
|
|
<div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  <span class="keywordflow">if</span> (n == source_) node->set_supply(1);</div>
|
|
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  <span class="keywordflow">if</span> (n == sink_) node->set_supply(-1);</div>
|
|
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  }</div>
|
|
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a> = 0; <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a> < graph_->num_arcs(); ++<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>) {</div>
|
|
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <a class="code" href="namespaceoperations__research.html#a6894cc7d30a41a5e750f40a7f4751c01">Arc</a>* arc = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.add_arc();</div>
|
|
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  arc->set_tail_node_id(graph_->Tail(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>));</div>
|
|
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  arc->set_head_node_id(graph_->Head(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>));</div>
|
|
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  arc->set_capacity(Capacity(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>));</div>
|
|
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  }</div>
|
|
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  <span class="keywordflow">return</span> <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>;</div>
|
|
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span> }</div>
|
|
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  </div>
|
|
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span> <span class="comment">// Explicit instanciations that can be used by a client.</span></div>
|
|
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span> <span class="comment">// TODO(user): moves this code out of a .cc file and include it at the end of</span></div>
|
|
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span> <span class="comment">// the header so it can work with any graph implementation ?</span></div>
|
|
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span> <span class="keyword">template</span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_generic_max_flow.html">GenericMaxFlow<StarGraph></a>;</div>
|
|
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span> <span class="keyword">template</span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_generic_max_flow.html">GenericMaxFlow<::util::ReverseArcListGraph<></a>>;</div>
|
|
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span> <span class="keyword">template</span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_generic_max_flow.html">GenericMaxFlow<::util::ReverseArcStaticGraph<></a>>;</div>
|
|
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span> <span class="keyword">template</span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_generic_max_flow.html">GenericMaxFlow<::util::ReverseArcMixedGraph<></a>>;</div>
|
|
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  </div>
|
|
<div class="line"><a name="l00993"></a><span class="lineno"> 993</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_a46e69120fbd3b36e6960e096d23b66f0"><div class="ttname"><a href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a></div><div class="ttdeci">#define DCHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00886">base/logging.h:886</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_generic_max_flow_html"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html">operations_research::GenericMaxFlow</a></div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00315">max_flow.h:315</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a0d012d3907b8306ddfc1a7089342fbe2"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a0d012d3907b8306ddfc1a7089342fbe2">operations_research::GenericMaxFlow< StarGraph >::OutgoingArcIterator</a></div><div class="ttdeci">Graph::OutgoingArcIterator OutgoingArcIterator</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00319">max_flow.h:319</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a0f81f6e049ffb2b2a27c8e45dc0a25a0"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a0f81f6e049ffb2b2a27c8e45dc0a25a0">operations_research::GenericMaxFlow::InitializePreflow</a></div><div class="ttdeci">void InitializePreflow()</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00379">max_flow.cc:379</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a10bcb8f7f63b390821ae5e95fe4822cc"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a10bcb8f7f63b390821ae5e95fe4822cc">operations_research::GenericMaxFlow::graph</a></div><div class="ttdeci">const Graph * graph() const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00338">max_flow.h:338</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a12ffc143b8d66de80c07572cc8509037"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a12ffc143b8d66de80c07572cc8509037">operations_research::GenericMaxFlow::CheckInputConsistency</a></div><div class="ttdeci">bool CheckInputConsistency() const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00163">max_flow.cc:163</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a187f8b09657eacdfef77202c595543f6"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a187f8b09657eacdfef77202c595543f6">operations_research::GenericMaxFlow::Relabel</a></div><div class="ttdeci">void Relabel(NodeIndex node)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00879">max_flow.cc:879</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a19193cb3045a42a4154d3860b92dc65b"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a19193cb3045a42a4154d3860b92dc65b">operations_research::GenericMaxFlow::active_nodes_</a></div><div class="ttdeci">std::vector< NodeIndex > active_nodes_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00590">max_flow.h:590</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_a2212ce00ee245370c5cb71234244027a"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a2212ce00ee245370c5cb71234244027a">operations_research::GenericMaxFlow::DebugString</a></div><div class="ttdeci">std::string DebugString(const std::string &context, ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00318">max_flow.cc:318</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a24f768765349e100ca2ef7697d1b52d5"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a24f768765349e100ca2ef7697d1b52d5">operations_research::GenericMaxFlow::SaturateOutgoingArcsFromSource</a></div><div class="ttdeci">bool SaturateOutgoingArcsFromSource()</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00675">max_flow.cc:675</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a277838ded7171a604a67babdbea05988"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a277838ded7171a604a67babdbea05988">operations_research::GenericMaxFlow::OutgoingOrOppositeIncomingArcIterator</a></div><div class="ttdeci">Graph::OutgoingOrOppositeIncomingArcIterator OutgoingOrOppositeIncomingArcIterator</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00321">max_flow.h:321</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a28b52dfd2da6e91a8e1e0d039c1d4154"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a28b52dfd2da6e91a8e1e0d039c1d4154">operations_research::GenericMaxFlow::GlobalUpdate</a></div><div class="ttdeci">void GlobalUpdate()</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00565">max_flow.cc:565</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a2a555ba2dc0a468e6fee4a0665b12272"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a2a555ba2dc0a468e6fee4a0665b12272">operations_research::GenericMaxFlow::CheckRelabelPrecondition</a></div><div class="ttdeci">bool CheckRelabelPrecondition(NodeIndex node) const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00307">max_flow.cc:307</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a2b834b1bfbaef46bbf4a3f991a26f9a3"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a2b834b1bfbaef46bbf4a3f991a26f9a3">operations_research::GenericMaxFlow::bfs_queue_</a></div><div class="ttdeci">std::vector< NodeIndex > bfs_queue_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00611">max_flow.h:611</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a3702055ec6affa60e6862cd0e63f9a7b"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a3702055ec6affa60e6862cd0e63f9a7b">operations_research::GenericMaxFlow::first_admissible_arc_</a></div><div class="ttdeci">ArcIndexArray first_admissible_arc_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00584">max_flow.h:584</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a38f480b60f3812345680d2267770ee5c"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a38f480b60f3812345680d2267770ee5c">operations_research::GenericMaxFlow::SetArcFlow</a></div><div class="ttdeci">void SetArcFlow(ArcIndex arc, FlowQuantity new_flow)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00209">max_flow.cc:209</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a3a4afd902c22768de7955ba9983fb282"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a3a4afd902c22768de7955ba9983fb282">operations_research::GenericMaxFlow::PushFlowExcessBackToSource</a></div><div class="ttdeci">void PushFlowExcessBackToSource()</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00410">max_flow.cc:410</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a44aa9e2f47277c91d8064c7126a2ff48"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a44aa9e2f47277c91d8064c7126a2ff48">operations_research::GenericMaxFlow::ArcIndex</a></div><div class="ttdeci">Graph::ArcIndex ArcIndex</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00318">max_flow.h:318</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a4ddaeee9414a17257bb052c459325caf"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a4ddaeee9414a17257bb052c459325caf">operations_research::GenericMaxFlow::NodeIndex</a></div><div class="ttdeci">Graph::NodeIndex NodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00317">max_flow.h:317</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a4ede8a987bfe0972a51942bbca22d4c1"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a4ede8a987bfe0972a51942bbca22d4c1">operations_research::GenericMaxFlow::GetSourceSideMinCut</a></div><div class="ttdeci">void GetSourceSideMinCut(std::vector< NodeIndex > *result)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00225">max_flow.cc:225</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a5b7429be4ec8b98658d0b035261b1483"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a5b7429be4ec8b98658d0b035261b1483">operations_research::GenericMaxFlow::node_potential_</a></div><div class="ttdeci">NodeHeightArray node_potential_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00563">max_flow.h:563</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a7316c54af53df2e1f2ebc3d7fa1d5c45"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a7316c54af53df2e1f2ebc3d7fa1d5c45">operations_research::GenericMaxFlow::InitializeActiveNodeContainer</a></div><div class="ttdeci">void InitializeActiveNodeContainer()</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00740">max_flow.cc:740</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a798f41062d76af3baabada0c4c0580ea"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a798f41062d76af3baabada0c4c0580ea">operations_research::GenericMaxFlow::NodeHeight</a></div><div class="ttdeci">NodeIndex NodeHeight</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00327">max_flow.h:327</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_a7c6fc06ca542eed0ff0b6ed4b1ecbcda"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#a7c6fc06ca542eed0ff0b6ed4b1ecbcda">operations_research::GenericMaxFlow::stats_</a></div><div class="ttdeci">StatsGroup stats_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00641">max_flow.h:641</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_aac87a51b41d88b6976a12007bae9b91d"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#aac87a51b41d88b6976a12007bae9b91d">operations_research::GenericMaxFlow::CheckResult</a></div><div class="ttdeci">bool CheckResult() const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00236">max_flow.cc:236</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_ab478e83cea51fd1e9656030ea4667286"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#ab478e83cea51fd1e9656030ea4667286">operations_research::GenericMaxFlow::residual_arc_capacity_</a></div><div class="ttdeci">QuantityArray residual_arc_capacity_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00581">max_flow.h:581</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_abedc5621560431c2527859bd5d1ab8fc"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#abedc5621560431c2527859bd5d1ab8fc">operations_research::GenericMaxFlow::PushFlow</a></div><div class="ttdeci">void PushFlow(FlowQuantity flow, ArcIndex arc)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00718">max_flow.cc:718</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_ac0290c8f8892c50d7b29e9770fda4923"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#ac0290c8f8892c50d7b29e9770fda4923">operations_research::GenericMaxFlow::ComputeReachableNodes</a></div><div class="ttdeci">void ComputeReachableNodes(NodeIndex start, std::vector< NodeIndex > *result)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00932">max_flow.cc:932</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_ac17ea9ef2dc1b5eace76f625abe36475"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#ac17ea9ef2dc1b5eace76f625abe36475">operations_research::GenericMaxFlow::IsArcValid</a></div><div class="ttdeci">bool IsArcValid(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00922">max_flow.cc:922</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_acef9fcefb0d5124677a8a9b460c30410"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#acef9fcefb0d5124677a8a9b460c30410">operations_research::GenericMaxFlow::GenericMaxFlow</a></div><div class="ttdeci">GenericMaxFlow(const Graph *graph, NodeIndex source, NodeIndex sink)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00125">max_flow.cc:125</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_ad28be43d46715cda54108a189081d139"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#ad28be43d46715cda54108a189081d139">operations_research::GenericMaxFlow::RefineWithGlobalUpdate</a></div><div class="ttdeci">void RefineWithGlobalUpdate()</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00794">max_flow.cc:794</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_ad3f0f2aad2e5ba39481e3aad8de1fcda"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#ad3f0f2aad2e5ba39481e3aad8de1fcda">operations_research::GenericMaxFlow::AugmentingPathExists</a></div><div class="ttdeci">bool AugmentingPathExists() const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00278">max_flow.cc:278</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_ad45b094d532baccee95649c24192f87a"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#ad45b094d532baccee95649c24192f87a">operations_research::GenericMaxFlow::Refine</a></div><div class="ttdeci">void Refine()</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00755">max_flow.cc:755</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_ad88eea96f82ba29e252f3e07cdb84378"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#ad88eea96f82ba29e252f3e07cdb84378">operations_research::GenericMaxFlow::graph_</a></div><div class="ttdeci">const Graph * graph_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00547">max_flow.h:547</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_ad8ca9f0f372e03f5cf3af1e163230792"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#ad8ca9f0f372e03f5cf3af1e163230792">operations_research::GenericMaxFlow::GetSinkSideMinCut</a></div><div class="ttdeci">void GetSinkSideMinCut(std::vector< NodeIndex > *result)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00231">max_flow.cc:231</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_ae5ff1c955df682c39482f2cc5e23e900"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#ae5ff1c955df682c39482f2cc5e23e900">operations_research::GenericMaxFlow::Opposite</a></div><div class="ttdeci">ArcIndex Opposite(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00912">max_flow.cc:912</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_af3a76f97fe869af7137bbc9a165353b1"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#af3a76f97fe869af7137bbc9a165353b1">operations_research::GenericMaxFlow::IsArcDirect</a></div><div class="ttdeci">bool IsArcDirect(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00917">max_flow.cc:917</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_af4b75883cbba15f442c627f5da96f470"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#af4b75883cbba15f442c627f5da96f470">operations_research::GenericMaxFlow::Discharge</a></div><div class="ttdeci">void Discharge(NodeIndex node)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00847">max_flow.cc:847</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_af63274e5211be9578b29f56f29936964"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#af63274e5211be9578b29f56f29936964">operations_research::GenericMaxFlow::node_excess_</a></div><div class="ttdeci">QuantityArray node_excess_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00550">max_flow.h:550</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_generic_max_flow_html_afbd2be8210b3c04ac5ee3a879f1e62de"><div class="ttname"><a href="classoperations__research_1_1_generic_max_flow.html#afbd2be8210b3c04ac5ee3a879f1e62de">operations_research::GenericMaxFlow::CreateFlowModel</a></div><div class="ttdeci">FlowModel CreateFlowModel()</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00966">max_flow.cc:966</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_a0b218e6bdef5560b441d7dc1b47d897f"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#a0b218e6bdef5560b441d7dc1b47d897f">operations_research::SimpleMaxFlow::SimpleMaxFlow</a></div><div class="ttdeci">SimpleMaxFlow()</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00025">max_flow.cc:25</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_a2a420ad8221c326064736ccf148d2f93"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#a2a420ad8221c326064736ccf148d2f93">operations_research::SimpleMaxFlow::Flow</a></div><div class="ttdeci">FlowQuantity Flow(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00107">max_flow.cc:107</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_a3be0f6fcc44bc6a4a1e976c1e60b31d0"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#a3be0f6fcc44bc6a4a1e976c1e60b31d0">operations_research::SimpleMaxFlow::NumNodes</a></div><div class="ttdeci">NodeIndex NumNodes() const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00038">max_flow.cc:38</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_a4d39b4f2db0792ccce2a922c74f43ecf"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#a4d39b4f2db0792ccce2a922c74f43ecf">operations_research::SimpleMaxFlow::CreateFlowModelOfLastSolve</a></div><div class="ttdeci">FlowModel CreateFlowModelOfLastSolve()</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00119">max_flow.cc:119</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_a4ede8a987bfe0972a51942bbca22d4c1"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#a4ede8a987bfe0972a51942bbca22d4c1">operations_research::SimpleMaxFlow::GetSourceSideMinCut</a></div><div class="ttdeci">void GetSourceSideMinCut(std::vector< NodeIndex > *result)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00109">max_flow.cc:109</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_a57f5767b51471aa3c021db1cb451726e"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#a57f5767b51471aa3c021db1cb451726e">operations_research::SimpleMaxFlow::Solve</a></div><div class="ttdeci">Status Solve(NodeIndex source, NodeIndex sink)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00054">max_flow.cc:54</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_a67a0db04d321a74b7e7fcfd3f1a3f70b"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">operations_research::SimpleMaxFlow::Status</a></div><div class="ttdeci">Status</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00180">max_flow.h:180</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad">operations_research::SimpleMaxFlow::OPTIMAL</a></div><div class="ttdeci">@ OPTIMAL</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00183">max_flow.h:183</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba63e6c2750d99f3c548e6a08bb6822fe2"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba63e6c2750d99f3c548e6a08bb6822fe2">operations_research::SimpleMaxFlow::POSSIBLE_OVERFLOW</a></div><div class="ttdeci">@ POSSIBLE_OVERFLOW</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00190">max_flow.h:190</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_a67a0db04d321a74b7e7fcfd3f1a3f70bac2811be86dd03c6735e3b0db51ad914f"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac2811be86dd03c6735e3b0db51ad914f">operations_research::SimpleMaxFlow::BAD_INPUT</a></div><div class="ttdeci">@ BAD_INPUT</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00192">max_flow.h:192</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_a67a0db04d321a74b7e7fcfd3f1a3f70bac76ecfd837bdc6d4150bb02c403356e4"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac76ecfd837bdc6d4150bb02c403356e4">operations_research::SimpleMaxFlow::BAD_RESULT</a></div><div class="ttdeci">@ BAD_RESULT</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00195">max_flow.h:194</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_a7898be8b7efbfe53a58fcf621cf41315"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#a7898be8b7efbfe53a58fcf621cf41315">operations_research::SimpleMaxFlow::NumArcs</a></div><div class="ttdeci">ArcIndex NumArcs() const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00040">max_flow.cc:40</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_a865dfd15177ea8b4cd75a34ab9cee1b1"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#a865dfd15177ea8b4cd75a34ab9cee1b1">operations_research::SimpleMaxFlow::OptimalFlow</a></div><div class="ttdeci">FlowQuantity OptimalFlow() const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00105">max_flow.cc:105</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_a9d8699dbc3e3b9cadc36d4fd5ee29dce"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#a9d8699dbc3e3b9cadc36d4fd5ee29dce">operations_research::SimpleMaxFlow::AddArcWithCapacity</a></div><div class="ttdeci">ArcIndex AddArcWithCapacity(NodeIndex tail, NodeIndex head, FlowQuantity capacity)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00027">max_flow.cc:27</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_a9dcd8610149406a1593d2a0725290482"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#a9dcd8610149406a1593d2a0725290482">operations_research::SimpleMaxFlow::Capacity</a></div><div class="ttdeci">FlowQuantity Capacity(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00046">max_flow.cc:46</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_aa5f729a6274027e5e5478e4bd76603ca"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#aa5f729a6274027e5e5478e4bd76603ca">operations_research::SimpleMaxFlow::Head</a></div><div class="ttdeci">NodeIndex Head(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00044">max_flow.cc:44</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_ab49dbdb731f80e626e575bdf66835f46"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#ab49dbdb731f80e626e575bdf66835f46">operations_research::SimpleMaxFlow::Tail</a></div><div class="ttdeci">NodeIndex Tail(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00042">max_flow.cc:42</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_ac7bfd46bed70e12f118aa53df0c26769"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#ac7bfd46bed70e12f118aa53df0c26769">operations_research::SimpleMaxFlow::SetArcCapacity</a></div><div class="ttdeci">void SetArcCapacity(ArcIndex arc, FlowQuantity capacity)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00050">max_flow.cc:50</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_max_flow_html_ad8ca9f0f372e03f5cf3af1e163230792"><div class="ttname"><a href="classoperations__research_1_1_simple_max_flow.html#ad8ca9f0f372e03f5cf3af1e163230792">operations_research::SimpleMaxFlow::GetSinkSideMinCut</a></div><div class="ttdeci">void GetSinkSideMinCut(std::vector< NodeIndex > *result)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8cc_source.html#l00114">max_flow.cc:114</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="aconstraint__solver_2table_8cc_html_af730895c6c6ef6e03caaf6251192dfd2"><div class="ttname"><a href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a></div><div class="ttdeci">int64 a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00042">constraint_solver/table.cc:42</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_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00272">gurobi_interface.cc:272</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="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="amax__flow_8h_html"><div class="ttname"><a href="max__flow_8h.html">max_flow.h</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#l00227">cp_model.pb.h:227</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_a6894cc7d30a41a5e750f40a7f4751c01"><div class="ttname"><a href="namespaceoperations__research.html#a6894cc7d30a41a5e750f40a7f4751c01">operations_research::Arc</a></div><div class="ttdeci">std::pair< int64, int64 > Arc</div><div class="ttdef"><b>Definition:</b> <a href="search_8cc_source.html#l03361">search.cc:3361</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="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#l02354">graph.h:2354</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_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="max__flow_8cc.html">max_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>
|