703 lines
149 KiB
HTML
703 lines
149 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.3"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: perfect_matching.h 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">9.3</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.3 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('perfect__matching_8h_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.h</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="perfect__matching_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" 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 id="l00003" 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 id="l00004" 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 id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" 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 id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" 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 id="l00009" 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 id="l00010" 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 id="l00011" 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 id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="comment">// Implementation of the Blossom V min-cost perfect matching algorithm. The</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="comment">// main source for the algo is the paper: "Blossom V: A new implementation</span></div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="comment">// of a minimum cost perfect matching algorithm", Vladimir Kolmogorov.</span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="comment">// The Algorithm is a primal-dual algorithm. It always maintains a dual-feasible</span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="comment">// solution. We recall some notations here, but see the paper for more details</span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="comment">// as it is well written.</span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="comment">// TODO(user): This is a work in progress. The algo is not fully implemented</span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="comment">// yet. The initial version is closer to Blossom IV since we update the dual</span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="comment">// values for all trees at once with the same delta.</span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span> </div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#ifndef OR_TOOLS_GRAPH_PERFECT_MATCHING_H_</span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#define OR_TOOLS_GRAPH_PERFECT_MATCHING_H_</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span> </div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> </div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="preprocessor">#include "absl/base/attributes.h"</span></div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="preprocessor">#include "absl/strings/str_cat.h"</span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="preprocessor">#include "absl/strings/str_join.h"</span></div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="preprocessor">#include "<a class="code" href="adjustable__priority__queue-inl_8h.html">ortools/base/adjustable_priority_queue-inl.h</a>"</span></div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="preprocessor">#include "<a class="code" href="adjustable__priority__queue_8h.html">ortools/base/adjustable_priority_queue.h</a>"</span></div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="preprocessor">#include "<a class="code" href="macros_8h.html">ortools/base/macros.h</a>"</span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="preprocessor">#include "<a class="code" href="strong__int_8h.html">ortools/base/strong_int.h</a>"</span></div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="preprocessor">#include "<a class="code" href="strong__vector_8h.html">ortools/base/strong_vector.h</a>"</span></div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> </div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> </div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span><span class="keyword">class </span>BlossomGraph;</div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> </div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span><span class="comment">// Given an undirected graph with costs on each edges, this class allows to</span></div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span><span class="comment">// compute a perfect matching with minimum cost. A matching is a set of disjoint</span></div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span><span class="comment">// pairs of nodes connected by an edge. The matching is perfect if all nodes are</span></div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span><span class="comment">// matched to each others.</span></div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_min_cost_perfect_matching.html"> 52</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_min_cost_perfect_matching.html">MinCostPerfectMatching</a> {</div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// TODO(user): For now we ask the number of nodes at construction, but we</span></div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="comment">// could automatically infer it from the added edges if needed.</span></div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_min_cost_perfect_matching.html#a9a737ec352e2ec27de0ddafdec837be6"> 56</a></span> <a class="code hl_function" href="classoperations__research_1_1_min_cost_perfect_matching.html#a9a737ec352e2ec27de0ddafdec837be6">MinCostPerfectMatching</a>() {}</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_min_cost_perfect_matching.html#ac18e06d91adf077dc719d138605475eb"> 57</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="classoperations__research_1_1_min_cost_perfect_matching.html#ac18e06d91adf077dc719d138605475eb">MinCostPerfectMatching</a>(<span class="keywordtype">int</span> num_nodes) { <a class="code hl_function" href="classoperations__research_1_1_min_cost_perfect_matching.html#a50eca19efa71a0b70de25f9ad4a2a6f8">Reset</a>(num_nodes); }</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> </div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="comment">// Resets the class for a new graph.</span></div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// TODO(user): Eventually, we may support incremental Solves(). Or at least</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// memory reuse if one wants to solve many problems in a row.</span></div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_min_cost_perfect_matching.html#a50eca19efa71a0b70de25f9ad4a2a6f8">Reset</a>(<span class="keywordtype">int</span> num_nodes);</div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> </div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="comment">// Adds an undirected edges between the two given nodes.</span></div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="comment">// For now we only accept non-negative cost.</span></div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="comment">// TODO(user): We can easily shift all costs if negative costs are needed.</span></div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="comment">// Important: The algorithm supports multi-edges, but it will be slower. So it</span></div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="comment">// is better to only add one edge with a minimum cost between two nodes. In</span></div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// particular, do not add both AddEdge(a, b, cost) and AddEdge(b, a, cost).</span></div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="comment">// TODO(user): We could just presolve them away.</span></div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_min_cost_perfect_matching.html#a132e58de7ebb46a1ba677b77f6e60907">AddEdgeWithCost</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a>, <span class="keywordtype">int</span> <a class="code hl_variable" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a>, int64_t <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>);</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> </div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="comment">// Solves the min-cost perfect matching problem on the given graph.</span></div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="comment">// NOTE(user): If needed we could support a time limit. Aborting early will</span></div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="comment">// not provide a perfect matching, but the algorithm does maintain a valid</span></div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="comment">// lower bound on the optimal cost that gets better and better during</span></div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="comment">// execution until it reaches the optimal value. Similarly, it is easy to</span></div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// support an early stop if this bound crosses a preset threshold.</span></div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_min_cost_perfect_matching.html#a67a0db04d321a74b7e7fcfd3f1a3f70b"> 83</a></span> <span class="keyword">enum</span> <a class="code hl_enumeration" href="classoperations__research_1_1_min_cost_perfect_matching.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">Status</a> {</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="comment">// A perfect matching with min-cost has been found.</span></div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_min_cost_perfect_matching.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad"> 85</a></span> <a class="code hl_enumvalue" href="classoperations__research_1_1_min_cost_perfect_matching.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad">OPTIMAL</a> = 0,</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> </div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="comment">// There is no perfect matching in this graph.</span></div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_min_cost_perfect_matching.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483"> 88</a></span> <a class="code hl_enumvalue" href="classoperations__research_1_1_min_cost_perfect_matching.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">INFEASIBLE</a> = 1,</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> </div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="comment">// The costs are too large and caused an overflow during the algorithm</span></div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="comment">// execution.</span></div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_min_cost_perfect_matching.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba90da5a203bf180f1d4f9172502a90197"> 92</a></span> <a class="code hl_enumvalue" href="classoperations__research_1_1_min_cost_perfect_matching.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba90da5a203bf180f1d4f9172502a90197">INTEGER_OVERFLOW</a> = 2,</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> </div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="comment">// Advanced usage: the matching is OPTIMAL and was computed without</span></div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="comment">// overflow, but its OptimalCost() does not fit on an int64_t. Note that</span></div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// Match() still work and you can re-compute the cost in double for</span></div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// instance.</span></div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_min_cost_perfect_matching.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba170e5ad124faa3551e4cad0020ddc383"> 98</a></span> <a class="code hl_enumvalue" href="classoperations__research_1_1_min_cost_perfect_matching.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba170e5ad124faa3551e4cad0020ddc383">COST_OVERFLOW</a> = 3,</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> };</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> ABSL_MUST_USE_RESULT <a class="code hl_enumeration" href="classoperations__research_1_1_min_cost_perfect_matching.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">Status</a> <a class="code hl_function" href="classoperations__research_1_1_min_cost_perfect_matching.html#a00a07ecd49cf20c2806ebbcd1f5dcbb1">Solve</a>();</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> </div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="comment">// Returns the cost of the perfect matching. Only valid when the last solve</span></div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// status was OPTIMAL.</span></div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_min_cost_perfect_matching.html#ae840999972ebda3637f5299a2ead7f08"> 104</a></span> int64_t <a class="code hl_function" href="classoperations__research_1_1_min_cost_perfect_matching.html#ae840999972ebda3637f5299a2ead7f08">OptimalCost</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(optimal_solution_found_);</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="keywordflow">return</span> optimal_cost_;</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> }</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> </div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// Returns the node matched to the given node. In a perfect matching all nodes</span></div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="comment">// have a match. Only valid when the last solve status was OPTIMAL.</span></div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_min_cost_perfect_matching.html#a14613ae615a2f7b740548dee2f3924fe"> 111</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_min_cost_perfect_matching.html#a14613ae615a2f7b740548dee2f3924fe">Match</a>(<span class="keywordtype">int</span> node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(optimal_solution_found_);</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="keywordflow">return</span> matches_[node];</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> }</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_min_cost_perfect_matching.html#a7b08631db7352215798c8340d3258bc7"> 115</a></span> <span class="keyword">const</span> std::vector<int>& <a class="code hl_function" href="classoperations__research_1_1_min_cost_perfect_matching.html#a7b08631db7352215798c8340d3258bc7">Matches</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(optimal_solution_found_);</div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keywordflow">return</span> matches_;</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> }</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> </div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> std::unique_ptr<BlossomGraph> graph_;</div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> </div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="comment">// Fields used to report the optimal solution. Most of it could be read on</span></div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="comment">// the fly from BlossomGraph, but we prefer to copy them here. This allows to</span></div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="comment">// reclaim the memory of graph_ early or allows to still query the last</span></div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="comment">// solution if we later allow re-solve with incremental changes to the graph.</span></div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="keywordtype">bool</span> optimal_solution_found_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> int64_t optimal_cost_ = 0;</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> int64_t maximum_edge_cost_ = 0;</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> std::vector<int> matches_;</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span>};</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> </div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span><span class="comment">// Class containing the main data structure used by the Blossom algorithm.</span></div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span><span class="comment">// At the core is the original undirected graph. During the algorithm execution</span></div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span><span class="comment">// we might collapse nodes into so-called Blossoms. A Blossom is a cycle of</span></div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span><span class="comment">// external nodes (which can be blossom nodes) of odd length (>= 3). The edges</span></div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span><span class="comment">// of the cycle are called blossom-forming eges and will always be tight</span></div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span><span class="comment">// (i.e. have a slack of zero). Once a Blossom is created, its nodes become</span></div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span><span class="comment">// "internal" and are basically considered merged into the blossom node for the</span></div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span><span class="comment">// rest of the algorithm (except if we later re-expand the blossom).</span></div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span><span class="comment">// Moreover, external nodes of the graph will have 3 possible types ([+], [-]</span></div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span><span class="comment">// and free [0]). Free nodes will always be matched together in pairs. Nodes of</span></div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span><span class="comment">// type [+] and [-] are arranged in a forest of alternating [+]/[-] disjoint</span></div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span><span class="comment">// trees. Each unmatched node is the root of a tree, and of type [+]. Nodes [-]</span></div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span><span class="comment">// will always have exactly one child to witch they are matched. [+] nodes can</span></div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span><span class="comment">// have any number of [-] children, to which they are not matched. All the edges</span></div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span><span class="comment">// of the trees will always be tight. Some examples below, double edges are used</span></div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span><span class="comment">// for matched nodes:</span></div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span><span class="comment">// A matched pair of free nodes: [0] === [0]</span></div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span><span class="comment">// A possible rooted tree: [+] -- [-] ==== [+]</span></div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span><span class="comment">// \</span></div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span><span class="comment">// [-] ==== [+] ---- [-] === [+]</span></div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span><span class="comment">// \</span></div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span><span class="comment">// [-] === [+]</span></div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span><span class="comment">// A single unmatched node is also a tree: [+]</span></div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span><span class="comment">// TODO(user): For now this class does not maintain a second graph of edges</span></div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span><span class="comment">// between the trees nor does it maintains priority queue of edges.</span></div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span><span class="comment">// TODO(user): For now we use CHECKs in many places to facilitate development.</span></div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span><span class="comment">// Switch them to DCHECKs for speed once the code is more stable.</span></div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html"> 167</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_blossom_graph.html">BlossomGraph</a> {</div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="comment">// Typed index used by this class.</span></div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a7b7d0779f5d5443c8467f8a7f6555aba"> 170</a></span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a7b7d0779f5d5443c8467f8a7f6555aba">DEFINE_STRONG_INT_TYPE</a>(<a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a>, <span class="keywordtype">int</span>);</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#accda7b48cb8febe4aa8a7c8ddadd5dc8"> 171</a></span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#accda7b48cb8febe4aa8a7c8ddadd5dc8">DEFINE_STRONG_INT_TYPE</a>(EdgeIndex, <span class="keywordtype">int</span>);</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a1cfbd5eadb491e5dabdd78aaaae17c49"> 172</a></span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a1cfbd5eadb491e5dabdd78aaaae17c49">DEFINE_STRONG_INT_TYPE</a>(<a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a>, int64_t);</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> </div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="comment">// Basic constants.</span></div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="comment">// NOTE(user): Those can't be constexpr because of the or-tools export,</span></div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="comment">// which complains for constexpr DEFINE_STRONG_INT_TYPE.</span></div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#aa58388f09616752263b1fac85c35e432"> 177</a></span> <span class="keyword">static</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code hl_variable" href="classoperations__research_1_1_blossom_graph.html#aa58388f09616752263b1fac85c35e432">kNoNodeIndex</a>;</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a8a0d1ac19aba17d0f2d52d15a049dc2c"> 178</a></span> <span class="keyword">static</span> <span class="keyword">const</span> EdgeIndex <a class="code hl_variable" href="classoperations__research_1_1_blossom_graph.html#a8a0d1ac19aba17d0f2d52d15a049dc2c">kNoEdgeIndex</a>;</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a47f3bfcd0d135ae701956a1fa56b141a"> 179</a></span> <span class="keyword">static</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code hl_variable" href="classoperations__research_1_1_blossom_graph.html#a47f3bfcd0d135ae701956a1fa56b141a">kMaxCostValue</a>;</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> </div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="comment">// Node related data.</span></div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="comment">// We store the edges incident to a node separately in the graph_ member.</span></div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html"> 183</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a> {</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html#acbe8af3a39b73df187f0efee65bf3c4c"> 184</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="structoperations__research_1_1_blossom_graph_1_1_node.html#acbe8af3a39b73df187f0efee65bf3c4c">Node</a>(<a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n) : <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a768efacafc19717a4d6f28a2f9f41ae3">parent</a>(n), <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0c5e020f1174f613f0fe58d93e9cefa1">match</a>(n), <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2">root</a>(n) {}</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> </div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="comment">// A node can be in one of these 4 exclusive states. Internal nodes are part</span></div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="comment">// of a Blossom and should be ignored until this Blossom is expanded. All</span></div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="comment">// the other nodes are "external". A free node is always matched to another</span></div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="comment">// free node. All the other external node are in alternating [+]/[-] trees</span></div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="comment">// rooted at the only unmatched node of the tree (always of type [+]).</span></div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a6bd5709ed0198c891c1d312e700c083b"> 191</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a6bd5709ed0198c891c1d312e700c083b">IsInternal</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!<a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aab699e604962539cc9305c4e496032a5">is_internal</a> || <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26">type</a> == 0);</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aab699e604962539cc9305c4e496032a5">is_internal</a>;</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> }</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a48a8004385fae256a9c93d353016bea1"> 195</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a48a8004385fae256a9c93d353016bea1">IsFree</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26">type</a> == 0 && !<a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aab699e604962539cc9305c4e496032a5">is_internal</a>; }</div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a8cf7b66e4c76384f3d1d1f9a4ee8ae02"> 196</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a8cf7b66e4c76384f3d1d1f9a4ee8ae02">IsPlus</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26">type</a> == 1; }</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html#af7b352e9f09d2400d7686572bec02ef1"> 197</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1_blossom_graph_1_1_node.html#af7b352e9f09d2400d7686572bec02ef1">IsMinus</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26">type</a> == -1; }</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> </div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <span class="comment">// Is this node a blossom? if yes, it was formed by merging the node.blossom</span></div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="comment">// nodes together. Note that we reuse the index of node.blossom[0] for this</span></div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <span class="comment">// blossom node. A blossom node can be of any type.</span></div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0d7fbff09819deb796dfbcb6370b12b2"> 202</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0d7fbff09819deb796dfbcb6370b12b2">IsBlossom</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> !<a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a60c314ee4437d32edbfb3a178b41b433">blossom</a>.empty(); }</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> </div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> <span class="comment">// The type of this node. We use an int for convenience in the update</span></div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <span class="comment">// formulas. This is 1 for [+] nodes, -1 for [-] nodes and 0 for all the</span></div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="comment">// others.</span></div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="comment">// Internal node also have a type of zero so the dual formula are correct.</span></div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26"> 209</a></span> <span class="keywordtype">int</span> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ac765329451135abec74c45e1897abf26">type</a> = 0;</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> </div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> <span class="comment">// Whether this node is part of a blossom.</span></div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aab699e604962539cc9305c4e496032a5"> 212</a></span> <span class="keywordtype">bool</span> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aab699e604962539cc9305c4e496032a5">is_internal</a> = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> </div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="comment">// The parent of this node in its tree or itself otherwise.</span></div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="comment">// Unused for internal nodes.</span></div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a768efacafc19717a4d6f28a2f9f41ae3"> 216</a></span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a768efacafc19717a4d6f28a2f9f41ae3">parent</a>;</div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> </div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> <span class="comment">// Itself if not matched, or this node match otherwise.</span></div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <span class="comment">// Unused for internal nodes.</span></div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0c5e020f1174f613f0fe58d93e9cefa1"> 220</a></span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a0c5e020f1174f613f0fe58d93e9cefa1">match</a>;</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> </div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="comment">// The root of this tree which never changes until a tree is disassambled by</span></div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <span class="comment">// an Augment(). Unused for internal nodes.</span></div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2"> 224</a></span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a90f9ea0f563c8c66d404c8af98634be2">root</a>;</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> </div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="comment">// The "delta" to apply to get the dual for nodes of this tree.</span></div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <span class="comment">// This is only filled for root nodes (i.e unmatched nodes).</span></div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a184bf583ea5aa12c7801d157ee29514d"> 228</a></span> <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a184bf583ea5aa12c7801d157ee29514d">tree_dual_delta</a> = <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a>(0);</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> </div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="comment">// See the formula in Dual() used to derive the true dual of this node.</span></div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> <span class="comment">// This is the equal to the "true" dual for free exterior node and internal</span></div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <span class="comment">// node.</span></div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae51446839a3bac95fbd94fb2cb34f810"> 233</a></span> <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae51446839a3bac95fbd94fb2cb34f810">pseudo_dual</a> = <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a>(0);</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> </div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span><span class="preprocessor">#ifndef NDEBUG</span></div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> <span class="comment">// The true dual of this node. We only maintain this in debug mode.</span></div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aaac09b61c2e9f87b7b2234836d5a950a"> 237</a></span> <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aaac09b61c2e9f87b7b2234836d5a950a">dual</a> = <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a>(0);</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span><span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> </div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <span class="comment">// Non-empty for Blossom only. The odd-cycle of blossom nodes that form this</span></div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> <span class="comment">// blossom. The first element should always be the current blossom node, and</span></div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <span class="comment">// all the other nodes are internal nodes.</span></div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a60c314ee4437d32edbfb3a178b41b433"> 243</a></span> std::vector<NodeIndex> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a60c314ee4437d32edbfb3a178b41b433">blossom</a>;</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> </div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> <span class="comment">// This allows to store information about a new blossom node created by</span></div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> <span class="comment">// Shrink() so that we can properly restore it on Expand(). Note that we</span></div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> <span class="comment">// store the saved information on the second node of a blossom cycle (and</span></div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <span class="comment">// not the blossom node itself) because that node will be "hidden" until the</span></div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <span class="comment">// blossom is expanded so this way, we do not need more than one set of</span></div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> <span class="comment">// saved information per node.</span></div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span><span class="preprocessor">#ifndef NDEBUG</span></div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae812ee39507ef5bd0cb6b58605c7803d"> 252</a></span> <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#ae812ee39507ef5bd0cb6b58605c7803d">saved_dual</a>;</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span><span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a773c851657cfc5a2dbc0fb25958e668a"> 254</a></span> <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#a773c851657cfc5a2dbc0fb25958e668a">saved_pseudo_dual</a>;</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aa5998e93c946a8c5ec1626dee2915555"> 255</a></span> std::vector<NodeIndex> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_node.html#aa5998e93c946a8c5ec1626dee2915555">saved_blossom</a>;</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> };</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> </div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> <span class="comment">// An undirected edge between two nodes: tail <-> head.</span></div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_edge.html"> 259</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a> {</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a33a3bd5c439d1cc8885e080c691d30db"> 260</a></span> <a class="code hl_function" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a33a3bd5c439d1cc8885e080c691d30db">Edge</a>(<a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> t, <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> h, <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> c)</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> : <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a>(c),</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span>#ifndef NDEBUG</div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a015731c5f4abd13de18e78c4e4bb35ce">slack</a>(c),</div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span>#endif</div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac244bdf901af2bc171478cbcfa09266e">tail</a>(t),</div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a91f6a7d52fa6d6f96cdf7755641e0055">head</a>(h) {</div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> }</div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> </div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <span class="comment">// Returns the "other" end of this edge.</span></div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ad9e501cd6bde03f8ed86ebac02b043c9"> 270</a></span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code hl_function" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ad9e501cd6bde03f8ed86ebac02b043c9">OtherEnd</a>(<a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(n == <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac244bdf901af2bc171478cbcfa09266e">tail</a> || n == <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a91f6a7d52fa6d6f96cdf7755641e0055">head</a>);</div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <span class="keywordflow">return</span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a>(<a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac244bdf901af2bc171478cbcfa09266e">tail</a>.value() ^ <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a91f6a7d52fa6d6f96cdf7755641e0055">head</a>.value() ^ n.value());</div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> }</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> </div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <span class="comment">// AdjustablePriorityQueue interface. Note that we use std::greater<> in</span></div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> <span class="comment">// our queues since we want the lowest pseudo_slack first.</span></div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac4582a74c623d1692159c73a74f6444a"> 277</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac4582a74c623d1692159c73a74f6444a">SetHeapIndex</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) { <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a4c38126eafea999718d67dbf3e886b63">pq_position</a> = <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>; }</div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a356efb311b542164bd4667883d0973bb"> 278</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a356efb311b542164bd4667883d0973bb">GetHeapIndex</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a4c38126eafea999718d67dbf3e886b63">pq_position</a>; }</div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a836cbe3b2281771162fdf71ebe70cb82"> 279</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a836cbe3b2281771162fdf71ebe70cb82">operator></a>(<span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& other)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a> > other.<a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a>;</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> }</div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> </div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> <span class="comment">// See the formula is Slack() used to derive the true slack of this edge.</span></div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8"> 284</a></span> <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac999b32b9bba996b3abca3c5fe9f81d8">pseudo_slack</a>;</div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> </div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span><span class="preprocessor">#ifndef NDEBUG</span></div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="comment">// We only maintain this in debug mode.</span></div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a015731c5f4abd13de18e78c4e4bb35ce"> 288</a></span> <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a015731c5f4abd13de18e78c4e4bb35ce">slack</a>;</div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span><span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> </div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> <span class="comment">// These are the current tail/head of this edges. These are changed when</span></div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="comment">// creating or expanding blossoms. The order do not matter.</span></div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <span class="comment">// TODO(user): Consider using node_a/node_b instead to remove the "directed"</span></div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> <span class="comment">// meaning. I do need to think a bit more about it though.</span></div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac244bdf901af2bc171478cbcfa09266e"> 296</a></span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac244bdf901af2bc171478cbcfa09266e">tail</a>;</div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a91f6a7d52fa6d6f96cdf7755641e0055"> 297</a></span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a91f6a7d52fa6d6f96cdf7755641e0055">head</a>;</div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> </div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="comment">// Position of this Edge in the underlying std::vector<> used to encode the</span></div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> <span class="comment">// heap of one priority queue. An edge can be in at most one priority queue</span></div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> <span class="comment">// which allow us to share this amongst queues.</span></div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a4c38126eafea999718d67dbf3e886b63"> 302</a></span> <span class="keywordtype">int</span> <a class="code hl_variable" href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a4c38126eafea999718d67dbf3e886b63">pq_position</a> = -1;</div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> };</div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> </div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> <span class="comment">// Creates a BlossomGraph on the given number of nodes.</span></div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> <span class="keyword">explicit</span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#ae0848b03565c382ae68dca458899dc58">BlossomGraph</a>(<span class="keywordtype">int</span> num_nodes);</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> </div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> <span class="comment">// Same comment as MinCostPerfectMatching::AddEdgeWithCost() applies.</span></div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a58f432346ba2007a0c0a62ad8789b048">AddEdge</a>(<a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code hl_variable" href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a>, <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code hl_variable" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a>, <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>);</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> </div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> <span class="comment">// Heuristic to start with a dual-feasible solution and some matched edges.</span></div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> <span class="comment">// To be called once all edges are added. Returns false if the problem is</span></div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> <span class="comment">// detected to be INFEASIBLE.</span></div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> ABSL_MUST_USE_RESULT <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a248c764067ee60c03ee370784c49f353">Initialize</a>();</div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> </div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> <span class="comment">// Enters a loop that perform one of Grow()/Augment()/Shrink()/Expand() until</span></div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> <span class="comment">// a fixed point is reached.</span></div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a0a45bd01bdb08f462f19cf483b88a6d1">PrimalUpdates</a>();</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> </div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> <span class="comment">// Computes the maximum possible delta for UpdateAllTrees() that keeps the</span></div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> <span class="comment">// dual feasibility. Dual update approach (2) from the paper. This also fills</span></div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> <span class="comment">// primal_update_edge_queue_.</span></div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a3a2cd7bcc756090a5e1a7bcdfa530a1b">ComputeMaxCommonTreeDualDeltaAndResetPrimalEdgeQueue</a>();</div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> </div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> <span class="comment">// Applies the same dual delta to all trees. Dual update approach (2) from the</span></div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> <span class="comment">// paper.</span></div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#acdf1d4050349cf4a87c08498eaa2d1e9">UpdateAllTrees</a>(<a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>);</div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> </div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> <span class="comment">// Returns true iff this node is matched and is thus not a tree root.</span></div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> <span class="comment">// This cannot live in the Node class because we need to know the NodeIndex.</span></div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a5ba793d57999d40090be769a97c6ac59">NodeIsMatched</a>(<a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> </div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> <span class="comment">// Returns the node matched to the given one, or n if this node is not</span></div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> <span class="comment">// currently matched.</span></div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a498ac6ce9ab7d52b1ff1dd3fefc1a5b7">Match</a>(<a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> </div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> <span class="comment">// Adds to the tree of tail the free matched pair(head, Match(head)).</span></div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> <span class="comment">// The edge is only used in DCHECKs. We duplicate tail/head because the</span></div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> <span class="comment">// order matter here.</span></div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a39b5c65490728705cd4471c549ff1d95">Grow</a>(EdgeIndex e, <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code hl_variable" href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a>, <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code hl_variable" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a>);</div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> </div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> <span class="comment">// Merges two tree and augment the number of matched nodes by 1. This is</span></div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> <span class="comment">// the only functions that change the current matching.</span></div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a77239a64984b6868f08721b84d7c08a1">Augment</a>(EdgeIndex e);</div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> </div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> <span class="comment">// Creates a Blossom using the given [+] -- [+] edge between two nodes of the</span></div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> <span class="comment">// same tree.</span></div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#aacc1343585a38bfaa42702e635552837">Shrink</a>(EdgeIndex e);</div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> </div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> <span class="comment">// Expands a Blossom into its component.</span></div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#abf9aa973816e638a2b972b595d952c0e">Expand</a>(<a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> to_expand);</div>
|
|
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> </div>
|
|
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> <span class="comment">// Returns the current number of matched nodes.</span></div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a8379ad4afea8a3ac8be17b00585e8328"> 354</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a8379ad4afea8a3ac8be17b00585e8328">NumMatched</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> nodes_.<a class="code hl_function" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>() - unmatched_nodes_.size(); }</div>
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> </div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> <span class="comment">// Returns the current dual objective which is always a valid lower-bound on</span></div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> <span class="comment">// the min-cost matching. Note that this is capped to kint64max in case of</span></div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> <span class="comment">// overflow. Because all of our cost are positive, this starts at zero.</span></div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a302c5cc32e01ba375848a3f32d82c431">DualObjective</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> </div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> <span class="comment">// This must be called at the end of the algorithm to recover the matching.</span></div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#ad0050e8e5a05f9fb9add3a7ccfd96cf2">ExpandAllBlossoms</a>();</div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> </div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> <span class="comment">// Return the "slack" of the given edge.</span></div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a5ec09b02b175052c5546eda76464accd">Slack</a>(<span class="keyword">const</span> Edge& edge) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> </div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> <span class="comment">// Returns the dual value of the given node (which might be a pseudo-node).</span></div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a7cc8e3de83d28065411068cf09b7992e">Dual</a>(<span class="keyword">const</span> Node& node) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> </div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> <span class="comment">// Display to VLOG(1) some statistic about the solve.</span></div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#ad74099ecb3f19aea3065345aeb146333">DisplayStats</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> </div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> <span class="comment">// Checks that there is no possible primal update in the current</span></div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> <span class="comment">// configuration.</span></div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a6f810c6acdae2d7caa9ca2f8cbf35ce5">DebugCheckNoPossiblePrimalUpdates</a>();</div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> </div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> <span class="comment">// Tests that the dual values are currently feasible.</span></div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> <span class="comment">// This should ALWAYS be the case.</span></div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a10faf3cb1acc845ce59c867bd9753155">DebugDualsAreFeasible</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> </div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> <span class="comment">// In debug mode, we maintain the real slack of each edges and the real dual</span></div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> <span class="comment">// of each node via this function. Both Slack() and Dual() checks in debug</span></div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> <span class="comment">// mode that the value computed is the correct one.</span></div>
|
|
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#ad7e519048b150893f06581b7f270c118">DebugUpdateNodeDual</a>(<a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n, <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>);</div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> </div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> <span class="comment">// Returns true iff this is an external edge with a slack of zero.</span></div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> <span class="comment">// An external edge is an edge between two external nodes.</span></div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a41347b63abb9f92b02b1705cdae50cad">DebugEdgeIsTightAndExternal</a>(<span class="keyword">const</span> Edge& edge) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> </div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> <span class="comment">// Getters to access node/edges from outside the class.</span></div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> <span class="comment">// Only used in tests.</span></div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a5a302fa4cb465673819088d15ed0b6c5"> 392</a></span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1_blossom_graph_1_1_edge.html">Edge</a>& <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a5a302fa4cb465673819088d15ed0b6c5">GetEdge</a>(<span class="keywordtype">int</span> e)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> edges_[EdgeIndex(e)]; }</div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_blossom_graph.html#a253585ccd6dfe3d04daa994f4f56b82c"> 393</a></span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1_blossom_graph_1_1_node.html">Node</a>& <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a253585ccd6dfe3d04daa994f4f56b82c">GetNode</a>(<span class="keywordtype">int</span> n)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> nodes_[<a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a>(n)]; }</div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> </div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> <span class="comment">// Display information for debugging.</span></div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> std::string <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a641610cf698af15f1f8e24741c1fd572">NodeDebugString</a>(<a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> std::string <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a67cea30280176172db379ad925f2e6ca">EdgeDebugString</a>(EdgeIndex e) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> std::string <a class="code hl_function" href="classoperations__research_1_1_blossom_graph.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> </div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> <span class="comment">// Returns the index of a tight edge between the two given external nodes.</span></div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> <span class="comment">// Returns kNoEdgeIndex if none could be found.</span></div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> <span class="comment">// TODO(user): Store edges for match/parent/blossom instead and remove the</span></div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> <span class="comment">// need for this function that can take around 10% of the running time on</span></div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> <span class="comment">// some problems.</span></div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> EdgeIndex FindTightExternalEdgeBetweenNodes(<a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code hl_variable" href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a>, <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code hl_variable" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a>);</div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> </div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> <span class="comment">// Appends the path from n to the root of its tree. Used by Augment().</span></div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> <span class="keywordtype">void</span> AppendNodePathToRoot(<a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n, std::vector<NodeIndex>* path) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> </div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> <span class="comment">// Returns the depth of a node in its tree. Used by Shrink().</span></div>
|
|
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> <span class="keywordtype">int</span> GetDepth(<a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span> </div>
|
|
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> <span class="comment">// Adds positive delta to dual_objective_ and cap at kint64max on overflow.</span></div>
|
|
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> <span class="keywordtype">void</span> AddToDualObjective(<a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>);</div>
|
|
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> </div>
|
|
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> <span class="comment">// In the presence of blossoms, the original tail/head of an arc might not be</span></div>
|
|
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> <span class="comment">// up to date anymore. It is important to use these functions instead in all</span></div>
|
|
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> <span class="comment">// the places where this can happen. That is basically everywhere except in</span></div>
|
|
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> <span class="comment">// the initialization.</span></div>
|
|
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> Tail(<span class="keyword">const</span> Edge& edge)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span> <span class="keywordflow">return</span> root_blossom_node_[edge.tail];</div>
|
|
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno"> 424</span> }</div>
|
|
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> Head(<span class="keyword">const</span> Edge& edge)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> <span class="keywordflow">return</span> root_blossom_node_[edge.head];</div>
|
|
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> }</div>
|
|
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> </div>
|
|
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> <span class="comment">// Returns the Head() or Tail() that does not correspond to node. Node that</span></div>
|
|
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> <span class="comment">// node must be one of the original index in the given edge, this is DCHECKed</span></div>
|
|
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> <span class="comment">// by edge.OtherEnd().</span></div>
|
|
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> OtherEnd(<span class="keyword">const</span> Edge& edge, <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> <span class="keywordflow">return</span> root_blossom_node_[edge.OtherEnd(node)];</div>
|
|
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> }</div>
|
|
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> </div>
|
|
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> <span class="comment">// Same as OtherEnd() but the given node should either be Tail(edge) or</span></div>
|
|
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> <span class="comment">// Head(edge) and do not need to be one of the original node of this edge.</span></div>
|
|
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> OtherEndFromExternalNode(<span class="keyword">const</span> Edge& edge, <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code hl_variable" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a> = Head(edge);</div>
|
|
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a> != node) {</div>
|
|
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(node, Tail(edge));</div>
|
|
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a>;</div>
|
|
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> }</div>
|
|
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> <span class="keywordflow">return</span> Tail(edge);</div>
|
|
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> }</div>
|
|
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> </div>
|
|
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"> 447</span> <span class="comment">// Returns the given node and if this node is a blossom, all its internal</span></div>
|
|
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span> <span class="comment">// nodes (recursively). Note that any call to SubNodes() invalidate the</span></div>
|
|
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> <span class="comment">// previously returned reference.</span></div>
|
|
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span> <span class="keyword">const</span> std::vector<NodeIndex>& SubNodes(<a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n);</div>
|
|
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</span> </div>
|
|
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"> 452</span> <span class="comment">// Just used to check that initialized is called exactly once.</span></div>
|
|
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span> <span class="keywordtype">bool</span> is_initialized_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span> </div>
|
|
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"> 455</span> <span class="comment">// The set of all edges/nodes of the graph.</span></div>
|
|
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<EdgeIndex, Edge></a> edges_;</div>
|
|
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"> 457</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<NodeIndex, Node></a> nodes_;</div>
|
|
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> </div>
|
|
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> <span class="comment">// Identity for a non-blossom node, and its top blossom node (in case of many</span></div>
|
|
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span> <span class="comment">// nested blossom) for an internal node.</span></div>
|
|
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<NodeIndex, NodeIndex></a> root_blossom_node_;</div>
|
|
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> </div>
|
|
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> <span class="comment">// The current graph incidence. Note that one EdgeIndex should appear in</span></div>
|
|
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> <span class="comment">// exactly two places (on its tail and head incidence list).</span></div>
|
|
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<NodeIndex, std::vector<EdgeIndex></a>> graph_;</div>
|
|
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> </div>
|
|
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> <span class="comment">// Used by SubNodes().</span></div>
|
|
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> std::vector<NodeIndex> subnodes_;</div>
|
|
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> </div>
|
|
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"> 470</span> <span class="comment">// The unmatched nodes are exactly the root of the trees. After</span></div>
|
|
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span> <span class="comment">// initialization, this is only modified by Augment() which removes two nodes</span></div>
|
|
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> <span class="comment">// from this list each time. Note that during Shrink()/Expand() we never</span></div>
|
|
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> <span class="comment">// change the indexing of the root nodes.</span></div>
|
|
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno"> 474</span> std::vector<NodeIndex> unmatched_nodes_;</div>
|
|
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"> 475</span> </div>
|
|
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno"> 476</span> <span class="comment">// List of tight_edges and possible shrink to check in PrimalUpdates().</span></div>
|
|
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span> std::vector<EdgeIndex> primal_update_edge_queue_;</div>
|
|
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> std::vector<EdgeIndex> possible_shrink_;</div>
|
|
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"> 479</span> </div>
|
|
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"> 480</span> <span class="comment">// Priority queues of edges of a certain types.</span></div>
|
|
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<Edge, std::greater<Edge></a>> plus_plus_pq_;</div>
|
|
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<Edge, std::greater<Edge></a>> plus_free_pq_;</div>
|
|
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span> std::vector<Edge*> tmp_all_tops_;</div>
|
|
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> </div>
|
|
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> <span class="comment">// The dual objective. Increase as the algorithm progress. This is a lower</span></div>
|
|
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> <span class="comment">// bound on the min-cost of a perfect matching.</span></div>
|
|
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> dual_objective_ = <a class="code hl_typedef" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a>(0);</div>
|
|
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> </div>
|
|
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> <span class="comment">// Statistics on the main operations.</span></div>
|
|
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> int64_t num_grows_ = 0;</div>
|
|
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span> int64_t num_augments_ = 0;</div>
|
|
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> int64_t num_shrinks_ = 0;</div>
|
|
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"> 493</span> int64_t num_expands_ = 0;</div>
|
|
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> int64_t num_dual_updates_ = 0;</div>
|
|
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span>};</div>
|
|
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> </div>
|
|
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span> </div>
|
|
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_GRAPH_PERFECT_MATCHING_H_</span></div>
|
|
<div class="ttc" id="aadjustable__priority__queue-inl_8h_html"><div class="ttname"><a href="adjustable__priority__queue-inl_8h.html">adjustable_priority_queue-inl.h</a></div></div>
|
|
<div class="ttc" id="aadjustable__priority__queue_8h_html"><div class="ttname"><a href="adjustable__priority__queue_8h.html">adjustable_priority_queue.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00890">base/logging.h:890</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00891">base/logging.h:891</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html"><div class="ttname"><a href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a></div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00038">adjustable_priority_queue.h:38</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html"><div class="ttname"><a href="classabsl_1_1_strong_vector.html">absl::StrongVector</a></div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00076">strong_vector.h:76</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_a60304b65bf89363bcc3165d3cde67f86"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">absl::StrongVector::size</a></div><div class="ttdeci">size_type size() const</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00147">strong_vector.h:147</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html">operations_research::BlossomGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00167">perfect_matching.h:167</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#l00385">perfect_matching.cc:385</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#l00454">perfect_matching.cc:454</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a1cfbd5eadb491e5dabdd78aaaae17c49"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a1cfbd5eadb491e5dabdd78aaaae17c49">operations_research::BlossomGraph::DEFINE_STRONG_INT_TYPE</a></div><div class="ttdeci">DEFINE_STRONG_INT_TYPE(CostValue, int64_t)</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#l00147">perfect_matching.cc:147</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a253585ccd6dfe3d04daa994f4f56b82c"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a253585ccd6dfe3d04daa994f4f56b82c">operations_research::BlossomGraph::GetNode</a></div><div class="ttdeci">const Node & GetNode(int n) const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00393">perfect_matching.h:393</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#l01259">perfect_matching.cc:1259</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#l00474">perfect_matching.cc:474</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#l00263">perfect_matching.cc:263</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#l00467">perfect_matching.cc:467</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#l00179">perfect_matching.h:179</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#l00340">perfect_matching.cc:340</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#l00130">perfect_matching.cc:130</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a5a302fa4cb465673819088d15ed0b6c5"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a5a302fa4cb465673819088d15ed0b6c5">operations_research::BlossomGraph::GetEdge</a></div><div class="ttdeci">const Edge & GetEdge(int e) const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00392">perfect_matching.h:392</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#l00333">perfect_matching.cc:333</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#l01232">perfect_matching.cc:1232</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#l01181">perfect_matching.cc:1181</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#l01197">perfect_matching.cc:1197</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#l00351">perfect_matching.cc:351</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#l01207">perfect_matching.cc:1207</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#l00551">perfect_matching.cc:551</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a7b7d0779f5d5443c8467f8a7f6555aba"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a7b7d0779f5d5443c8467f8a7f6555aba">operations_research::BlossomGraph::DEFINE_STRONG_INT_TYPE</a></div><div class="ttdeci">DEFINE_STRONG_INT_TYPE(NodeIndex, int)</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#l01250">perfect_matching.cc:1250</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_a8379ad4afea8a3ac8be17b00585e8328"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#a8379ad4afea8a3ac8be17b00585e8328">operations_research::BlossomGraph::NumMatched</a></div><div class="ttdeci">int NumMatched() const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00354">perfect_matching.h:354</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#l00178">perfect_matching.h:178</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#l00177">perfect_matching.h:177</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#l00654">perfect_matching.cc:654</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#l00849">perfect_matching.cc:849</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_blossom_graph_html_accda7b48cb8febe4aa8a7c8ddadd5dc8"><div class="ttname"><a href="classoperations__research_1_1_blossom_graph.html#accda7b48cb8febe4aa8a7c8ddadd5dc8">operations_research::BlossomGraph::DEFINE_STRONG_INT_TYPE</a></div><div class="ttdeci">DEFINE_STRONG_INT_TYPE(EdgeIndex, int)</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#l00313">perfect_matching.cc:313</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#l01058">perfect_matching.cc:1058</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#l01271">perfect_matching.cc:1271</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#l01218">perfect_matching.cc:1218</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#l00120">perfect_matching.cc:120</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_perfect_matching_html"><div class="ttname"><a href="classoperations__research_1_1_min_cost_perfect_matching.html">operations_research::MinCostPerfectMatching</a></div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00052">perfect_matching.h:52</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#l00042">perfect_matching.cc:42</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_perfect_matching_html_a132e58de7ebb46a1ba677b77f6e60907"><div class="ttname"><a href="classoperations__research_1_1_min_cost_perfect_matching.html#a132e58de7ebb46a1ba677b77f6e60907">operations_research::MinCostPerfectMatching::AddEdgeWithCost</a></div><div class="ttdeci">void AddEdgeWithCost(int tail, int head, int64_t cost)</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8cc_source.html#l00030">perfect_matching.cc:30</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_perfect_matching_html_a14613ae615a2f7b740548dee2f3924fe"><div class="ttname"><a href="classoperations__research_1_1_min_cost_perfect_matching.html#a14613ae615a2f7b740548dee2f3924fe">operations_research::MinCostPerfectMatching::Match</a></div><div class="ttdeci">int Match(int node) const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00111">perfect_matching.h:111</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#l00024">perfect_matching.cc:24</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#l00083">perfect_matching.h:83</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_perfect_matching_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba170e5ad124faa3551e4cad0020ddc383"><div class="ttname"><a href="classoperations__research_1_1_min_cost_perfect_matching.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba170e5ad124faa3551e4cad0020ddc383">operations_research::MinCostPerfectMatching::COST_OVERFLOW</a></div><div class="ttdeci">@ COST_OVERFLOW</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00098">perfect_matching.h:98</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_perfect_matching_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad"><div class="ttname"><a href="classoperations__research_1_1_min_cost_perfect_matching.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad">operations_research::MinCostPerfectMatching::OPTIMAL</a></div><div class="ttdeci">@ OPTIMAL</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00085">perfect_matching.h:85</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_perfect_matching_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483"><div class="ttname"><a href="classoperations__research_1_1_min_cost_perfect_matching.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">operations_research::MinCostPerfectMatching::INFEASIBLE</a></div><div class="ttdeci">@ INFEASIBLE</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00088">perfect_matching.h:88</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_perfect_matching_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba90da5a203bf180f1d4f9172502a90197"><div class="ttname"><a href="classoperations__research_1_1_min_cost_perfect_matching.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba90da5a203bf180f1d4f9172502a90197">operations_research::MinCostPerfectMatching::INTEGER_OVERFLOW</a></div><div class="ttdeci">@ INTEGER_OVERFLOW</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00092">perfect_matching.h:92</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_perfect_matching_html_a7b08631db7352215798c8340d3258bc7"><div class="ttname"><a href="classoperations__research_1_1_min_cost_perfect_matching.html#a7b08631db7352215798c8340d3258bc7">operations_research::MinCostPerfectMatching::Matches</a></div><div class="ttdeci">const std::vector< int > & Matches() const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00115">perfect_matching.h:115</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_perfect_matching_html_a9a737ec352e2ec27de0ddafdec837be6"><div class="ttname"><a href="classoperations__research_1_1_min_cost_perfect_matching.html#a9a737ec352e2ec27de0ddafdec837be6">operations_research::MinCostPerfectMatching::MinCostPerfectMatching</a></div><div class="ttdeci">MinCostPerfectMatching()</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00056">perfect_matching.h:56</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_perfect_matching_html_ac18e06d91adf077dc719d138605475eb"><div class="ttname"><a href="classoperations__research_1_1_min_cost_perfect_matching.html#ac18e06d91adf077dc719d138605475eb">operations_research::MinCostPerfectMatching::MinCostPerfectMatching</a></div><div class="ttdeci">MinCostPerfectMatching(int num_nodes)</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00057">perfect_matching.h:57</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_perfect_matching_html_ae840999972ebda3637f5299a2ead7f08"><div class="ttname"><a href="classoperations__research_1_1_min_cost_perfect_matching.html#ae840999972ebda3637f5299a2ead7f08">operations_research::MinCostPerfectMatching::OptimalCost</a></div><div class="ttdeci">int64_t OptimalCost() const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00104">perfect_matching.h:104</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="alocal__search_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l02750">local_search.cc:2750</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.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">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a7ae31ba4c3b4899478e53ca13df35dfc"><div class="ttname"><a href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">operations_research::NodeIndex</a></div><div class="ttdeci">int32_t NodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00201">ebert_graph.h:193</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_t CostValue</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00204">ebert_graph.h:204</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_af12056bc2a8e3ec563f0940d87abbd2e"><div class="ttname"><a href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a></div><div class="ttdeci">int64_t delta</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01694">resource.cc:1694</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a64e7efc5529154ba56903e75f5300990"><div class="ttname"><a href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a></div><div class="ttdeci">int64_t tail</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00149">routing_flow.cc:149</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a75d7b5e4cab1e156cc7a2c5eba1e16f1"><div class="ttname"><a href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a></div><div class="ttdeci">int64_t cost</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00152">routing_flow.cc:152</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_afca32f65388659a4b0956496169488b4"><div class="ttname"><a href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a></div><div class="ttdeci">int64_t head</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00150">routing_flow.cc:150</a></div></div>
|
|
<div class="ttc" id="astrong__int_8h_html"><div class="ttname"><a href="strong__int_8h.html">strong_int.h</a></div></div>
|
|
<div class="ttc" id="astrong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</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#l00259">perfect_matching.h:259</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#l00288">perfect_matching.h:288</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_edge_html_a33a3bd5c439d1cc8885e080c691d30db"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a33a3bd5c439d1cc8885e080c691d30db">operations_research::BlossomGraph::Edge::Edge</a></div><div class="ttdeci">Edge(NodeIndex t, NodeIndex h, CostValue c)</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00260">perfect_matching.h:260</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_edge_html_a356efb311b542164bd4667883d0973bb"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a356efb311b542164bd4667883d0973bb">operations_research::BlossomGraph::Edge::GetHeapIndex</a></div><div class="ttdeci">int GetHeapIndex() const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00278">perfect_matching.h:278</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_edge_html_a4c38126eafea999718d67dbf3e886b63"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a4c38126eafea999718d67dbf3e886b63">operations_research::BlossomGraph::Edge::pq_position</a></div><div class="ttdeci">int pq_position</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00302">perfect_matching.h:302</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_edge_html_a836cbe3b2281771162fdf71ebe70cb82"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_edge.html#a836cbe3b2281771162fdf71ebe70cb82">operations_research::BlossomGraph::Edge::operator></a></div><div class="ttdeci">bool operator>(const Edge &other) const</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00279">perfect_matching.h:279</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#l00297">perfect_matching.h:297</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#l00296">perfect_matching.h:296</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_edge_html_ac4582a74c623d1692159c73a74f6444a"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_edge.html#ac4582a74c623d1692159c73a74f6444a">operations_research::BlossomGraph::Edge::SetHeapIndex</a></div><div class="ttdeci">void SetHeapIndex(int index)</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00277">perfect_matching.h:277</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#l00284">perfect_matching.h:284</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#l00270">perfect_matching.h:270</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#l00183">perfect_matching.h:183</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#l00220">perfect_matching.h:220</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#l00202">perfect_matching.h:202</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_node_html_a184bf583ea5aa12c7801d157ee29514d"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html#a184bf583ea5aa12c7801d157ee29514d">operations_research::BlossomGraph::Node::tree_dual_delta</a></div><div class="ttdeci">CostValue tree_dual_delta</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00228">perfect_matching.h:228</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#l00195">perfect_matching.h:195</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#l00243">perfect_matching.h:243</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#l00191">perfect_matching.h:191</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#l00216">perfect_matching.h:216</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#l00254">perfect_matching.h:254</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#l00196">perfect_matching.h:196</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#l00224">perfect_matching.h:224</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#l00255">perfect_matching.h:255</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#l00237">perfect_matching.h:237</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#l00212">perfect_matching.h:212</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#l00209">perfect_matching.h:209</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_blossom_graph_1_1_node_html_acbe8af3a39b73df187f0efee65bf3c4c"><div class="ttname"><a href="structoperations__research_1_1_blossom_graph_1_1_node.html#acbe8af3a39b73df187f0efee65bf3c4c">operations_research::BlossomGraph::Node::Node</a></div><div class="ttdeci">Node(NodeIndex n)</div><div class="ttdef"><b>Definition:</b> <a href="perfect__matching_8h_source.html#l00184">perfect_matching.h:184</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#l00233">perfect_matching.h:233</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#l00252">perfect_matching.h:252</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#l00197">perfect_matching.h:197</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_725f3a5915051842f84e3ea508be2a62.html">graph</a></li><li class="navelem"><a class="el" href="perfect__matching_8h.html">perfect_matching.h</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|