1455 lines
269 KiB
HTML
1455 lines
269 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.8.20"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: perfect_matching.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.0</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.20 -->
|
|
<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');
|
|
/* @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('perfect__matching_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">perfect_matching.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="perfect__matching_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="perfect__matching_8h.html">ortools/graph/perfect_matching.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 "absl/memory/memory.h"</span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include "<a class="code" href="saturated__arithmetic_8h.html">ortools/util/saturated_arithmetic.h</a>"</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>  </div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>  </div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_min_cost_perfect_matching.html#a50eca19efa71a0b70de25f9ad4a2a6f8"> 21</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_min_cost_perfect_matching.html#a50eca19efa71a0b70de25f9ad4a2a6f8">MinCostPerfectMatching::Reset</a>(<span class="keywordtype">int</span> num_nodes) {</div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  graph_ = absl::make_unique<BlossomGraph>(num_nodes);</div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  optimal_cost_ = 0;</div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  matches_.assign(num_nodes, -1);</div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> }</div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  </div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_min_cost_perfect_matching.html#a8bb9437d95e0d96bf090e0d935545733"> 27</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_min_cost_perfect_matching.html#a8bb9437d95e0d96bf090e0d935545733">MinCostPerfectMatching::AddEdgeWithCost</a>(<span class="keywordtype">int</span> <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, <span class="keywordtype">int</span> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>) {</div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  CHECK_GE(<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>, 0) << <span class="stringliteral">"Not supported for now, just shift your costs."</span>;</div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="keywordflow">if</span> (<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> == <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>) {</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  VLOG(1) << <span class="stringliteral">"Ignoring self-arc: "</span> << <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> << <span class="stringliteral">" <-> "</span> << <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  << <span class="stringliteral">" cost: "</span> << <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>;</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  }</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  maximum_edge_cost_ = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(maximum_edge_cost_, <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>);</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  graph_->AddEdge(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">BlossomGraph::NodeIndex</a>(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>), <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">BlossomGraph::NodeIndex</a>(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>),</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">BlossomGraph::CostValue</a>(<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>));</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> }</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  </div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_min_cost_perfect_matching.html#a00a07ecd49cf20c2806ebbcd1f5dcbb1"> 39</a></span> <a class="code" href="classoperations__research_1_1_min_cost_perfect_matching.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">MinCostPerfectMatching::Status</a> <a class="code" href="classoperations__research_1_1_min_cost_perfect_matching.html#a00a07ecd49cf20c2806ebbcd1f5dcbb1">MinCostPerfectMatching::Solve</a>() {</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  optimal_solution_found_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  </div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="comment">// We want all dual and all slack value to never overflow. After Initialize()</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="comment">// they are both bounded by the 2 * maximum cost. And we track an upper bound</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="comment">// on these quantities. The factor two is because of the re-scaling we do</span></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">// internally since all our dual values are actually multiple of 1/2.</span></div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="comment">// Note that since the whole code in BlossomGraph assumes that dual/slack have</span></div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="comment">// a magnitude that is always lower than kMaxCostValue it is important to use</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="comment">// it here since there is no reason it cannot be smaller than kint64max.</span></div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// TODO(user): Improve the overflow detection if needed. The current one seems</span></div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="comment">// ok though.</span></div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> overflow_detection = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(maximum_edge_cost_, maximum_edge_cost_);</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">if</span> (overflow_detection >= <a class="code" href="classoperations__research_1_1_blossom_graph.html#a47f3bfcd0d135ae701956a1fa56b141a">BlossomGraph::kMaxCostValue</a>) {</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">return</span> Status::INTEGER_OVERFLOW;</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  }</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  </div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = matches_.size();</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">if</span> (!graph_->Initialize()) <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2884fa43446c0cbc9c7a9b74d41d7483">Status::INFEASIBLE</a>;</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  VLOG(2) << graph_->DebugString();</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  VLOG(1) << <span class="stringliteral">"num_unmatched: "</span> << num_nodes - graph_->NumMatched()</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  << <span class="stringliteral">" dual_objective: "</span> << graph_->DualObjective();</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  </div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">while</span> (graph_->NumMatched() != num_nodes) {</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  graph_->PrimalUpdates();</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  graph_->DebugCheckNoPossiblePrimalUpdates();</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  }</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  </div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  VLOG(1) << <span class="stringliteral">"num_unmatched: "</span> << num_nodes - graph_->NumMatched()</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  << <span class="stringliteral">" dual_objective: "</span> << graph_->DualObjective();</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">if</span> (graph_->NumMatched() == num_nodes) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  </div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">BlossomGraph::CostValue</a> <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a> =</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  graph_->ComputeMaxCommonTreeDualDeltaAndResetPrimalEdgeQueue();</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  overflow_detection = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(overflow_detection, std::abs(<a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>.value()));</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">if</span> (overflow_detection >= <a class="code" href="classoperations__research_1_1_blossom_graph.html#a47f3bfcd0d135ae701956a1fa56b141a">BlossomGraph::kMaxCostValue</a>) {</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">return</span> Status::INTEGER_OVERFLOW;</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>  </div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a> == 0) <span class="keywordflow">break</span>; <span class="comment">// Infeasible!</span></div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  graph_->UpdateAllTrees(<a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>);</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  }</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  </div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  VLOG(1) << <span class="stringliteral">"End: "</span> << graph_->NumMatched() << <span class="stringliteral">" / "</span> << num_nodes;</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  graph_->DisplayStats();</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">if</span> (graph_->NumMatched() < num_nodes) {</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2884fa43446c0cbc9c7a9b74d41d7483">Status::INFEASIBLE</a>;</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  }</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  VLOG(2) << graph_->DebugString();</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  CHECK(graph_->DebugDualsAreFeasible());</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  </div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// TODO(user): Maybe there is a faster/better way to recover the mapping</span></div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// in the presence of blossoms.</span></div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  graph_->ExpandAllBlossoms();</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_nodes; ++i) {</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  matches_[i] = graph_->Match(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">BlossomGraph::NodeIndex</a>(i)).value();</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  }</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  </div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  optimal_solution_found_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  optimal_cost_ = graph_->DualObjective().value();</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">if</span> (optimal_cost_ == <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) <span class="keywordflow">return</span> Status::COST_OVERFLOW;</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2579881e7c83261bc21bafb5a5c92cad">Status::OPTIMAL</a>;</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> }</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  </div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="keyword">using</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> = <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">BlossomGraph::NodeIndex</a>;</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="keyword">using</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> = <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">BlossomGraph::CostValue</a>;</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  </div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">BlossomGraph::NodeIndex</a> <a class="code" href="classoperations__research_1_1_blossom_graph.html#aa58388f09616752263b1fac85c35e432">BlossomGraph::kNoNodeIndex</a> =</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">BlossomGraph::NodeIndex</a>(-1);</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="keyword">const</span> BlossomGraph::EdgeIndex <a class="code" href="classoperations__research_1_1_blossom_graph.html#a8a0d1ac19aba17d0f2d52d15a049dc2c">BlossomGraph::kNoEdgeIndex</a> =</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  BlossomGraph::EdgeIndex(-1);</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">BlossomGraph::CostValue</a> <a class="code" href="classoperations__research_1_1_blossom_graph.html#a47f3bfcd0d135ae701956a1fa56b141a">BlossomGraph::kMaxCostValue</a> =</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">BlossomGraph::CostValue</a>(<a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>);</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  </div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#ae0848b03565c382ae68dca458899dc58"> 116</a></span> <a class="code" href="classoperations__research_1_1_blossom_graph.html#ae0848b03565c382ae68dca458899dc58">BlossomGraph::BlossomGraph</a>(<span class="keywordtype">int</span> num_nodes) {</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  graph_.<a class="code" href="classgtl_1_1_i_t_i_vector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(num_nodes);</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  nodes_.reserve(num_nodes);</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  root_blossom_node_.<a class="code" href="classgtl_1_1_i_t_i_vector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(num_nodes);</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n(0); n < num_nodes; ++n) {</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  root_blossom_node_[n] = n;</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  nodes_.push_back(<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>(n));</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> }</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  </div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a58f432346ba2007a0c0a62ad8789b048"> 126</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_blossom_graph.html#a58f432346ba2007a0c0a62ad8789b048">BlossomGraph::AddEdge</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>, <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>) {</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  DCHECK_GE(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, 0);</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  DCHECK_LT(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, nodes_.size());</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  DCHECK_GE(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>, 0);</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  DCHECK_LT(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>, nodes_.size());</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  DCHECK_GE(<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>, 0);</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  DCHECK(!is_initialized_);</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">const</span> EdgeIndex <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>(edges_.size());</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  edges_.push_back(<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>, <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>));</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  graph_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>].<a class="code" href="classgtl_1_1_i_t_i_vector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  graph_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>].<a class="code" href="classgtl_1_1_i_t_i_vector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> }</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  </div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment">// TODO(user): Code the more advanced "Fractional matching initialization"</span></div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment">// heuristic.</span></div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment">// TODO(user): Add a preprocessing step that performs the 'forced' matches?</span></div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a248c764067ee60c03ee370784c49f353"> 143</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_blossom_graph.html#a248c764067ee60c03ee370784c49f353">BlossomGraph::Initialize</a>() {</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  CHECK(!is_initialized_);</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  is_initialized_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  </div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n(0); n < nodes_.size(); ++n) {</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">if</span> (graph_[n].empty()) <span class="keywordflow">return</span> <span class="keyword">false</span>; <span class="comment">// INFEASIBLE.</span></div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> min_cost = <a class="code" href="classoperations__research_1_1_blossom_graph.html#a47f3bfcd0d135ae701956a1fa56b141a">kMaxCostValue</a>;</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  </div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="comment">// Initialize the dual of each nodes to min_cost / 2.</span></div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="comment">// TODO(user): We might be able to do better for odd min_cost, but then</span></div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">// we might need to scale by 4? think about it.</span></div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> EdgeIndex e : graph_[n]) {</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  min_cost = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(min_cost, edges_[e].pseudo_slack);</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  }</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  DCHECK_NE(min_cost, <a class="code" href="classoperations__research_1_1_blossom_graph.html#a47f3bfcd0d135ae701956a1fa56b141a">kMaxCostValue</a>);</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  nodes_[n].pseudo_dual = min_cost / 2;</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>  <span class="comment">// Starts with all nodes as tree roots.</span></div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  nodes_[n].type = 1;</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  </div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="comment">// Update the slack of each edges now that nodes might have non-zero duals.</span></div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// Note that we made sure that all updated slacks are non-negative.</span></div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">for</span> (EdgeIndex e(0); e < edges_.size(); ++e) {</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& mutable_edge = edges_[e];</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  mutable_edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> -= nodes_[mutable_edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac244bdf901af2bc171478cbcfa09266e">tail</a>].pseudo_dual +</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  nodes_[mutable_edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a91f6a7d52fa6d6f96cdf7755641e0055">head</a>].pseudo_dual;</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  DCHECK_GE(mutable_edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a>, 0);</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="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n(0); n < nodes_.size(); ++n) {</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ba793d57999d40090be769a97c6ac59">NodeIsMatched</a>(n)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  </div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="comment">// After this greedy update, there will be at least an edge with a</span></div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="comment">// slack of zero.</span></div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> min_slack = <a class="code" href="classoperations__research_1_1_blossom_graph.html#a47f3bfcd0d135ae701956a1fa56b141a">kMaxCostValue</a>;</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> EdgeIndex e : graph_[n]) {</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  min_slack = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(min_slack, edges_[e].pseudo_slack);</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  }</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  DCHECK_NE(min_slack, <a class="code" href="classoperations__research_1_1_blossom_graph.html#a47f3bfcd0d135ae701956a1fa56b141a">kMaxCostValue</a>);</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">if</span> (min_slack > 0) {</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  nodes_[n].pseudo_dual += min_slack;</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> EdgeIndex e : graph_[n]) {</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  edges_[e].pseudo_slack -= min_slack;</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  }</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <a class="code" href="classoperations__research_1_1_blossom_graph.html#ad7e519048b150893f06581b7f270c118">DebugUpdateNodeDual</a>(n, min_slack);</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  }</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  </div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="comment">// Match this node if possible.</span></div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="comment">// TODO(user): Optimize by merging this loop with the one above?</span></div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> EdgeIndex e : graph_[n]) {</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& edge = edges_[e];</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordflow">if</span> (edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> != 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ba793d57999d40090be769a97c6ac59">NodeIsMatched</a>(edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ad9e501cd6bde03f8ed86ebac02b043c9">OtherEnd</a>(n))) {</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  nodes_[edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac244bdf901af2bc171478cbcfa09266e">tail</a>].type = 0;</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  nodes_[edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac244bdf901af2bc171478cbcfa09266e">tail</a>].match = edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a91f6a7d52fa6d6f96cdf7755641e0055">head</a>;</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  nodes_[edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a91f6a7d52fa6d6f96cdf7755641e0055">head</a>].type = 0;</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  nodes_[edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a91f6a7d52fa6d6f96cdf7755641e0055">head</a>].match = edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac244bdf901af2bc171478cbcfa09266e">tail</a>;</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  }</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="comment">// Initialize unmatched_nodes_.</span></div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n(0); n < nodes_.size(); ++n) {</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ba793d57999d40090be769a97c6ac59">NodeIsMatched</a>(n)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  unmatched_nodes_.push_back(n);</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  }</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  </div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="comment">// Scale everything by 2 and update the dual cost. Note that we made sure that</span></div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="comment">// there cannot be an integer overflow at the beginning of Solve().</span></div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="comment">// This scaling allows to only have integer weights during the algorithm</span></div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="comment">// because the slack of [+] -- [+] edges will always stay even.</span></div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="comment">// TODO(user): Reduce the number of loops we do in the initialization. We</span></div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="comment">// could likely just scale the edge cost as we fill them.</span></div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n(0); n < nodes_.size(); ++n) {</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  DCHECK_LE(nodes_[n].pseudo_dual, <a class="code" href="classoperations__research_1_1_blossom_graph.html#a47f3bfcd0d135ae701956a1fa56b141a">kMaxCostValue</a> / 2);</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  nodes_[n].pseudo_dual *= 2;</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  AddToDualObjective(nodes_[n].pseudo_dual);</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="preprocessor">#ifndef NDEBUG</span></div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  nodes_[n].dual = nodes_[n].pseudo_dual;</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="preprocessor">#endif</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="keywordflow">for</span> (EdgeIndex e(0); e < edges_.size(); ++e) {</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  DCHECK_LE(edges_[e].pseudo_slack, <a class="code" href="classoperations__research_1_1_blossom_graph.html#a47f3bfcd0d135ae701956a1fa56b141a">kMaxCostValue</a> / 2);</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  edges_[e].pseudo_slack *= 2;</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="preprocessor">#ifndef NDEBUG</span></div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  edges_[e].slack = edges_[e].pseudo_slack;</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  }</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  </div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="comment">// Initialize the edge priority queues and the primal update queue.</span></div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="comment">// We only need to do that if we have unmatched nodes.</span></div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordflow">if</span> (!unmatched_nodes_.empty()) {</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  primal_update_edge_queue_.clear();</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordflow">for</span> (EdgeIndex e(0); e < edges_.size(); ++e) {</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& edge = edges_[e];</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> tail_is_plus = nodes_[edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac244bdf901af2bc171478cbcfa09266e">tail</a>].IsPlus();</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> head_is_plus = nodes_[edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a91f6a7d52fa6d6f96cdf7755641e0055">head</a>].IsPlus();</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordflow">if</span> (tail_is_plus && head_is_plus) {</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  plus_plus_pq_.Add(&edge);</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">if</span> (edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> == 0) primal_update_edge_queue_.push_back(e);</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (tail_is_plus || head_is_plus) {</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  plus_free_pq_.Add(&edge);</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">if</span> (edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> == 0) primal_update_edge_queue_.push_back(e);</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>  }</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  }</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  </div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span> }</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  </div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a3a2cd7bcc756090a5e1a7bcdfa530a1b"> 259</a></span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code" href="classoperations__research_1_1_blossom_graph.html#a3a2cd7bcc756090a5e1a7bcdfa530a1b">BlossomGraph::ComputeMaxCommonTreeDualDeltaAndResetPrimalEdgeQueue</a>() {</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="comment">// TODO(user): Avoid this linear loop.</span></div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> best_update = <a class="code" href="classoperations__research_1_1_blossom_graph.html#a47f3bfcd0d135ae701956a1fa56b141a">kMaxCostValue</a>;</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n(0); n < nodes_.size(); ++n) {</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& node = nodes_[n];</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">if</span> (node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0d7fbff09819deb796dfbcb6370b12b2">IsBlossom</a>() && node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#af7b352e9f09d2400d7686572bec02ef1">IsMinus</a>()) {</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  best_update = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(best_update, <a class="code" href="classoperations__research_1_1_blossom_graph.html#a7cc8e3de83d28065411068cf09b7992e">Dual</a>(node));</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>  }</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  </div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="comment">// This code only works because all tree_dual_delta are the same.</span></div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  CHECK(!unmatched_nodes_.empty());</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> tree_delta = nodes_[unmatched_nodes_.front()].tree_dual_delta;</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> plus_plus_slack = <a class="code" href="classoperations__research_1_1_blossom_graph.html#a47f3bfcd0d135ae701956a1fa56b141a">kMaxCostValue</a>;</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordflow">if</span> (!plus_plus_pq_.IsEmpty()) {</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  DCHECK_EQ(plus_plus_pq_.Top()->pseudo_slack % 2, 0) << <span class="stringliteral">"Non integer bound!"</span>;</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  plus_plus_slack = plus_plus_pq_.Top()->pseudo_slack / 2 - tree_delta;</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  best_update = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(best_update, plus_plus_slack);</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  }</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> plus_free_slack = <a class="code" href="classoperations__research_1_1_blossom_graph.html#a47f3bfcd0d135ae701956a1fa56b141a">kMaxCostValue</a>;</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">if</span> (!plus_free_pq_.IsEmpty()) {</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  plus_free_slack = plus_free_pq_.Top()->pseudo_slack - tree_delta;</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  best_update = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(best_update, plus_free_slack);</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  }</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  </div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="comment">// This means infeasible, and returning zero will abort the search.</span></div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordflow">if</span> (best_update == <a class="code" href="classoperations__research_1_1_blossom_graph.html#a47f3bfcd0d135ae701956a1fa56b141a">kMaxCostValue</a>) <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a>(0);</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  </div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="comment">// Initialize primal_update_edge_queue_ with all the edges that will have a</span></div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="comment">// slack of zero once we apply the update.</span></div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="comment">// NOTE(user): If we want more "determinism" and be independent on the PQ</span></div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="comment">// algorithm, we could std::sort() the primal_update_edge_queue_ here.</span></div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  primal_update_edge_queue_.clear();</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordflow">if</span> (plus_plus_slack == best_update) {</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  plus_plus_pq_.AllTop(&tmp_all_tops_);</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>* pt : tmp_all_tops_) {</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  primal_update_edge_queue_.push_back(EdgeIndex(pt - &edges_.front()));</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  }</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  }</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">if</span> (plus_free_slack == best_update) {</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  plus_free_pq_.AllTop(&tmp_all_tops_);</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>* pt : tmp_all_tops_) {</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  primal_update_edge_queue_.push_back(EdgeIndex(pt - &edges_.front()));</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  }</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="keywordflow">return</span> best_update;</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span> }</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  </div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#acdf1d4050349cf4a87c08498eaa2d1e9"> 309</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_blossom_graph.html#acdf1d4050349cf4a87c08498eaa2d1e9">BlossomGraph::UpdateAllTrees</a>(<a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>) {</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  ++num_dual_updates_;</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  </div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="comment">// Reminder: the tree roots are exactly the unmatched nodes.</span></div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  CHECK_GE(<a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>, 0);</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n : unmatched_nodes_) {</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  CHECK(!<a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ba793d57999d40090be769a97c6ac59">NodeIsMatched</a>(n));</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  AddToDualObjective(<a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>);</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  nodes_[n].tree_dual_delta += <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>;</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  }</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  </div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n(0); n < nodes_.size(); ++n) {</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& node = nodes_[n];</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordflow">if</span> (node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a8cf7b66e4c76384f3d1d1f9a4ee8ae02">IsPlus</a>()) <a class="code" href="classoperations__research_1_1_blossom_graph.html#ad7e519048b150893f06581b7f270c118">DebugUpdateNodeDual</a>(n, <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>);</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keywordflow">if</span> (node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#af7b352e9f09d2400d7686572bec02ef1">IsMinus</a>()) <a class="code" href="classoperations__research_1_1_blossom_graph.html#ad7e519048b150893f06581b7f270c118">DebugUpdateNodeDual</a>(n, -<a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>);</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  }</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  }</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span> }</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  </div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a5ba793d57999d40090be769a97c6ac59"> 329</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ba793d57999d40090be769a97c6ac59">BlossomGraph::NodeIsMatched</a>(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="comment">// An unmatched node must be a tree root.</span></div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& node = nodes_[n];</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  CHECK(node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0c5e020f1174f613f0fe58d93e9cefa1">match</a> != n || (node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2">root</a> == n && node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a8cf7b66e4c76384f3d1d1f9a4ee8ae02">IsPlus</a>()));</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">return</span> node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0c5e020f1174f613f0fe58d93e9cefa1">match</a> != n;</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span> }</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  </div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a498ac6ce9ab7d52b1ff1dd3fefc1a5b7"> 336</a></span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="classoperations__research_1_1_blossom_graph.html#a498ac6ce9ab7d52b1ff1dd3fefc1a5b7">BlossomGraph::Match</a>(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& node = nodes_[n];</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">if</span> (node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#af7b352e9f09d2400d7686572bec02ef1">IsMinus</a>()) CHECK_EQ(node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a768efacafc19717a4d6f28a2f9f41ae3">parent</a>, node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0c5e020f1174f613f0fe58d93e9cefa1">match</a>);</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keywordflow">if</span> (node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a8cf7b66e4c76384f3d1d1f9a4ee8ae02">IsPlus</a>()) CHECK_EQ(n, node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0c5e020f1174f613f0fe58d93e9cefa1">match</a>);</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="keywordflow">return</span> node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0c5e020f1174f613f0fe58d93e9cefa1">match</a>;</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span> }</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  </div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span> <span class="comment">// Meant to only be used in DEBUG to make sure our queue in PrimalUpdates()</span></div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span> <span class="comment">// do not miss any potential edges.</span></div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a6f810c6acdae2d7caa9ca2f8cbf35ce5"> 347</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_blossom_graph.html#a6f810c6acdae2d7caa9ca2f8cbf35ce5">BlossomGraph::DebugCheckNoPossiblePrimalUpdates</a>() {</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keywordflow">for</span> (EdgeIndex e(0); e < edges_.size(); ++e) {</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& edge = edges_[e];</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keywordflow">if</span> (Head(edge) == Tail(edge)) <span class="keywordflow">continue</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"> 352</span>  CHECK(!nodes_[Tail(edge)].is_internal);</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  CHECK(!nodes_[Head(edge)].is_internal);</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ec09b02b175052c5546eda76464accd">Slack</a>(edge) != 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  </div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="comment">// Make sure tail is a plus node if possible.</span></div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> = Tail(edge);</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> = Head(edge);</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keywordflow">if</span> (!nodes_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>].IsPlus()) std::swap(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordflow">if</span> (!nodes_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>].IsPlus()) <span class="keywordflow">continue</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> (nodes_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>].IsFree()) {</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  VLOG(2) << <a class="code" href="classoperations__research_1_1_blossom_graph.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>();</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  LOG(FATAL) << <span class="stringliteral">"Possible Grow! "</span> << <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> << <span class="stringliteral">" "</span> << <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>;</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  }</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keywordflow">if</span> (nodes_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>].IsPlus()) {</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keywordflow">if</span> (nodes_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>].root == nodes_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>].root) {</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  LOG(FATAL) << <span class="stringliteral">"Possible Shrink!"</span>;</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  LOG(FATAL) << <span class="stringliteral">"Possible augment!"</span>;</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  }</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  }</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>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& node : nodes_) {</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keywordflow">if</span> (node.IsMinus() && node.IsBlossom() && <a class="code" href="classoperations__research_1_1_blossom_graph.html#a7cc8e3de83d28065411068cf09b7992e">Dual</a>(node) == 0) {</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  LOG(FATAL) << <span class="stringliteral">"Possible expand!"</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>  }</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span> }</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  </div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a0a45bd01bdb08f462f19cf483b88a6d1"> 381</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_blossom_graph.html#a0a45bd01bdb08f462f19cf483b88a6d1">BlossomGraph::PrimalUpdates</a>() {</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="comment">// Any Grow/Augment/Shrink/Expand operation can add new tight edges that need</span></div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="comment">// to be explored again.</span></div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="comment">// TODO(user): avoid adding duplicates?</span></div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  possible_shrink_.clear();</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  </div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="comment">// First, we Grow/Augment as much as possible.</span></div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordflow">while</span> (!primal_update_edge_queue_.empty()) {</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keyword">const</span> EdgeIndex e = primal_update_edge_queue_.back();</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  primal_update_edge_queue_.pop_back();</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  </div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="comment">// Because of the Expand() operation, the edge may have become un-tight</span></div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="comment">// since it has been inserted in the tight edges queue. It's cheaper to</span></div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="comment">// detect it here and skip it than it would be to dynamically update the</span></div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="comment">// queue to only keep actually tight edges at all times.</span></div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& edge = edges_[e];</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ec09b02b175052c5546eda76464accd">Slack</a>(edge) != 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  </div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> = Tail(edge);</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> = Head(edge);</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keywordflow">if</span> (!nodes_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>].IsPlus()) std::swap(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keywordflow">if</span> (!nodes_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>].IsPlus()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  </div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keywordflow">if</span> (nodes_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>].IsFree()) {</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <a class="code" href="classoperations__research_1_1_blossom_graph.html#a39b5c65490728705cd4471c549ff1d95">Grow</a>(e, <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (nodes_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>].IsPlus()) {</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordflow">if</span> (nodes_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>].root != nodes_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>].root) {</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <a class="code" href="classoperations__research_1_1_blossom_graph.html#a77239a64984b6868f08721b84d7c08a1">Augment</a>(e);</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  possible_shrink_.push_back(e);</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>  }</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  }</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  </div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="comment">// Shrink all potential Blossom.</span></div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> EdgeIndex e : possible_shrink_) {</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& edge = edges_[e];</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> = Tail(edge);</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</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(edge);</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& tail_node = nodes_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>];</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& head_node = nodes_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>];</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">if</span> (tail_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a8cf7b66e4c76384f3d1d1f9a4ee8ae02">IsPlus</a>() && head_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a8cf7b66e4c76384f3d1d1f9a4ee8ae02">IsPlus</a>() &&</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  tail_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2">root</a> == head_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2">root</a> && <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> != <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>) {</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <a class="code" href="classoperations__research_1_1_blossom_graph.html#aacc1343585a38bfaa42702e635552837">Shrink</a>(e);</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  }</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  }</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  </div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="comment">// Delay expand if any blossom was created.</span></div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">if</span> (!primal_update_edge_queue_.empty()) <span class="keywordflow">continue</span>;</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">// Expand Blossom if any.</span></div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="comment">// TODO(user): Avoid doing a O(num_nodes). Also expand all blossom</span></div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="comment">// recursively? I am not sure it is a good heuristic to expand all possible</span></div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="comment">// blossom before trying the other operations though.</span></div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordtype">int</span> num_expands = 0;</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n(0); n < nodes_.size(); ++n) {</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& node = nodes_[n];</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordflow">if</span> (node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#af7b352e9f09d2400d7686572bec02ef1">IsMinus</a>() && node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0d7fbff09819deb796dfbcb6370b12b2">IsBlossom</a>() && <a class="code" href="classoperations__research_1_1_blossom_graph.html#a7cc8e3de83d28065411068cf09b7992e">Dual</a>(node) == 0) {</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  ++num_expands;</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <a class="code" href="classoperations__research_1_1_blossom_graph.html#abf9aa973816e638a2b972b595d952c0e">Expand</a>(n);</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  }</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  }</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordflow">if</span> (num_expands == 0) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  }</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span> }</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  </div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a10faf3cb1acc845ce59c867bd9753155"> 450</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_blossom_graph.html#a10faf3cb1acc845ce59c867bd9753155">BlossomGraph::DebugDualsAreFeasible</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="comment">// The slack of all edge must be non-negative.</span></div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& edge : edges_) {</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ec09b02b175052c5546eda76464accd">Slack</a>(edge) < 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  }</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">// The dual of all Blossom must be non-negative.</span></div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& node : nodes_) {</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keywordflow">if</span> (node.IsBlossom() && <a class="code" href="classoperations__research_1_1_blossom_graph.html#a7cc8e3de83d28065411068cf09b7992e">Dual</a>(node) < 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  }</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span> }</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  </div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a41347b63abb9f92b02b1705cdae50cad"> 463</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_blossom_graph.html#a41347b63abb9f92b02b1705cdae50cad">BlossomGraph::DebugEdgeIsTightAndExternal</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& edge)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">if</span> (Tail(edge) == Head(edge)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keywordflow">if</span> (nodes_[Tail(edge)].IsInternal()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keywordflow">if</span> (nodes_[Head(edge)].IsInternal()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ec09b02b175052c5546eda76464accd">Slack</a>(edge) == 0;</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"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a39b5c65490728705cd4471c549ff1d95"> 470</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_blossom_graph.html#a39b5c65490728705cd4471c549ff1d95">BlossomGraph::Grow</a>(EdgeIndex e, <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="l00471"></a><span class="lineno"> 471</span>  ++num_grows_;</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  VLOG(2) << <span class="stringliteral">"Grow "</span> << <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> << <span class="stringliteral">" -> "</span> << <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> << <span class="stringliteral">" === "</span> << <a class="code" href="classoperations__research_1_1_blossom_graph.html#a498ac6ce9ab7d52b1ff1dd3fefc1a5b7">Match</a>(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  </div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  DCHECK(<a class="code" href="classoperations__research_1_1_blossom_graph.html#a41347b63abb9f92b02b1705cdae50cad">DebugEdgeIsTightAndExternal</a>(edges_[e]));</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  DCHECK(nodes_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>].IsPlus());</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  DCHECK(nodes_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>].IsFree());</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  DCHECK(<a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ba793d57999d40090be769a97c6ac59">NodeIsMatched</a>(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>));</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  </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#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> root = nodes_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>].root;</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#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> leaf = <a class="code" href="classoperations__research_1_1_blossom_graph.html#a498ac6ce9ab7d52b1ff1dd3fefc1a5b7">Match</a>(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  </div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& head_node = nodes_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>];</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  head_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2">root</a> = root;</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  head_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a768efacafc19717a4d6f28a2f9f41ae3">parent</a> = <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>;</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  head_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26">type</a> = -1;</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  </div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="comment">// head was free and is now a [-] node.</span></div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> tree_dual = nodes_[root].tree_dual_delta;</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  head_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae51446839a3bac95fbd94fb2cb34f810">pseudo_dual</a> += tree_dual;</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> subnode : SubNodes(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>)) {</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> EdgeIndex e : graph_[subnode]) {</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& edge = edges_[e];</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> other_end = OtherEnd(edge, subnode);</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keywordflow">if</span> (other_end == <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> -= tree_dual;</div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordflow">if</span> (plus_free_pq_.Contains(&edge)) plus_free_pq_.Remove(&edge);</div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  }</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  }</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  </div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& leaf_node = nodes_[leaf];</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  leaf_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2">root</a> = root;</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  leaf_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a768efacafc19717a4d6f28a2f9f41ae3">parent</a> = <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>;</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  leaf_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26">type</a> = +1;</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  </div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="comment">// leaf was free and is now a [+] node.</span></div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  leaf_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae51446839a3bac95fbd94fb2cb34f810">pseudo_dual</a> -= tree_dual;</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> subnode : SubNodes(leaf)) {</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> EdgeIndex e : graph_[subnode]) {</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& edge = edges_[e];</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> other_end = OtherEnd(edge, subnode);</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordflow">if</span> (other_end == leaf) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> += tree_dual;</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& other_node = nodes_[other_end];</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordflow">if</span> (other_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a8cf7b66e4c76384f3d1d1f9a4ee8ae02">IsPlus</a>()) {</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="comment">// The edge switch from [+] -- [0] to [+] -- [+].</span></div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  DCHECK(plus_free_pq_.Contains(&edge));</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  DCHECK(!plus_plus_pq_.Contains(&edge));</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  plus_free_pq_.Remove(&edge);</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  plus_plus_pq_.Add(&edge);</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">if</span> (edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> == 2 * tree_dual) {</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  DCHECK_EQ(<a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ec09b02b175052c5546eda76464accd">Slack</a>(edge), 0);</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  primal_update_edge_queue_.push_back(e);</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>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (other_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a48a8004385fae256a9c93d353016bea1">IsFree</a>()) {</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="comment">// We have a new [+] -- [0] edge.</span></div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  DCHECK(!plus_free_pq_.Contains(&edge));</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  DCHECK(!plus_plus_pq_.Contains(&edge));</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  plus_free_pq_.Add(&edge);</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keywordflow">if</span> (edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> == tree_dual) {</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  DCHECK_EQ(<a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ec09b02b175052c5546eda76464accd">Slack</a>(edge), 0);</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  primal_update_edge_queue_.push_back(e);</div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  }</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  }</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  }</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  }</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</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> <span class="keywordtype">void</span> BlossomGraph::AppendNodePathToRoot(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n,</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  std::vector<NodeIndex>* path)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  path->push_back(n);</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  n = nodes_[n].parent;</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="keywordflow">if</span> (n == path->back()) <span class="keywordflow">break</span>;</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> }</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  </div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a77239a64984b6868f08721b84d7c08a1"> 547</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_blossom_graph.html#a77239a64984b6868f08721b84d7c08a1">BlossomGraph::Augment</a>(EdgeIndex e) {</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  ++num_augments_;</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  </div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& edge = edges_[e];</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  VLOG(2) << <span class="stringliteral">"Augment "</span> << Tail(edge) << <span class="stringliteral">" -> "</span> << Head(edge);</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  DCHECK(<a class="code" href="classoperations__research_1_1_blossom_graph.html#a41347b63abb9f92b02b1705cdae50cad">DebugEdgeIsTightAndExternal</a>(edge));</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  DCHECK(nodes_[Tail(edge)].IsPlus());</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  DCHECK(nodes_[Head(edge)].IsPlus());</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  </div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> root_a = nodes_[Tail(edge)].root;</div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> root_b = nodes_[Head(edge)].root;</div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  DCHECK_NE(root_a, root_b);</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  </div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="comment">// Compute the path from root_a to root_b.</span></div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  std::vector<NodeIndex> node_path;</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  AppendNodePathToRoot(Tail(edge), &node_path);</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  std::reverse(node_path.begin(), node_path.end());</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  AppendNodePathToRoot(Head(edge), &node_path);</div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  </div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="comment">// TODO(user): Check all dual/slack same after primal op?</span></div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> delta_a = nodes_[root_a].tree_dual_delta;</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> delta_b = nodes_[root_b].tree_dual_delta;</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  nodes_[root_a].tree_dual_delta = 0;</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  nodes_[root_b].tree_dual_delta = 0;</div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  </div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="comment">// Make all the nodes from both trees free while keeping the</span></div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="comment">// current matching.</span></div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="comment">// TODO(user): It seems that we may waste some computation since the part of</span></div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="comment">// the tree not in the path between roots can lead to the same Grow()</span></div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="comment">// operations later when one of its node is ratched to a new root.</span></div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="comment">// TODO(user): Reduce this O(num_nodes) complexity. We might be able to</span></div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="comment">// even do O(num_node_in_path) with lazy updates. Note that this operation</span></div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="comment">// will only be performed at most num_initial_unmatched_nodes / 2 times</span></div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="comment">// though.</span></div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n(0); n < nodes_.size(); ++n) {</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& node = nodes_[n];</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keywordflow">if</span> (node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a6bd5709ed0198c891c1d312e700c083b">IsInternal</a>()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> root = node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2">root</a>;</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keywordflow">if</span> (root != root_a && root != root_b) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  </div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a> = node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26">type</a> * (root == root_a ? delta_a : delta_b);</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae51446839a3bac95fbd94fb2cb34f810">pseudo_dual</a> += <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>;</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> subnode : SubNodes(n)) {</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> EdgeIndex e : graph_[subnode]) {</div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& edge = edges_[e];</div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> other_end = OtherEnd(edge, subnode);</div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keywordflow">if</span> (other_end == n) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> -= <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>;</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  </div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="comment">// If the other end is not in one of the two trees, and it is a plus</span></div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="comment">// node, we add it the plus_free queue. All previous [+]--[0] and</span></div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="comment">// [+]--[+] edges need to be removed from the queues.</span></div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& other_node = nodes_[other_end];</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keywordflow">if</span> (other_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2">root</a> != root_a && other_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2">root</a> != root_b &&</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  other_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a8cf7b66e4c76384f3d1d1f9a4ee8ae02">IsPlus</a>()) {</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="keywordflow">if</span> (plus_plus_pq_.Contains(&edge)) plus_plus_pq_.Remove(&edge);</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  DCHECK(!plus_free_pq_.Contains(&edge));</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  plus_free_pq_.Add(&edge);</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ec09b02b175052c5546eda76464accd">Slack</a>(edge) == 0) primal_update_edge_queue_.push_back(e);</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keywordflow">if</span> (plus_plus_pq_.Contains(&edge)) plus_plus_pq_.Remove(&edge);</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="keywordflow">if</span> (plus_free_pq_.Contains(&edge)) plus_free_pq_.Remove(&edge);</div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  }</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  }</div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  }</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  </div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26">type</a> = 0;</div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a768efacafc19717a4d6f28a2f9f41ae3">parent</a> = node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2">root</a> = n;</div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  }</div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  </div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="comment">// Change the matching of nodes along node_path.</span></div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  CHECK_EQ(node_path.size() % 2, 0);</div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < node_path.size(); i += 2) {</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  nodes_[node_path[i]].match = node_path[i + 1];</div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  nodes_[node_path[i + 1]].match = node_path[i];</div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  }</div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  </div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="comment">// Update unmatched_nodes_.</span></div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="comment">// TODO(user): This could probably be optimized if needed. But we do usually</span></div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="comment">// iterate a lot more over it than we update it. Note that as long as we use</span></div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="comment">// the same delta for all trees, this is not even needed.</span></div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="keywordtype">int</span> new_size = 0;</div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n : unmatched_nodes_) {</div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ba793d57999d40090be769a97c6ac59">NodeIsMatched</a>(n)) unmatched_nodes_[new_size++] = n;</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>  CHECK_EQ(unmatched_nodes_.size(), new_size + 2);</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  unmatched_nodes_.resize(new_size);</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span> }</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  </div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span> <span class="keywordtype">int</span> BlossomGraph::GetDepth(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="keywordtype">int</span> depth = 0;</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> parent = nodes_[n].parent;</div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keywordflow">if</span> (parent == n) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  ++depth;</div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  n = parent;</div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  }</div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="keywordflow">return</span> depth;</div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span> }</div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  </div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#aacc1343585a38bfaa42702e635552837"> 650</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_blossom_graph.html#aacc1343585a38bfaa42702e635552837">BlossomGraph::Shrink</a>(EdgeIndex e) {</div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  ++num_shrinks_;</div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  </div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& edge = edges_[e];</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  DCHECK(<a class="code" href="classoperations__research_1_1_blossom_graph.html#a41347b63abb9f92b02b1705cdae50cad">DebugEdgeIsTightAndExternal</a>(edge));</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  DCHECK(nodes_[Tail(edge)].IsPlus());</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  DCHECK(nodes_[Head(edge)].IsPlus());</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  DCHECK_EQ(nodes_[Tail(edge)].root, nodes_[Head(edge)].root);</div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  </div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  CHECK_NE(Tail(edge), Head(edge)) << e;</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>  <span class="comment">// Find lowest common ancestor and the two node paths to reach it. Note that</span></div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="comment">// we do not add it to the paths.</span></div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> lca_index = <a class="code" href="classoperations__research_1_1_blossom_graph.html#aa58388f09616752263b1fac85c35e432">kNoNodeIndex</a>;</div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  std::vector<NodeIndex> tail_path;</div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  std::vector<NodeIndex> head_path;</div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  {</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> = Tail(edge);</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> = Head(edge);</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keywordtype">int</span> tail_depth = GetDepth(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>);</div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="keywordtype">int</span> head_depth = GetDepth(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="keywordflow">if</span> (tail_depth > head_depth) {</div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  std::swap(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  std::swap(tail_depth, head_depth);</div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  }</div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  VLOG(2) << <span class="stringliteral">"Shrink "</span> << <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> << <span class="stringliteral">" <-> "</span> << <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>;</div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  </div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <span class="keywordflow">while</span> (head_depth > tail_depth) {</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  head_path.push_back(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> = nodes_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>].parent;</div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  --head_depth;</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  }</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <span class="keywordflow">while</span> (<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> != <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>) {</div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  DCHECK_EQ(tail_depth, head_depth);</div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  DCHECK_GE(tail_depth, 0);</div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  --tail_depth;</div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  --head_depth;</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>  </div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  tail_path.push_back(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>);</div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> = nodes_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>].parent;</div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  </div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  head_path.push_back(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> = nodes_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>].parent;</div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  }</div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  lca_index = <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>;</div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  VLOG(2) << <span class="stringliteral">"LCA "</span> << lca_index;</div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  }</div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& lca = nodes_[lca_index];</div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  DCHECK(lca.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a8cf7b66e4c76384f3d1d1f9a4ee8ae02">IsPlus</a>());</div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  </div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="comment">// Fill the cycle.</span></div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  std::vector<NodeIndex> blossom = {lca_index};</div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  std::reverse(head_path.begin(), head_path.end());</div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  blossom.insert(blossom.end(), head_path.begin(), head_path.end());</div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  blossom.insert(blossom.end(), tail_path.begin(), tail_path.end());</div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  CHECK_EQ(blossom.size() % 2, 1);</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  </div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> tree_dual = nodes_[lca.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2">root</a>].tree_dual_delta;</div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  </div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="comment">// Save all values that will be needed if we expand this Blossom later.</span></div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  CHECK_GT(blossom.size(), 1);</div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& backup_node = nodes_[blossom[1]];</div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span> <span class="preprocessor">#ifndef NDEBUG</span></div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  backup_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae812ee39507ef5bd0cb6b58605c7803d">saved_dual</a> = lca.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aaac09b61c2e9f87b7b2234836d5a950a">dual</a>;</div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  backup_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a773c851657cfc5a2dbc0fb25958e668a">saved_pseudo_dual</a> = lca.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae51446839a3bac95fbd94fb2cb34f810">pseudo_dual</a> + tree_dual;</div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  </div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="comment">// Set the new dual of the node to zero.</span></div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span> <span class="preprocessor">#ifndef NDEBUG</span></div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  lca.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aaac09b61c2e9f87b7b2234836d5a950a">dual</a> = 0;</div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  lca.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae51446839a3bac95fbd94fb2cb34f810">pseudo_dual</a> = -tree_dual;</div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  CHECK_EQ(<a class="code" href="classoperations__research_1_1_blossom_graph.html#a7cc8e3de83d28065411068cf09b7992e">Dual</a>(lca), 0);</div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  </div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="comment">// Mark node as internal, but do not change their type to zero yet.</span></div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="comment">// We need to do that first to properly detect edges between two internal</span></div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="comment">// nodes in the second loop below.</span></div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n : blossom) {</div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  VLOG(2) << <span class="stringliteral">"blossom-node: "</span> << <a class="code" href="classoperations__research_1_1_blossom_graph.html#a641610cf698af15f1f8e24741c1fd572">NodeDebugString</a>(n);</div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keywordflow">if</span> (n != lca_index) {</div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  nodes_[n].is_internal = <span class="keyword">true</span>;</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>  }</div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  </div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="comment">// Update the dual of all edges and the priority queueus.</span></div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n : blossom) {</div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& mutable_node = nodes_[n];</div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> was_minus = mutable_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#af7b352e9f09d2400d7686572bec02ef1">IsMinus</a>();</div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> slack_adjust =</div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  mutable_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#af7b352e9f09d2400d7686572bec02ef1">IsMinus</a>() ? tree_dual : -tree_dual;</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keywordflow">if</span> (n != lca_index) {</div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  mutable_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae51446839a3bac95fbd94fb2cb34f810">pseudo_dual</a> -= slack_adjust;</div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span> <span class="preprocessor">#ifndef NDEBUG</span></div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  DCHECK_EQ(mutable_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aaac09b61c2e9f87b7b2234836d5a950a">dual</a>, mutable_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae51446839a3bac95fbd94fb2cb34f810">pseudo_dual</a>);</div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  mutable_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26">type</a> = 0;</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>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> subnode : SubNodes(n)) {</div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="comment">// Subtle: We update root_blossom_node_ while we loop, so for new internal</span></div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="comment">// edges, depending if an edge "other end" appear after or before, it will</span></div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="comment">// not be updated. We use this to only process internal edges once.</span></div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  root_blossom_node_[subnode] = lca_index;</div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  </div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> EdgeIndex e : graph_[subnode]) {</div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& edge = edges_[e];</div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> other_end = OtherEnd(edge, subnode);</div>
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  </div>
|
|
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="comment">// Skip edge that are already internal.</span></div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="keywordflow">if</span> (other_end == n) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  </div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="comment">// This internal edge was already processed from its other end, so we</span></div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="comment">// can just skip it.</span></div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="keywordflow">if</span> (other_end == lca_index) {</div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span> <span class="preprocessor">#ifndef NDEBUG</span></div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  DCHECK_EQ(edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a015731c5f4abd13de18e78c4e4bb35ce">slack</a>, <a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ec09b02b175052c5546eda76464accd">Slack</a>(edge));</div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  }</div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  </div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <span class="comment">// This is a new-internal edge that we didn't proccess yet.</span></div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <span class="comment">// TODO(user): It would be nicer to not to have to read the memory of</span></div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="comment">// the other node at all. It might be possible once we store the</span></div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="comment">// parent edge instead of the parent node since then we will only need</span></div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="comment">// to know if this edges point to a new-internal node or not.</span></div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& mutable_other_node = nodes_[other_end];</div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="keywordflow">if</span> (mutable_other_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aab699e604962539cc9305c4e496032a5">is_internal</a>) {</div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  DCHECK(!plus_free_pq_.Contains(&edge));</div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keywordflow">if</span> (plus_plus_pq_.Contains(&edge)) plus_plus_pq_.Remove(&edge);</div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> += slack_adjust;</div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> +=</div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  mutable_other_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#af7b352e9f09d2400d7686572bec02ef1">IsMinus</a>() ? tree_dual : -tree_dual;</div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  }</div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  </div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="comment">// Replace the parent of any child of n by lca_index.</span></div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  <span class="keywordflow">if</span> (mutable_other_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a768efacafc19717a4d6f28a2f9f41ae3">parent</a> == n) {</div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  mutable_other_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a768efacafc19717a4d6f28a2f9f41ae3">parent</a> = lca_index;</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>  <span class="comment">// Adjust when the edge used to be connected to a [-] node now that we</span></div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="comment">// attach it to a [+] node. Note that if the node was [+] then the</span></div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="comment">// non-internal incident edges slack and type do not change.</span></div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="keywordflow">if</span> (was_minus) {</div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> += 2 * tree_dual;</div>
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  </div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <span class="comment">// Add it to the correct PQ.</span></div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  DCHECK(!plus_plus_pq_.Contains(&edge));</div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  DCHECK(!plus_free_pq_.Contains(&edge));</div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  <span class="keywordflow">if</span> (mutable_other_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a8cf7b66e4c76384f3d1d1f9a4ee8ae02">IsPlus</a>()) {</div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  plus_plus_pq_.Add(&edge);</div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  <span class="keywordflow">if</span> (edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> == 2 * tree_dual) {</div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  primal_update_edge_queue_.push_back(e);</div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  }</div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (mutable_other_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a48a8004385fae256a9c93d353016bea1">IsFree</a>()) {</div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  plus_free_pq_.Add(&edge);</div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="keywordflow">if</span> (edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> == tree_dual) {</div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  primal_update_edge_queue_.push_back(e);</div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  }</div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  }</div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  }</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  </div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span> <span class="preprocessor">#ifndef NDEBUG</span></div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  DCHECK_EQ(edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a015731c5f4abd13de18e78c4e4bb35ce">slack</a>, <a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ec09b02b175052c5546eda76464accd">Slack</a>(edge));</div>
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  }</div>
|
|
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  }</div>
|
|
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  }</div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  </div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  DCHECK(backup_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aa5998e93c946a8c5ec1626dee2915555">saved_blossom</a>.empty());</div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  backup_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aa5998e93c946a8c5ec1626dee2915555">saved_blossom</a> = std::move(lca.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a60c314ee4437d32edbfb3a178b41b433">blossom</a>);</div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  lca.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a60c314ee4437d32edbfb3a178b41b433">blossom</a> = std::move(blossom);</div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  </div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  VLOG(2) << <span class="stringliteral">"S result "</span> << <a class="code" href="classoperations__research_1_1_blossom_graph.html#a641610cf698af15f1f8e24741c1fd572">NodeDebugString</a>(lca_index);</div>
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span> }</div>
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  </div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span> BlossomGraph::EdgeIndex BlossomGraph::FindTightExternalEdgeBetweenNodes(</div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <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="l00830"></a><span class="lineno"> 830</span>  DCHECK_NE(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  DCHECK_EQ(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, root_blossom_node_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>]);</div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  DCHECK_EQ(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>, root_blossom_node_[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>]);</div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> subnode : SubNodes(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>)) {</div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> EdgeIndex e : graph_[subnode]) {</div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <span class="keyword">const</span> Edge& edge = edges_[e];</div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> other_end = OtherEnd(edge, subnode);</div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="keywordflow">if</span> (other_end == <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> && <a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ec09b02b175052c5546eda76464accd">Slack</a>(edge) == 0) {</div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <span class="keywordflow">return</span> e;</div>
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  }</div>
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  }</div>
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  }</div>
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_blossom_graph.html#a8a0d1ac19aba17d0f2d52d15a049dc2c">kNoEdgeIndex</a>;</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"><a class="line" href="classoperations__research_1_1_blossom_graph.html#abf9aa973816e638a2b972b595d952c0e"> 845</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_blossom_graph.html#abf9aa973816e638a2b972b595d952c0e">BlossomGraph::Expand</a>(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> to_expand) {</div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  ++num_expands_;</div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  VLOG(2) << <span class="stringliteral">"Expand "</span> << to_expand;</div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  </div>
|
|
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& node_to_expand = nodes_[to_expand];</div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  DCHECK(node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0d7fbff09819deb796dfbcb6370b12b2">IsBlossom</a>());</div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  DCHECK(node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#af7b352e9f09d2400d7686572bec02ef1">IsMinus</a>());</div>
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  DCHECK_EQ(<a class="code" href="classoperations__research_1_1_blossom_graph.html#a7cc8e3de83d28065411068cf09b7992e">Dual</a>(node_to_expand), 0);</div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  </div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="keyword">const</span> EdgeIndex match_edge_index =</div>
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  FindTightExternalEdgeBetweenNodes(to_expand, node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0c5e020f1174f613f0fe58d93e9cefa1">match</a>);</div>
|
|
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="keyword">const</span> EdgeIndex parent_edge_index =</div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  FindTightExternalEdgeBetweenNodes(to_expand, node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a768efacafc19717a4d6f28a2f9f41ae3">parent</a>);</div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  </div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="comment">// First, restore the saved fields.</span></div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& backup_node = nodes_[node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a60c314ee4437d32edbfb3a178b41b433">blossom</a>[1]];</div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span> <span class="preprocessor">#ifndef NDEBUG</span></div>
|
|
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aaac09b61c2e9f87b7b2234836d5a950a">dual</a> = backup_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae812ee39507ef5bd0cb6b58605c7803d">saved_dual</a>;</div>
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae51446839a3bac95fbd94fb2cb34f810">pseudo_dual</a> = backup_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a773c851657cfc5a2dbc0fb25958e668a">saved_pseudo_dual</a>;</div>
|
|
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  std::vector<NodeIndex> blossom = std::move(node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a60c314ee4437d32edbfb3a178b41b433">blossom</a>);</div>
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a60c314ee4437d32edbfb3a178b41b433">blossom</a> = std::move(backup_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aa5998e93c946a8c5ec1626dee2915555">saved_blossom</a>);</div>
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  backup_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aa5998e93c946a8c5ec1626dee2915555">saved_blossom</a>.clear();</div>
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  </div>
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="comment">// Restore the edges Head()/Tail().</span></div>
|
|
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n : blossom) {</div>
|
|
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> subnode : SubNodes(n)) {</div>
|
|
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  root_blossom_node_[subnode] = n;</div>
|
|
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  }</div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</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>  <span class="comment">// Now we try to find a 'blossom path' that will replace the blossom node in</span></div>
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <span class="comment">// the alternating tree: the blossom's parent [+] node in the tree will be</span></div>
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <span class="comment">// attached to a blossom subnode (the "path start"), the blossom's child in</span></div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <span class="comment">// the tree will be attached to a blossom subnode (the "path end", which could</span></div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="comment">// be the same subnode or a different one), and, using the blossom cycle,</span></div>
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="comment">// we'll get a path with an odd number of blossom subnodes to connect the two</span></div>
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <span class="comment">// (since the cycle is odd, one of the two paths will be odd too). The other</span></div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <span class="comment">// subnodes of the blossom will then be made free nodes matched pairwise.</span></div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  <span class="keywordtype">int</span> blossom_path_start = -1;</div>
|
|
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="keywordtype">int</span> blossom_path_end = -1;</div>
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> start_node = OtherEndFromExternalNode(</div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  edges_[parent_edge_index], node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a768efacafc19717a4d6f28a2f9f41ae3">parent</a>);</div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> end_node =</div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  OtherEndFromExternalNode(edges_[match_edge_index], node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0c5e020f1174f613f0fe58d93e9cefa1">match</a>);</div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < blossom.size(); ++i) {</div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="keywordflow">if</span> (blossom[i] == start_node) blossom_path_start = i;</div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="keywordflow">if</span> (blossom[i] == end_node) blossom_path_end = i;</div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  }</div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  </div>
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <span class="comment">// Split the cycle in two halves: nodes in [start..end] in path1, and</span></div>
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="comment">// nodes in [end..start] in path2. Note the inclusive intervals.</span></div>
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keyword">const</span> std::vector<NodeIndex>& cycle = blossom;</div>
|
|
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  std::vector<NodeIndex> path1;</div>
|
|
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  std::vector<NodeIndex> path2;</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>  <span class="keyword">const</span> <span class="keywordtype">int</span> end_offset =</div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  (blossom_path_end + cycle.size() - blossom_path_start) % cycle.size();</div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> offset = 0; offset <= <span class="comment">/*or equal*/</span> cycle.size(); ++offset) {</div>
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node =</div>
|
|
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  cycle[(blossom_path_start + offset) % cycle.size()];</div>
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="keywordflow">if</span> (offset <= end_offset) path1.push_back(node);</div>
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  <span class="keywordflow">if</span> (offset >= end_offset) path2.push_back(node);</div>
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  }</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="comment">// Reverse path2 to also make it go from start to end.</span></div>
|
|
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  std::reverse(path2.begin(), path2.end());</div>
|
|
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  </div>
|
|
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="comment">// Swap if necessary so that path1 is the odd-length one.</span></div>
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <span class="keywordflow">if</span> (path1.size() % 2 == 0) path1.swap(path2);</div>
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  </div>
|
|
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="comment">// Use better aliases than 'path1' and 'path2' in the code below.</span></div>
|
|
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  std::vector<NodeIndex>& path_in_tree = path1;</div>
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="keyword">const</span> std::vector<NodeIndex>& free_pairs = path2;</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="comment">// Strip path2 from the start and end, which aren't needed.</span></div>
|
|
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  path2.erase(path2.begin());</div>
|
|
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  path2.pop_back();</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>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> blossom_matched_node = node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0c5e020f1174f613f0fe58d93e9cefa1">match</a>;</div>
|
|
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  VLOG(2) << <span class="stringliteral">"Path ["</span></div>
|
|
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  << absl::StrJoin(path_in_tree, <span class="stringliteral">", "</span>, absl::StreamFormatter())</div>
|
|
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  << <span class="stringliteral">"] === "</span> << blossom_matched_node;</div>
|
|
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  VLOG(2) << <span class="stringliteral">"Pairs ["</span></div>
|
|
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  << absl::StrJoin(free_pairs, <span class="stringliteral">", "</span>, absl::StreamFormatter()) << <span class="stringliteral">"]"</span>;</div>
|
|
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  </div>
|
|
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="comment">// Restore the path in the tree, note that we append the blossom_matched_node</span></div>
|
|
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <span class="comment">// to simplify the code:</span></div>
|
|
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  <span class="comment">// <---- Blossom ----></span></div>
|
|
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="comment">// [-] === [+] --- [-] === [+]</span></div>
|
|
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  path_in_tree.push_back(blossom_matched_node);</div>
|
|
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  CHECK_EQ(path_in_tree.size() % 2, 0);</div>
|
|
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> tree_dual = nodes_[node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2">root</a>].tree_dual_delta;</div>
|
|
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < path_in_tree.size(); ++i) {</div>
|
|
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n = path_in_tree[i];</div>
|
|
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> node_is_plus = i % 2;</div>
|
|
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  </div>
|
|
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  <span class="comment">// Update the parent.</span></div>
|
|
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  <span class="keywordflow">if</span> (i == 0) {</div>
|
|
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="comment">// This is the path start and its parent is either itself or the parent of</span></div>
|
|
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <span class="comment">// to_expand if there was one.</span></div>
|
|
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  DCHECK(node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a768efacafc19717a4d6f28a2f9f41ae3">parent</a> != to_expand || n == to_expand);</div>
|
|
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  nodes_[n].parent = node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a768efacafc19717a4d6f28a2f9f41ae3">parent</a>;</div>
|
|
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  nodes_[n].parent = path_in_tree[i - 1];</div>
|
|
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  }</div>
|
|
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  </div>
|
|
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <span class="comment">// Update the types and matches.</span></div>
|
|
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  nodes_[n].root = node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2">root</a>;</div>
|
|
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  nodes_[n].type = node_is_plus ? 1 : -1;</div>
|
|
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  nodes_[n].match = path_in_tree[node_is_plus ? i - 1 : i + 1];</div>
|
|
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  </div>
|
|
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  <span class="comment">// Ignore the blossom_matched_node for the code below.</span></div>
|
|
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="keywordflow">if</span> (i + 1 == path_in_tree.size()) <span class="keywordflow">continue</span>;</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>  <span class="comment">// Update the duals, depending on whether we have a new [+] or [-] node.</span></div>
|
|
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  <span class="comment">// Note that this is also needed for the 'root' blossom node (i=0), because</span></div>
|
|
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  <span class="comment">// we've restored its pseudo-dual from its old saved value above.</span></div>
|
|
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> adjust = node_is_plus ? -tree_dual : tree_dual;</div>
|
|
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  nodes_[n].pseudo_dual += adjust;</div>
|
|
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> subnode : SubNodes(n)) {</div>
|
|
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> EdgeIndex e : graph_[subnode]) {</div>
|
|
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& edge = edges_[e];</div>
|
|
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> other_end = OtherEnd(edge, subnode);</div>
|
|
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  <span class="keywordflow">if</span> (other_end == n) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  </div>
|
|
<div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> -= adjust;</div>
|
|
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  </div>
|
|
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  <span class="comment">// non-internal edges used to be attached to the [-] node_to_expand,</span></div>
|
|
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  <span class="comment">// so we adjust their dual.</span></div>
|
|
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <span class="keywordflow">if</span> (other_end != to_expand && !nodes_[other_end].is_internal) {</div>
|
|
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> += tree_dual;</div>
|
|
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  <span class="comment">// This was an internal edges. For the PQ code below to be correct, we</span></div>
|
|
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="comment">// wait for its other end to have been processed by this loop already.</span></div>
|
|
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  <span class="comment">// We detect that using the fact that the type of unprocessed internal</span></div>
|
|
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  <span class="comment">// node is still zero.</span></div>
|
|
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  <span class="keywordflow">if</span> (nodes_[other_end].type == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  }</div>
|
|
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  </div>
|
|
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="comment">// Update edge queues.</span></div>
|
|
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  <span class="keywordflow">if</span> (node_is_plus) {</div>
|
|
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& other_node = nodes_[other_end];</div>
|
|
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  DCHECK(!plus_plus_pq_.Contains(&edge));</div>
|
|
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  DCHECK(!plus_free_pq_.Contains(&edge));</div>
|
|
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  <span class="keywordflow">if</span> (other_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a8cf7b66e4c76384f3d1d1f9a4ee8ae02">IsPlus</a>()) {</div>
|
|
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  plus_plus_pq_.Add(&edge);</div>
|
|
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  <span class="keywordflow">if</span> (edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> == 2 * tree_dual) {</div>
|
|
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  primal_update_edge_queue_.push_back(e);</div>
|
|
<div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  }</div>
|
|
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (other_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a48a8004385fae256a9c93d353016bea1">IsFree</a>()) {</div>
|
|
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  plus_free_pq_.Add(&edge);</div>
|
|
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  <span class="keywordflow">if</span> (edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> == tree_dual) {</div>
|
|
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  primal_update_edge_queue_.push_back(e);</div>
|
|
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  }</div>
|
|
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  }</div>
|
|
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  }</div>
|
|
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  }</div>
|
|
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  }</div>
|
|
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  }</div>
|
|
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  </div>
|
|
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  <span class="comment">// Update free nodes.</span></div>
|
|
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n : free_pairs) {</div>
|
|
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  nodes_[n].type = 0;</div>
|
|
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  nodes_[n].parent = n;</div>
|
|
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  nodes_[n].root = n;</div>
|
|
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  </div>
|
|
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  <span class="comment">// Update edges slack and priority queue for the adjacent edges.</span></div>
|
|
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> subnode : SubNodes(n)) {</div>
|
|
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> EdgeIndex e : graph_[subnode]) {</div>
|
|
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& edge = edges_[e];</div>
|
|
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> other_end = OtherEnd(edge, subnode);</div>
|
|
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <span class="keywordflow">if</span> (other_end == n) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  </div>
|
|
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  <span class="comment">// non-internal edges used to be attached to the [-] node_to_expand,</span></div>
|
|
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  <span class="comment">// so we adjust their dual.</span></div>
|
|
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  <span class="keywordflow">if</span> (other_end != to_expand && !nodes_[other_end].is_internal) {</div>
|
|
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> += tree_dual;</div>
|
|
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  }</div>
|
|
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  </div>
|
|
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  <span class="comment">// Update PQ. Note that since this was attached to a [-] node it cannot</span></div>
|
|
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  <span class="comment">// be in any queue. We will also never process twice the same edge here.</span></div>
|
|
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  DCHECK(!plus_plus_pq_.Contains(&edge));</div>
|
|
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  DCHECK(!plus_free_pq_.Contains(&edge));</div>
|
|
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  <span class="keywordflow">if</span> (nodes_[other_end].IsPlus()) {</div>
|
|
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  plus_free_pq_.Add(&edge);</div>
|
|
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  <span class="keywordflow">if</span> (edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> == tree_dual) {</div>
|
|
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  primal_update_edge_queue_.push_back(e);</div>
|
|
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  }</div>
|
|
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  }</div>
|
|
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  }</div>
|
|
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  }</div>
|
|
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  }</div>
|
|
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  </div>
|
|
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  <span class="comment">// Matches the free pair together.</span></div>
|
|
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  CHECK_EQ(free_pairs.size() % 2, 0);</div>
|
|
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < free_pairs.size(); i += 2) {</div>
|
|
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  nodes_[free_pairs[i]].match = free_pairs[i + 1];</div>
|
|
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  nodes_[free_pairs[i + 1]].match = free_pairs[i];</div>
|
|
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  }</div>
|
|
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  </div>
|
|
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  <span class="comment">// Mark all node as external. We do that last so we could easily detect old</span></div>
|
|
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <span class="comment">// internal edges that are now external.</span></div>
|
|
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n : blossom) {</div>
|
|
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  nodes_[n].is_internal = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  }</div>
|
|
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span> }</div>
|
|
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  </div>
|
|
<div class="line"><a name="l01054"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#ad0050e8e5a05f9fb9add3a7ccfd96cf2"> 1054</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_blossom_graph.html#ad0050e8e5a05f9fb9add3a7ccfd96cf2">BlossomGraph::ExpandAllBlossoms</a>() {</div>
|
|
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  <span class="comment">// Queue of blossoms to expand.</span></div>
|
|
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  std::vector<NodeIndex> queue;</div>
|
|
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n(0); n < nodes_.size(); ++n) {</div>
|
|
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& node = nodes_[n];</div>
|
|
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  <span class="keywordflow">if</span> (node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a6bd5709ed0198c891c1d312e700c083b">IsInternal</a>()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  </div>
|
|
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  <span class="comment">// When this is called, there should be no more trees.</span></div>
|
|
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  CHECK(node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a48a8004385fae256a9c93d353016bea1">IsFree</a>());</div>
|
|
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  </div>
|
|
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  <span class="keywordflow">if</span> (node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0d7fbff09819deb796dfbcb6370b12b2">IsBlossom</a>()) queue.push_back(n);</div>
|
|
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  }</div>
|
|
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  </div>
|
|
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  <span class="comment">// TODO(user): remove duplication with expand?</span></div>
|
|
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  <span class="keywordflow">while</span> (!queue.empty()) {</div>
|
|
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> to_expand = queue.back();</div>
|
|
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  queue.pop_back();</div>
|
|
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  </div>
|
|
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& node_to_expand = nodes_[to_expand];</div>
|
|
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  DCHECK(node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0d7fbff09819deb796dfbcb6370b12b2">IsBlossom</a>());</div>
|
|
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  </div>
|
|
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  <span class="comment">// Find the edge used to match to_expand with Match(to_expand).</span></div>
|
|
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  <span class="keyword">const</span> EdgeIndex match_edge_index =</div>
|
|
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  FindTightExternalEdgeBetweenNodes(to_expand, node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0c5e020f1174f613f0fe58d93e9cefa1">match</a>);</div>
|
|
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  </div>
|
|
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <span class="comment">// Restore the saved data.</span></div>
|
|
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& backup_node = nodes_[node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a60c314ee4437d32edbfb3a178b41b433">blossom</a>[1]];</div>
|
|
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span> <span class="preprocessor">#ifndef NDEBUG</span></div>
|
|
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aaac09b61c2e9f87b7b2234836d5a950a">dual</a> = backup_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae812ee39507ef5bd0cb6b58605c7803d">saved_dual</a>;</div>
|
|
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae51446839a3bac95fbd94fb2cb34f810">pseudo_dual</a> = backup_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a773c851657cfc5a2dbc0fb25958e668a">saved_pseudo_dual</a>;</div>
|
|
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  </div>
|
|
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  std::vector<NodeIndex> blossom = std::move(node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a60c314ee4437d32edbfb3a178b41b433">blossom</a>);</div>
|
|
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a60c314ee4437d32edbfb3a178b41b433">blossom</a> = std::move(backup_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aa5998e93c946a8c5ec1626dee2915555">saved_blossom</a>);</div>
|
|
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  backup_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aa5998e93c946a8c5ec1626dee2915555">saved_blossom</a>.clear();</div>
|
|
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  </div>
|
|
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  <span class="comment">// Restore the edges Head()/Tail().</span></div>
|
|
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n : blossom) {</div>
|
|
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> subnode : SubNodes(n)) {</div>
|
|
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  root_blossom_node_[subnode] = n;</div>
|
|
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  }</div>
|
|
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  }</div>
|
|
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  </div>
|
|
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  <span class="comment">// Find the index of matched_node in the blossom list.</span></div>
|
|
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  <span class="keywordtype">int</span> internal_matched_index = -1;</div>
|
|
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> matched_node = OtherEndFromExternalNode(</div>
|
|
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  edges_[match_edge_index], node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0c5e020f1174f613f0fe58d93e9cefa1">match</a>);</div>
|
|
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = blossom.size();</div>
|
|
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  <span class="keywordflow">if</span> (blossom[i] == matched_node) {</div>
|
|
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  internal_matched_index = i;</div>
|
|
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  }</div>
|
|
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  }</div>
|
|
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  CHECK_NE(internal_matched_index, -1);</div>
|
|
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  </div>
|
|
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  <span class="comment">// Amongst the node_to_expand.blossom nodes, internal_matched_index is</span></div>
|
|
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="comment">// matched with external_matched_node and the other are matched together.</span></div>
|
|
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  std::vector<NodeIndex> free_pairs;</div>
|
|
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = (internal_matched_index + 1) % size;</div>
|
|
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  i != internal_matched_index; i = (i + 1) % size) {</div>
|
|
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  free_pairs.push_back(blossom[i]);</div>
|
|
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  }</div>
|
|
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  </div>
|
|
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  <span class="comment">// Clear root/parent/type of all internal nodes.</span></div>
|
|
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> to_clear : blossom) {</div>
|
|
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  nodes_[to_clear].type = 0;</div>
|
|
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  nodes_[to_clear].is_internal = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  nodes_[to_clear].parent = to_clear;</div>
|
|
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  nodes_[to_clear].root = to_clear;</div>
|
|
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  }</div>
|
|
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  </div>
|
|
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  <span class="comment">// Matches the internal node with external one.</span></div>
|
|
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> external_matched_node = node_to_expand.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0c5e020f1174f613f0fe58d93e9cefa1">match</a>;</div>
|
|
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> internal_matched_node = blossom[internal_matched_index];</div>
|
|
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  nodes_[internal_matched_node].match = external_matched_node;</div>
|
|
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  nodes_[external_matched_node].match = internal_matched_node;</div>
|
|
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  </div>
|
|
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  <span class="comment">// Matches the free pair together.</span></div>
|
|
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  CHECK_EQ(free_pairs.size() % 2, 0);</div>
|
|
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < free_pairs.size(); i += 2) {</div>
|
|
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  nodes_[free_pairs[i]].match = free_pairs[i + 1];</div>
|
|
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  nodes_[free_pairs[i + 1]].match = free_pairs[i];</div>
|
|
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  }</div>
|
|
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  </div>
|
|
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  <span class="comment">// Now that the expansion is done, add to the queue any sub-blossoms.</span></div>
|
|
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n : blossom) {</div>
|
|
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  <span class="keywordflow">if</span> (nodes_[n].IsBlossom()) queue.push_back(n);</div>
|
|
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  }</div>
|
|
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  }</div>
|
|
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span> }</div>
|
|
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  </div>
|
|
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span> <span class="keyword">const</span> std::vector<NodeIndex>& BlossomGraph::SubNodes(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n) {</div>
|
|
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  <span class="comment">// This should be only called on an external node. However, in Shrink() we</span></div>
|
|
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  <span class="comment">// mark the node as internal early, so we just make sure the node as no saved</span></div>
|
|
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  <span class="comment">// blossom field here.</span></div>
|
|
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  DCHECK(nodes_[n].saved_blossom.empty());</div>
|
|
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  </div>
|
|
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  <span class="comment">// Expand all the inner nodes under the node n. This will not be n iff node is</span></div>
|
|
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  <span class="comment">// is in fact a blossom.</span></div>
|
|
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  subnodes_ = {n};</div>
|
|
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < subnodes_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  <span class="keyword">const</span> Node& node = nodes_[subnodes_[i]];</div>
|
|
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  </div>
|
|
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  <span class="comment">// Since the first node in each list is always the node above, we just</span></div>
|
|
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  <span class="comment">// skip it to avoid listing twice the nodes.</span></div>
|
|
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  <span class="keywordflow">if</span> (!node.blossom.empty()) {</div>
|
|
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  subnodes_.insert(subnodes_.end(), node.blossom.begin() + 1,</div>
|
|
<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  node.blossom.end());</div>
|
|
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  }</div>
|
|
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  </div>
|
|
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  <span class="comment">// We also need to recursively expand the sub-blossom nodes, which are (if</span></div>
|
|
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  <span class="comment">// any) in the "saved_blossom" field of the first internal node of each</span></div>
|
|
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  <span class="comment">// blossom. Since we iterate on all internal nodes here, we simply consult</span></div>
|
|
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  <span class="comment">// the "saved_blossom" field of all subnodes, and it works the same.</span></div>
|
|
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  <span class="keywordflow">if</span> (!node.saved_blossom.empty()) {</div>
|
|
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  subnodes_.insert(subnodes_.end(), node.saved_blossom.begin() + 1,</div>
|
|
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  node.saved_blossom.end());</div>
|
|
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  }</div>
|
|
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  }</div>
|
|
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  <span class="keywordflow">return</span> subnodes_;</div>
|
|
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span> }</div>
|
|
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  </div>
|
|
<div class="line"><a name="l01177"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a641610cf698af15f1f8e24741c1fd572"> 1177</a></span> std::string <a class="code" href="classoperations__research_1_1_blossom_graph.html#a641610cf698af15f1f8e24741c1fd572">BlossomGraph::NodeDebugString</a>(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& node = nodes_[n];</div>
|
|
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  <span class="keywordflow">if</span> (node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aab699e604962539cc9305c4e496032a5">is_internal</a>) {</div>
|
|
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  <span class="keywordflow">return</span> absl::StrCat(<span class="stringliteral">"[I] #"</span>, n.value());</div>
|
|
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  }</div>
|
|
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  <span class="keyword">const</span> std::string type =</div>
|
|
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  !<a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ba793d57999d40090be769a97c6ac59">NodeIsMatched</a>(n)</div>
|
|
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  ? <span class="stringliteral">"[*]"</span></div>
|
|
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  : node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26">type</a> == 1 ? <span class="stringliteral">"[+]"</span> : node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26">type</a> == -1 ? <span class="stringliteral">"[-]"</span> : <span class="stringliteral">"[0]"</span>;</div>
|
|
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  <span class="keywordflow">return</span> absl::StrCat(</div>
|
|
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  type, <span class="stringliteral">" #"</span>, n.value(), <span class="stringliteral">" dual: "</span>, <a class="code" href="classoperations__research_1_1_blossom_graph.html#a7cc8e3de83d28065411068cf09b7992e">Dual</a>(node).<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>(),</div>
|
|
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  <span class="stringliteral">" parent: "</span>, node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a768efacafc19717a4d6f28a2f9f41ae3">parent</a>.value(), <span class="stringliteral">" match: "</span>, node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0c5e020f1174f613f0fe58d93e9cefa1">match</a>.value(),</div>
|
|
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  <span class="stringliteral">" blossom: ["</span>, absl::StrJoin(node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a60c314ee4437d32edbfb3a178b41b433">blossom</a>, <span class="stringliteral">", "</span>, absl::StreamFormatter()),</div>
|
|
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  <span class="stringliteral">"]"</span>);</div>
|
|
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span> }</div>
|
|
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  </div>
|
|
<div class="line"><a name="l01193"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a67cea30280176172db379ad925f2e6ca"> 1193</a></span> std::string <a class="code" href="classoperations__research_1_1_blossom_graph.html#a67cea30280176172db379ad925f2e6ca">BlossomGraph::EdgeDebugString</a>(EdgeIndex e)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& edge = edges_[e];</div>
|
|
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  <span class="keywordflow">if</span> (nodes_[Tail(edge)].is_internal || nodes_[Head(edge)].is_internal) {</div>
|
|
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  <span class="keywordflow">return</span> absl::StrCat(Tail(edge).<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>(), <span class="stringliteral">"<->"</span>, Head(edge).<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>(),</div>
|
|
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  <span class="stringliteral">" internal "</span>);</div>
|
|
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  }</div>
|
|
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  <span class="keywordflow">return</span> absl::StrCat(Tail(edge).<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>(), <span class="stringliteral">"<->"</span>, Head(edge).<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>(),</div>
|
|
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  <span class="stringliteral">" slack: "</span>, <a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ec09b02b175052c5546eda76464accd">Slack</a>(edge).<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>());</div>
|
|
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span> }</div>
|
|
<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  </div>
|
|
<div class="line"><a name="l01203"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a764be64f3029f8b8e23511061d8de355"> 1203</a></span> std::string <a class="code" href="classoperations__research_1_1_blossom_graph.html#a764be64f3029f8b8e23511061d8de355">BlossomGraph::DebugString</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  std::string result = <span class="stringliteral">"Graph:\n"</span>;</div>
|
|
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n(0); n < nodes_.size(); ++n) {</div>
|
|
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  absl::StrAppend(&result, <a class="code" href="classoperations__research_1_1_blossom_graph.html#a641610cf698af15f1f8e24741c1fd572">NodeDebugString</a>(n), <span class="stringliteral">"\n"</span>);</div>
|
|
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  }</div>
|
|
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  <span class="keywordflow">for</span> (EdgeIndex e(0); e < edges_.size(); ++e) {</div>
|
|
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  absl::StrAppend(&result, <a class="code" href="classoperations__research_1_1_blossom_graph.html#a67cea30280176172db379ad925f2e6ca">EdgeDebugString</a>(e), <span class="stringliteral">"\n"</span>);</div>
|
|
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  }</div>
|
|
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span> }</div>
|
|
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  </div>
|
|
<div class="line"><a name="l01214"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#ad7e519048b150893f06581b7f270c118"> 1214</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_blossom_graph.html#ad7e519048b150893f06581b7f270c118">BlossomGraph::DebugUpdateNodeDual</a>(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n, <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>) {</div>
|
|
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span> <span class="preprocessor">#ifndef NDEBUG</span></div>
|
|
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  nodes_[n].dual += <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>;</div>
|
|
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> subnode : SubNodes(n)) {</div>
|
|
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> EdgeIndex e : graph_[subnode]) {</div>
|
|
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& edge = edges_[e];</div>
|
|
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> other_end = OtherEnd(edge, subnode);</div>
|
|
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  <span class="keywordflow">if</span> (other_end == n) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  edges_[e].slack -= <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>;</div>
|
|
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  }</div>
|
|
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  }</div>
|
|
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span> }</div>
|
|
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  </div>
|
|
<div class="line"><a name="l01228"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a5ec09b02b175052c5546eda76464accd"> 1228</a></span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code" href="classoperations__research_1_1_blossom_graph.html#a5ec09b02b175052c5546eda76464accd">BlossomGraph::Slack</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& edge)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& tail_node = nodes_[Tail(edge)];</div>
|
|
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& head_node = nodes_[Head(edge)];</div>
|
|
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> slack = edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a>;</div>
|
|
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  <span class="keywordflow">if</span> (Tail(edge) == Head(edge)) <span class="keywordflow">return</span> slack; <span class="comment">// Internal...</span></div>
|
|
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  </div>
|
|
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  <span class="keywordflow">if</span> (!tail_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aab699e604962539cc9305c4e496032a5">is_internal</a> && !head_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aab699e604962539cc9305c4e496032a5">is_internal</a>) {</div>
|
|
<div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  slack -= tail_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26">type</a> * nodes_[tail_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2">root</a>].tree_dual_delta +</div>
|
|
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  head_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26">type</a> * nodes_[head_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2">root</a>].tree_dual_delta;</div>
|
|
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  }</div>
|
|
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span> <span class="preprocessor">#ifndef NDEBUG</span></div>
|
|
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  DCHECK_EQ(slack, edge.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a015731c5f4abd13de18e78c4e4bb35ce">slack</a>) << tail_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26">type</a> << <span class="stringliteral">" "</span> << head_node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26">type</a></div>
|
|
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  << <span class="stringliteral">" "</span> << Tail(edge) << <span class="stringliteral">"<->"</span> << Head(edge);</div>
|
|
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  <span class="keywordflow">return</span> slack;</div>
|
|
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span> }</div>
|
|
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  </div>
|
|
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span> <span class="comment">// Returns the dual value of the given node (which might be a pseudo-node).</span></div>
|
|
<div class="line"><a name="l01246"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a7cc8e3de83d28065411068cf09b7992e"> 1246</a></span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code" href="classoperations__research_1_1_blossom_graph.html#a7cc8e3de83d28065411068cf09b7992e">BlossomGraph::Dual</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> dual =</div>
|
|
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae51446839a3bac95fbd94fb2cb34f810">pseudo_dual</a> + node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26">type</a> * nodes_[node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2">root</a>].tree_dual_delta;</div>
|
|
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span> <span class="preprocessor">#ifndef NDEBUG</span></div>
|
|
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  DCHECK_EQ(dual, node.<a class="code" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aaac09b61c2e9f87b7b2234836d5a950a">dual</a>);</div>
|
|
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  <span class="keywordflow">return</span> dual;</div>
|
|
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span> }</div>
|
|
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  </div>
|
|
<div class="line"><a name="l01255"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a302c5cc32e01ba375848a3f32d82c431"> 1255</a></span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code" href="classoperations__research_1_1_blossom_graph.html#a302c5cc32e01ba375848a3f32d82c431">BlossomGraph::DualObjective</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  <span class="keywordflow">if</span> (dual_objective_ == <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a>(<a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>);</div>
|
|
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  CHECK_EQ(dual_objective_ % 2, 0);</div>
|
|
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  <span class="keywordflow">return</span> dual_objective_ / 2;</div>
|
|
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span> }</div>
|
|
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  </div>
|
|
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span> <span class="keywordtype">void</span> BlossomGraph::AddToDualObjective(<a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>) {</div>
|
|
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  CHECK_GE(<a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>, 0);</div>
|
|
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  dual_objective_ = <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a>(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(dual_objective_.value(), <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>.value()));</div>
|
|
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span> }</div>
|
|
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  </div>
|
|
<div class="line"><a name="l01266"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#ad74099ecb3f19aea3065345aeb146333"> 1266</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_blossom_graph.html#ad74099ecb3f19aea3065345aeb146333">BlossomGraph::DisplayStats</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  VLOG(1) << <span class="stringliteral">"num_grows: "</span> << num_grows_;</div>
|
|
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  VLOG(1) << <span class="stringliteral">"num_augments: "</span> << num_augments_;</div>
|
|
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  VLOG(1) << <span class="stringliteral">"num_shrinks: "</span> << num_shrinks_;</div>
|
|
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  VLOG(1) << <span class="stringliteral">"num_expands: "</span> << num_expands_;</div>
|
|
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  VLOG(1) << <span class="stringliteral">"num_dual_updates: "</span> << num_dual_updates_;</div>
|
|
<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span> }</div>
|
|
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  </div>
|
|
<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span> } <span class="comment">// namespace operations_research</span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<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="astructoperations__research_1_1_blossom_graph_1_1_node_html_a773c851657cfc5a2dbc0fb25958e668a"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html#a773c851657cfc5a2dbc0fb25958e668a">operations_research::BlossomGraph::Node::saved_pseudo_dual</a></div><div class="ttdeci">CostValue saved_pseudo_dual</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00252">perfect_matching.h:252</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_perfect_matching_html_a00a07ecd49cf20c2806ebbcd1f5dcbb1"><div class="ttname"><a href="classoperations__research_1_1_min_cost_perfect_matching.html#a00a07ecd49cf20c2806ebbcd1f5dcbb1">operations_research::MinCostPerfectMatching::Solve</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT Status Solve()</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00039">perfect_matching.cc:39</a></div></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="aclassoperations__research_1_1_blossom_graph_html_a5ec09b02b175052c5546eda76464accd"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a5ec09b02b175052c5546eda76464accd">operations_research::BlossomGraph::Slack</a></div><div class="ttdeci">CostValue Slack(const Edge &edge) const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l01228">perfect_matching.cc:1228</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a641610cf698af15f1f8e24741c1fd572"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a641610cf698af15f1f8e24741c1fd572">operations_research::BlossomGraph::NodeDebugString</a></div><div class="ttdeci">std::string NodeDebugString(NodeIndex n) const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l01177">perfect_matching.cc:1177</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_node_html_af7b352e9f09d2400d7686572bec02ef1"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html#af7b352e9f09d2400d7686572bec02ef1">operations_research::BlossomGraph::Node::IsMinus</a></div><div class="ttdeci">bool IsMinus() const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00195">perfect_matching.h:195</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="aclassoperations__research_1_1_blossom_graph_html_a6f810c6acdae2d7caa9ca2f8cbf35ce5"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a6f810c6acdae2d7caa9ca2f8cbf35ce5">operations_research::BlossomGraph::DebugCheckNoPossiblePrimalUpdates</a></div><div class="ttdeci">void DebugCheckNoPossiblePrimalUpdates()</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00347">perfect_matching.cc:347</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="astructoperations__research_1_1_blossom_graph_1_1_edge_html_ad9e501cd6bde03f8ed86ebac02b043c9"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ad9e501cd6bde03f8ed86ebac02b043c9">operations_research::BlossomGraph::Edge::OtherEnd</a></div><div class="ttdeci">NodeIndex OtherEnd(NodeIndex n) const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00268">perfect_matching.h:268</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_node_html_a0d7fbff09819deb796dfbcb6370b12b2"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0d7fbff09819deb796dfbcb6370b12b2">operations_research::BlossomGraph::Node::IsBlossom</a></div><div class="ttdeci">bool IsBlossom() const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00200">perfect_matching.h:200</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a67cea30280176172db379ad925f2e6ca"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a67cea30280176172db379ad925f2e6ca">operations_research::BlossomGraph::EdgeDebugString</a></div><div class="ttdeci">std::string EdgeDebugString(EdgeIndex e) const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l01193">perfect_matching.cc:1193</a></div></div>
|
|
<div class="ttc" id="aclassgtl_1_1_i_t_i_vector_html_a9263000d449fdccb6cb70b303063e60b"><div class="ttname"><a href="classgtl_1_1_i_t_i_vector.html#a9263000d449fdccb6cb70b303063e60b">gtl::ITIVector::push_back</a></div><div class="ttdeci">void push_back(const value_type &x)</div><div class="ttdef"><b>Definition:</b> <a href="int__type__indexed__vector_8h_source.html#l00157">int_type_indexed_vector.h:157</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_ad7e519048b150893f06581b7f270c118"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#ad7e519048b150893f06581b7f270c118">operations_research::BlossomGraph::DebugUpdateNodeDual</a></div><div class="ttdeci">void DebugUpdateNodeDual(NodeIndex n, CostValue delta)</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l01214">perfect_matching.cc:1214</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a21edc7ca4cc5802c8779d68556bc09cf"><div class="ttname"><a href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a></div><div class="ttdeci">int64 value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_node_html_aa5998e93c946a8c5ec1626dee2915555"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html#aa5998e93c946a8c5ec1626dee2915555">operations_research::BlossomGraph::Node::saved_blossom</a></div><div class="ttdeci">std::vector< NodeIndex > saved_blossom</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00253">perfect_matching.h:253</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_ae0848b03565c382ae68dca458899dc58"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#ae0848b03565c382ae68dca458899dc58">operations_research::BlossomGraph::BlossomGraph</a></div><div class="ttdeci">BlossomGraph(int num_nodes)</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00116">perfect_matching.cc:116</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_node_html_a768efacafc19717a4d6f28a2f9f41ae3"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html#a768efacafc19717a4d6f28a2f9f41ae3">operations_research::BlossomGraph::Node::parent</a></div><div class="ttdeci">NodeIndex parent</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00214">perfect_matching.h:214</a></div></div>
|
|
<div class="ttc" id="asaturated__arithmetic_8h_html"><div class="ttname"><a href="saturated__arithmetic_8h.html">saturated_arithmetic.h</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="aclassoperations__research_1_1_blossom_graph_html_abf9aa973816e638a2b972b595d952c0e"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#abf9aa973816e638a2b972b595d952c0e">operations_research::BlossomGraph::Expand</a></div><div class="ttdeci">void Expand(NodeIndex to_expand)</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00845">perfect_matching.cc:845</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_acdf1d4050349cf4a87c08498eaa2d1e9"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#acdf1d4050349cf4a87c08498eaa2d1e9">operations_research::BlossomGraph::UpdateAllTrees</a></div><div class="ttdeci">void UpdateAllTrees(CostValue delta)</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00309">perfect_matching.cc:309</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_node_html_ac765329451135abec74c45e1897abf26"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26">operations_research::BlossomGraph::Node::type</a></div><div class="ttdeci">int type</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00207">perfect_matching.h:207</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_edge_html"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_edge.html">operations_research::BlossomGraph::Edge</a></div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00257">perfect_matching.h:257</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a"><div class="ttname"><a href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a></div><div class="ttdeci">int64_t int64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00034">integral_types.h:34</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a3a2cd7bcc756090a5e1a7bcdfa530a1b"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a3a2cd7bcc756090a5e1a7bcdfa530a1b">operations_research::BlossomGraph::ComputeMaxCommonTreeDualDeltaAndResetPrimalEdgeQueue</a></div><div class="ttdeci">CostValue ComputeMaxCommonTreeDualDeltaAndResetPrimalEdgeQueue()</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00259">perfect_matching.cc:259</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_perfect_matching_html_a50eca19efa71a0b70de25f9ad4a2a6f8"><div class="ttname"><a href="classoperations__research_1_1_min_cost_perfect_matching.html#a50eca19efa71a0b70de25f9ad4a2a6f8">operations_research::MinCostPerfectMatching::Reset</a></div><div class="ttdeci">void Reset(int num_nodes)</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00021">perfect_matching.cc:21</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a0a45bd01bdb08f462f19cf483b88a6d1"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a0a45bd01bdb08f462f19cf483b88a6d1">operations_research::BlossomGraph::PrimalUpdates</a></div><div class="ttdeci">void PrimalUpdates()</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00381">perfect_matching.cc:381</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00508">pack.cc:508</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a41347b63abb9f92b02b1705cdae50cad"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a41347b63abb9f92b02b1705cdae50cad">operations_research::BlossomGraph::DebugEdgeIsTightAndExternal</a></div><div class="ttdeci">bool DebugEdgeIsTightAndExternal(const Edge &edge) const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00463">perfect_matching.cc:463</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_node_html_a0c5e020f1174f613f0fe58d93e9cefa1"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0c5e020f1174f613f0fe58d93e9cefa1">operations_research::BlossomGraph::Node::match</a></div><div class="ttdeci">NodeIndex match</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00218">perfect_matching.h:218</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_node_html_aaac09b61c2e9f87b7b2234836d5a950a"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html#aaac09b61c2e9f87b7b2234836d5a950a">operations_research::BlossomGraph::Node::dual</a></div><div class="ttdeci">CostValue dual</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00235">perfect_matching.h:235</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a26a8cbbc7bcf4117c2bf65104b4a54b4"><div class="ttname"><a href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a></div><div class="ttdeci">int64 cost</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00130">routing_flow.cc:130</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_node_html_ae51446839a3bac95fbd94fb2cb34f810"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae51446839a3bac95fbd94fb2cb34f810">operations_research::BlossomGraph::Node::pseudo_dual</a></div><div class="ttdeci">CostValue pseudo_dual</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00231">perfect_matching.h:231</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html_a7f536a3b33f9bed8f75734e035d30725"><div class="ttname"><a href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a></div><div class="ttdeci">const bool DEBUG_MODE</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00024">macros.h:24</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_perfect_matching_html_a8bb9437d95e0d96bf090e0d935545733"><div class="ttname"><a href="classoperations__research_1_1_min_cost_perfect_matching.html#a8bb9437d95e0d96bf090e0d935545733">operations_research::MinCostPerfectMatching::AddEdgeWithCost</a></div><div class="ttdeci">void AddEdgeWithCost(int tail, int head, int64 cost)</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00027">perfect_matching.cc:27</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aedc4ddb96acc28481c09828d2e016815a2884fa43446c0cbc9c7a9b74d41d7483"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2884fa43446c0cbc9c7a9b74d41d7483">operations_research::sat::INFEASIBLE</a></div><div class="ttdeci">@ INFEASIBLE</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l00231">cp_model.pb.h:231</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_node_html"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html">operations_research::BlossomGraph::Node</a></div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00181">perfect_matching.h:181</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_node_html_a48a8004385fae256a9c93d353016bea1"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html#a48a8004385fae256a9c93d353016bea1">operations_research::BlossomGraph::Node::IsFree</a></div><div class="ttdeci">bool IsFree() const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00193">perfect_matching.h:193</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_aacc1343585a38bfaa42702e635552837"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#aacc1343585a38bfaa42702e635552837">operations_research::BlossomGraph::Shrink</a></div><div class="ttdeci">void Shrink(EdgeIndex e)</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00650">perfect_matching.cc:650</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_perfect_matching_html_a67a0db04d321a74b7e7fcfd3f1a3f70b"><div class="ttname"><a href="classoperations__research_1_1_min_cost_perfect_matching.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">operations_research::MinCostPerfectMatching::Status</a></div><div class="ttdeci">Status</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00081">perfect_matching.h:81</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a99264812cf177270e521f226a5c012c3"><div class="ttname"><a href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">operations_research::CapAdd</a></div><div class="ttdeci">int64 CapAdd(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00124">saturated_arithmetic.h:124</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aee97ac67f280d35acdef2c5d461a85c3"><div class="ttname"><a href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">operations_research::CostValue</a></div><div class="ttdeci">int64 CostValue</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00203">ebert_graph.h:203</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_ad0050e8e5a05f9fb9add3a7ccfd96cf2"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#ad0050e8e5a05f9fb9add3a7ccfd96cf2">operations_research::BlossomGraph::ExpandAllBlossoms</a></div><div class="ttdeci">void ExpandAllBlossoms()</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l01054">perfect_matching.cc:1054</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a302c5cc32e01ba375848a3f32d82c431"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a302c5cc32e01ba375848a3f32d82c431">operations_research::BlossomGraph::DualObjective</a></div><div class="ttdeci">CostValue DualObjective() const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l01255">perfect_matching.cc:1255</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a8a0d1ac19aba17d0f2d52d15a049dc2c"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a8a0d1ac19aba17d0f2d52d15a049dc2c">operations_research::BlossomGraph::kNoEdgeIndex</a></div><div class="ttdeci">static const EdgeIndex kNoEdgeIndex</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00176">perfect_matching.h:176</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a248c764067ee60c03ee370784c49f353"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a248c764067ee60c03ee370784c49f353">operations_research::BlossomGraph::Initialize</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool Initialize()</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00143">perfect_matching.cc:143</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_edge_html_a015731c5f4abd13de18e78c4e4bb35ce"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a015731c5f4abd13de18e78c4e4bb35ce">operations_research::BlossomGraph::Edge::slack</a></div><div class="ttdeci">CostValue slack</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00286">perfect_matching.h:286</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#l00232">cp_model.pb.h:232</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a10faf3cb1acc845ce59c867bd9753155"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a10faf3cb1acc845ce59c867bd9753155">operations_research::BlossomGraph::DebugDualsAreFeasible</a></div><div class="ttdeci">bool DebugDualsAreFeasible() const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00450">perfect_matching.cc:450</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_node_html_a90f9ea0f563c8c66d404c8af98634be2"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2">operations_research::BlossomGraph::Node::root</a></div><div class="ttdeci">NodeIndex root</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00222">perfect_matching.h:222</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_edge_html_a91f6a7d52fa6d6f96cdf7755641e0055"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a91f6a7d52fa6d6f96cdf7755641e0055">operations_research::BlossomGraph::Edge::head</a></div><div class="ttdeci">NodeIndex head</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00295">perfect_matching.h:295</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_edge_html_ac999b32b9bba996b3abca3c5fe9f81d8"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">operations_research::BlossomGraph::Edge::pseudo_slack</a></div><div class="ttdeci">CostValue pseudo_slack</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00282">perfect_matching.h:282</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_node_html_a8cf7b66e4c76384f3d1d1f9a4ee8ae02"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html#a8cf7b66e4c76384f3d1d1f9a4ee8ae02">operations_research::BlossomGraph::Node::IsPlus</a></div><div class="ttdeci">bool IsPlus() const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00194">perfect_matching.h:194</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a498ac6ce9ab7d52b1ff1dd3fefc1a5b7"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a498ac6ce9ab7d52b1ff1dd3fefc1a5b7">operations_research::BlossomGraph::Match</a></div><div class="ttdeci">NodeIndex Match(NodeIndex n) const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00336">perfect_matching.cc:336</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a764be64f3029f8b8e23511061d8de355">operations_research::BlossomGraph::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l01203">perfect_matching.cc:1203</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a58f432346ba2007a0c0a62ad8789b048"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a58f432346ba2007a0c0a62ad8789b048">operations_research::BlossomGraph::AddEdge</a></div><div class="ttdeci">void AddEdge(NodeIndex tail, NodeIndex head, CostValue cost)</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00126">perfect_matching.cc:126</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a47f3bfcd0d135ae701956a1fa56b141a"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a47f3bfcd0d135ae701956a1fa56b141a">operations_research::BlossomGraph::kMaxCostValue</a></div><div class="ttdeci">static const CostValue kMaxCostValue</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00177">perfect_matching.h:177</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a77239a64984b6868f08721b84d7c08a1"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a77239a64984b6868f08721b84d7c08a1">operations_research::BlossomGraph::Augment</a></div><div class="ttdeci">void Augment(EdgeIndex e)</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00547">perfect_matching.cc:547</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="aclassgtl_1_1_i_t_i_vector_html_a4e3670a285a3642eaa07f66766cffa72"><div class="ttname"><a href="classgtl_1_1_i_t_i_vector.html#a4e3670a285a3642eaa07f66766cffa72">gtl::ITIVector::resize</a></div><div class="ttdeci">void resize(size_type new_size)</div><div class="ttdef"><b>Definition:</b> <a href="int__type__indexed__vector_8h_source.html#l00149">int_type_indexed_vector.h:149</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_node_html_a6bd5709ed0198c891c1d312e700c083b"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html#a6bd5709ed0198c891c1d312e700c083b">operations_research::BlossomGraph::Node::IsInternal</a></div><div class="ttdeci">bool IsInternal() const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00189">perfect_matching.h:189</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a5ba793d57999d40090be769a97c6ac59"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a5ba793d57999d40090be769a97c6ac59">operations_research::BlossomGraph::NodeIsMatched</a></div><div class="ttdeci">bool NodeIsMatched(NodeIndex n) const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00329">perfect_matching.cc:329</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a7cc8e3de83d28065411068cf09b7992e"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a7cc8e3de83d28065411068cf09b7992e">operations_research::BlossomGraph::Dual</a></div><div class="ttdeci">CostValue Dual(const Node &node) const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l01246">perfect_matching.cc:1246</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="aclassoperations__research_1_1_blossom_graph_html_a39b5c65490728705cd4471c549ff1d95"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a39b5c65490728705cd4471c549ff1d95">operations_research::BlossomGraph::Grow</a></div><div class="ttdeci">void Grow(EdgeIndex e, NodeIndex tail, NodeIndex head)</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00470">perfect_matching.cc:470</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_aa58388f09616752263b1fac85c35e432"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#aa58388f09616752263b1fac85c35e432">operations_research::BlossomGraph::kNoNodeIndex</a></div><div class="ttdeci">static const NodeIndex kNoNodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00175">perfect_matching.h:175</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_edge_html_ac244bdf901af2bc171478cbcfa09266e"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac244bdf901af2bc171478cbcfa09266e">operations_research::BlossomGraph::Edge::tail</a></div><div class="ttdeci">NodeIndex tail</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00294">perfect_matching.h:294</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_node_html_ae812ee39507ef5bd0cb6b58605c7803d"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae812ee39507ef5bd0cb6b58605c7803d">operations_research::BlossomGraph::Node::saved_dual</a></div><div class="ttdeci">CostValue saved_dual</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00250">perfect_matching.h:250</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_ad74099ecb3f19aea3065345aeb146333"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#ad74099ecb3f19aea3065345aeb146333">operations_research::BlossomGraph::DisplayStats</a></div><div class="ttdeci">void DisplayStats() const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l01266">perfect_matching.cc:1266</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a74ea76ea27f48fb1b6e148e1577b3719"><div class="ttname"><a href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a></div><div class="ttdeci">static const int64 kint64max</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00062">integral_types.h:62</a></div></div>
|
|
<div class="ttc" id="aperfect__matching_8h_html"><div class="ttname"><a href="perfect__matching_8h.html">perfect_matching.h</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_node_html_a60c314ee4437d32edbfb3a178b41b433"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html#a60c314ee4437d32edbfb3a178b41b433">operations_research::BlossomGraph::Node::blossom</a></div><div class="ttdeci">std::vector< NodeIndex > blossom</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00241">perfect_matching.h:241</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_node_html_aab699e604962539cc9305c4e496032a5"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html#aab699e604962539cc9305c4e496032a5">operations_research::BlossomGraph::Node::is_internal</a></div><div class="ttdeci">bool is_internal</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00210">perfect_matching.h:210</a></div></div>
|
|
<!-- 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="perfect__matching_8cc.html">perfect_matching.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.8.20 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|