always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
faf940b89fc20dbe805f67724df4e0ecc8f03e59
ortools-clone/docs/cpp/connected__components_8cc_source.html
Mizux Seiha 3b81c981c2 Update doc
2022-03-04 00:19:15 +01:00

283 lines
37 KiB
HTML
Raw Blame History

<!-- 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: connected_components.cc Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">OR-Tools
&#160;<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&amp;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&amp;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&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('connected__components_8cc_source.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle"><div class="title">connected_components.cc</div></div>
</div><!--header-->
<div class="contents">
<a href="connected__components_8cc.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 &quot;License&quot;);</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 &quot;AS IS&quot; 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">//</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the &quot;License&quot;);</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="comment">// You may obtain a copy of the License at</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="comment">//</span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="comment">//</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="comment">// distributed under the License is distributed on an &quot;AS IS&quot; BASIS,</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="comment">// limitations under the License.</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> </div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="comment">// The following uses disjoint-sets algorithms, see:</span></div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="comment">// https://en.wikipedia.org/wiki/Disjoint-set_data_structure#Disjoint-set_forests</span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> </div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include &quot;<a class="code" href="connected__components_8h.html">ortools/graph/connected_components.h</a>&quot;</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> </div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="preprocessor">#include &lt;numeric&gt;</span></div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> </div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="preprocessor">#include &quot;<a class="code" href="stl__util_8h.html">ortools/base/stl_util.h</a>&quot;</span></div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> </div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="class_dense_connected_components_finder.html#ad8e718920ab9683d39af650d714cffe1"> 36</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="class_dense_connected_components_finder.html#ad8e718920ab9683d39af650d714cffe1">DenseConnectedComponentsFinder::SetNumberOfNodes</a>(<span class="keywordtype">int</span> num_nodes) {</div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> <span class="keyword">const</span> <span class="keywordtype">int</span> old_num_nodes = <a class="code hl_function" href="class_dense_connected_components_finder.html#aeeb8b88902830cab41c69ef944b5694f">GetNumberOfNodes</a>();</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> <span class="keywordflow">if</span> (num_nodes == old_num_nodes) {</div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> }</div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <a class="code hl_define" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(num_nodes, old_num_nodes);</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// Each new node starts as an isolated component:</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// It has itself as root.</span></div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> parent_.resize(num_nodes);</div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> std::iota(parent_.begin() + old_num_nodes, parent_.end(), old_num_nodes);</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// It&#39;s in an isolated component of size 1.</span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> component_size_.resize(num_nodes, 1);</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// Its rank is 0.</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> rank_.resize(num_nodes);</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// This introduces one extra component per added node.</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> num_components_ += num_nodes - old_num_nodes;</div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span>}</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> </div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="class_dense_connected_components_finder.html#a5484947d25c2901c60d02ea14d0e1a06"> 54</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="class_dense_connected_components_finder.html#a5484947d25c2901c60d02ea14d0e1a06">DenseConnectedComponentsFinder::FindRoot</a>(<span class="keywordtype">int</span> node) {</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(node, 0);</div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(node, <a class="code hl_function" href="class_dense_connected_components_finder.html#aeeb8b88902830cab41c69ef944b5694f">GetNumberOfNodes</a>());</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> </div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// Search the root.</span></div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keywordtype">int</span> root = parent_[node];</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keywordflow">while</span> (parent_[root] != root) {</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> root = parent_[root];</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> }</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> </div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="comment">// Apply path compression.</span></div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordflow">while</span> (node != root) {</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keyword">const</span> <span class="keywordtype">int</span> prev_parent = parent_[node];</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> parent_[node] = root;</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> node = prev_parent;</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> }</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keywordflow">return</span> root;</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span>}</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> </div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"><a class="line" href="class_dense_connected_components_finder.html#ae6201f6f09303eabd7f77e238b4f3a44"> 73</a></span><span class="keyword">const</span> std::vector&lt;int&gt;&amp; <a class="code hl_function" href="class_dense_connected_components_finder.html#ae6201f6f09303eabd7f77e238b4f3a44">DenseConnectedComponentsFinder::GetComponentRoots</a>() {</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = <a class="code hl_function" href="class_dense_connected_components_finder.html#aeeb8b88902830cab41c69ef944b5694f">GetNumberOfNodes</a>();</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keywordflow">if</span> (num_nodes != num_nodes_at_last_get_roots_call_) {</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="comment">// Add potential roots for each new node that did not exist the last time</span></div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="comment">// GetComponentRoots() was called. The cost here is amortized against</span></div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="comment">// adding the nodes in the first place.</span></div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="keyword">const</span> <span class="keywordtype">int</span> previous_num_roots = roots_.size();</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> roots_.resize(previous_num_roots + num_nodes -</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> num_nodes_at_last_get_roots_call_);</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> std::iota(roots_.begin() + previous_num_roots, roots_.end(),</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> num_nodes_at_last_get_roots_call_);</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> }</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> </div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="comment">// Remove the roots that have been merged with other components. Each node</span></div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="comment">// only gets removed once from the roots vector, so the cost of FindRoot() is</span></div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <span class="comment">// amortized against adding the edge.</span></div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <a class="code hl_function" href="namespacegtl.html#a4afa1e83cd6407fa4b77d49b8c136806">gtl::STLEraseAllFromSequenceIf</a>(</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> &amp;roots_, [&amp;](<span class="keyword">const</span> <span class="keywordtype">int</span> node) { <span class="keywordflow">return</span> node != <a class="code hl_function" href="class_dense_connected_components_finder.html#a5484947d25c2901c60d02ea14d0e1a06">FindRoot</a>(node); });</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> </div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> num_nodes_at_last_get_roots_call_ = num_nodes;</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keywordflow">return</span> roots_;</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span>}</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> </div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"><a class="line" href="class_dense_connected_components_finder.html#a428ab6b7c944afe33bd86a6a1ae7e668"> 96</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="class_dense_connected_components_finder.html#a428ab6b7c944afe33bd86a6a1ae7e668">DenseConnectedComponentsFinder::AddEdge</a>(<span class="keywordtype">int</span> node1, <span class="keywordtype">int</span> node2) {</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// Grow if needed.</span></div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="keyword">const</span> <span class="keywordtype">int</span> min_num_nodes = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(node1, node2) + 1;</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordflow">if</span> (min_num_nodes &gt; <a class="code hl_function" href="class_dense_connected_components_finder.html#aeeb8b88902830cab41c69ef944b5694f">GetNumberOfNodes</a>()) {</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <a class="code hl_function" href="class_dense_connected_components_finder.html#ad8e718920ab9683d39af650d714cffe1">SetNumberOfNodes</a>(min_num_nodes);</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> </div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// Just union the sets for node1 and node2.</span></div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keywordtype">int</span> root1 = <a class="code hl_function" href="class_dense_connected_components_finder.html#a5484947d25c2901c60d02ea14d0e1a06">FindRoot</a>(node1);</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="keywordtype">int</span> root2 = <a class="code hl_function" href="class_dense_connected_components_finder.html#a5484947d25c2901c60d02ea14d0e1a06">FindRoot</a>(node2);</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> </div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="comment">// Already the same set.</span></div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keywordflow">if</span> (root1 == root2) {</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> }</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</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#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(num_components_, 2);</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> --num_components_;</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"> 115</span> <span class="keyword">const</span> <span class="keywordtype">int</span> component_size = component_size_[root1] + component_size_[root2];</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> </div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="comment">// Attach the shallowest tree to root of the deepest one. Note that this</span></div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="comment">// operation grows the rank of the new common root by at most one (if the two</span></div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <span class="comment">// trees originally have the same rank).</span></div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="keywordflow">if</span> (rank_[root1] &gt; rank_[root2]) {</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> parent_[root2] = root1;</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> component_size_[root1] = component_size;</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> parent_[root1] = root2;</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> component_size_[root2] = component_size;</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="comment">// If the ranks were the same then attaching just grew the rank by one.</span></div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="keywordflow">if</span> (rank_[root1] == rank_[root2]) {</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> ++rank_[root2];</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> }</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> }</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="keywordflow">return</span> <span class="keyword">true</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> </div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"><a class="line" href="class_dense_connected_components_finder.html#a962b54327591b21cc0a9273f78906a8b"> 134</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="class_dense_connected_components_finder.html#a962b54327591b21cc0a9273f78906a8b">DenseConnectedComponentsFinder::Connected</a>(<span class="keywordtype">int</span> node1, <span class="keywordtype">int</span> node2) {</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="keywordflow">if</span> (node1 &lt; 0 || node1 &gt;= <a class="code hl_function" href="class_dense_connected_components_finder.html#aeeb8b88902830cab41c69ef944b5694f">GetNumberOfNodes</a>() || node2 &lt; 0 ||</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> node2 &gt;= <a class="code hl_function" href="class_dense_connected_components_finder.html#aeeb8b88902830cab41c69ef944b5694f">GetNumberOfNodes</a>()) {</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> }</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="keywordflow">return</span> <a class="code hl_function" href="class_dense_connected_components_finder.html#a5484947d25c2901c60d02ea14d0e1a06">FindRoot</a>(node1) == <a class="code hl_function" href="class_dense_connected_components_finder.html#a5484947d25c2901c60d02ea14d0e1a06">FindRoot</a>(node2);</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span>}</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> </div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"><a class="line" href="class_dense_connected_components_finder.html#af783278e17675394e30c3de598b11169"> 142</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="class_dense_connected_components_finder.html#af783278e17675394e30c3de598b11169">DenseConnectedComponentsFinder::GetSize</a>(<span class="keywordtype">int</span> node) {</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="keywordflow">if</span> (node &lt; 0 || node &gt;= <a class="code hl_function" href="class_dense_connected_components_finder.html#aeeb8b88902830cab41c69ef944b5694f">GetNumberOfNodes</a>()) {</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> }</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="keywordflow">return</span> component_size_[<a class="code hl_function" href="class_dense_connected_components_finder.html#a5484947d25c2901c60d02ea14d0e1a06">FindRoot</a>(node)];</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span>}</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> </div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"><a class="line" href="class_dense_connected_components_finder.html#a74aadb96adc6f37110393d5fbd2279c5"> 149</a></span>std::vector&lt;int&gt; <a class="code hl_function" href="class_dense_connected_components_finder.html#a74aadb96adc6f37110393d5fbd2279c5">DenseConnectedComponentsFinder::GetComponentIds</a>() {</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> std::vector&lt;int&gt; component_ids(<a class="code hl_function" href="class_dense_connected_components_finder.html#aeeb8b88902830cab41c69ef944b5694f">GetNumberOfNodes</a>(), -1);</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <span class="keywordtype">int</span> current_component = 0;</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node &lt; <a class="code hl_function" href="class_dense_connected_components_finder.html#aeeb8b88902830cab41c69ef944b5694f">GetNumberOfNodes</a>(); ++node) {</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="keywordtype">int</span>&amp; root_component = component_ids[<a class="code hl_function" href="class_dense_connected_components_finder.html#a5484947d25c2901c60d02ea14d0e1a06">FindRoot</a>(node)];</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="keywordflow">if</span> (root_component &lt; 0) {</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <span class="comment">// This is the first node in a yet unseen component.</span></div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> root_component = current_component;</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> ++current_component;</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> }</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> component_ids[node] = root_component;</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> }</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="keywordflow">return</span> component_ids;</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span>}</div>
<div class="ttc" id="aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00708">base/logging.h:708</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_aae2dc65d9ea248d54bf39daa986dd295"><div class="ttname"><a href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a></div><div class="ttdeci">#define DCHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00895">base/logging.h:895</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_ab62f5ed8f2d48e29802be0cbbcd1359a"><div class="ttname"><a href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a></div><div class="ttdeci">#define DCHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00894">base/logging.h:894</a></div></div>
<div class="ttc" id="aclass_dense_connected_components_finder_html_a428ab6b7c944afe33bd86a6a1ae7e668"><div class="ttname"><a href="class_dense_connected_components_finder.html#a428ab6b7c944afe33bd86a6a1ae7e668">DenseConnectedComponentsFinder::AddEdge</a></div><div class="ttdeci">bool AddEdge(int node1, int node2)</div><div class="ttdef"><b>Definition:</b> <a href="connected__components_8cc_source.html#l00096">connected_components.cc:96</a></div></div>
<div class="ttc" id="aclass_dense_connected_components_finder_html_a5484947d25c2901c60d02ea14d0e1a06"><div class="ttname"><a href="class_dense_connected_components_finder.html#a5484947d25c2901c60d02ea14d0e1a06">DenseConnectedComponentsFinder::FindRoot</a></div><div class="ttdeci">int FindRoot(int node)</div><div class="ttdef"><b>Definition:</b> <a href="connected__components_8cc_source.html#l00054">connected_components.cc:54</a></div></div>
<div class="ttc" id="aclass_dense_connected_components_finder_html_a74aadb96adc6f37110393d5fbd2279c5"><div class="ttname"><a href="class_dense_connected_components_finder.html#a74aadb96adc6f37110393d5fbd2279c5">DenseConnectedComponentsFinder::GetComponentIds</a></div><div class="ttdeci">std::vector&lt; int &gt; GetComponentIds()</div><div class="ttdef"><b>Definition:</b> <a href="connected__components_8cc_source.html#l00149">connected_components.cc:149</a></div></div>
<div class="ttc" id="aclass_dense_connected_components_finder_html_a962b54327591b21cc0a9273f78906a8b"><div class="ttname"><a href="class_dense_connected_components_finder.html#a962b54327591b21cc0a9273f78906a8b">DenseConnectedComponentsFinder::Connected</a></div><div class="ttdeci">bool Connected(int node1, int node2)</div><div class="ttdef"><b>Definition:</b> <a href="connected__components_8cc_source.html#l00134">connected_components.cc:134</a></div></div>
<div class="ttc" id="aclass_dense_connected_components_finder_html_ad8e718920ab9683d39af650d714cffe1"><div class="ttname"><a href="class_dense_connected_components_finder.html#ad8e718920ab9683d39af650d714cffe1">DenseConnectedComponentsFinder::SetNumberOfNodes</a></div><div class="ttdeci">void SetNumberOfNodes(int num_nodes)</div><div class="ttdef"><b>Definition:</b> <a href="connected__components_8cc_source.html#l00036">connected_components.cc:36</a></div></div>
<div class="ttc" id="aclass_dense_connected_components_finder_html_ae6201f6f09303eabd7f77e238b4f3a44"><div class="ttname"><a href="class_dense_connected_components_finder.html#ae6201f6f09303eabd7f77e238b4f3a44">DenseConnectedComponentsFinder::GetComponentRoots</a></div><div class="ttdeci">const std::vector&lt; int &gt; &amp; GetComponentRoots()</div><div class="ttdef"><b>Definition:</b> <a href="connected__components_8cc_source.html#l00073">connected_components.cc:73</a></div></div>
<div class="ttc" id="aclass_dense_connected_components_finder_html_aeeb8b88902830cab41c69ef944b5694f"><div class="ttname"><a href="class_dense_connected_components_finder.html#aeeb8b88902830cab41c69ef944b5694f">DenseConnectedComponentsFinder::GetNumberOfNodes</a></div><div class="ttdeci">int GetNumberOfNodes() const</div><div class="ttdef"><b>Definition:</b> <a href="connected__components_8h_source.html#l00100">connected_components.h:100</a></div></div>
<div class="ttc" id="aclass_dense_connected_components_finder_html_af783278e17675394e30c3de598b11169"><div class="ttname"><a href="class_dense_connected_components_finder.html#af783278e17675394e30c3de598b11169">DenseConnectedComponentsFinder::GetSize</a></div><div class="ttdeci">int GetSize(int node)</div><div class="ttdef"><b>Definition:</b> <a href="connected__components_8cc_source.html#l00142">connected_components.cc:142</a></div></div>
<div class="ttc" id="aconnected__components_8h_html"><div class="ttname"><a href="connected__components_8h.html">connected_components.h</a></div></div>
<div class="ttc" id="anamespacegtl_html_a4afa1e83cd6407fa4b77d49b8c136806"><div class="ttname"><a href="namespacegtl.html#a4afa1e83cd6407fa4b77d49b8c136806">gtl::STLEraseAllFromSequenceIf</a></div><div class="ttdeci">void STLEraseAllFromSequenceIf(T *v, P pred)</div><div class="ttdef"><b>Definition:</b> <a href="stl__util_8h_source.html#l00107">stl_util.h:107</a></div></div>
<div class="ttc" id="astl__util_8h_html"><div class="ttname"><a href="stl__util_8h.html">stl_util.h</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="connected__components_8cc.html">connected_components.cc</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.3 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink