1244 lines
225 KiB
HTML
1244 lines
225 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: find_graph_symmetries.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">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('find__graph__symmetries_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">find_graph_symmetries.cc</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="find__graph__symmetries_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 "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="preprocessor">#include "<a class="code" href="find__graph__symmetries_8h.html">ortools/algorithms/find_graph_symmetries.h</a>"</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span> </div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <numeric></span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span> </div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include "absl/algorithm/container.h"</span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include "absl/container/flat_hash_set.h"</span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include "absl/memory/memory.h"</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "absl/status/status.h"</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include "absl/strings/str_format.h"</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include "absl/strings/str_join.h"</span></div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="preprocessor">#include "absl/time/clock.h"</span></div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="preprocessor">#include "absl/time/time.h"</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="preprocessor">#include "<a class="code" href="dense__doubly__linked__list_8h.html">ortools/algorithms/dense_doubly_linked_list.h</a>"</span></div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="preprocessor">#include "<a class="code" href="dynamic__partition_8h.html">ortools/algorithms/dynamic_partition.h</a>"</span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="preprocessor">#include "<a class="code" href="dynamic__permutation_8h.html">ortools/algorithms/dynamic_permutation.h</a>"</span></div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="preprocessor">#include "<a class="code" href="sparse__permutation_8h.html">ortools/algorithms/sparse_permutation.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="commandlineflags_8h.html">ortools/base/commandlineflags.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="iterators_8h.html">ortools/graph/iterators.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="graph_2util_8h.html">ortools/graph/util.h</a>"</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"><a class="line" href="find__graph__symmetries_8cc.html#a319b3c460e91c76ad49c4589748e4f0c"> 41</a></span><a class="code hl_function" href="find__graph__symmetries_8cc.html#a319b3c460e91c76ad49c4589748e4f0c">ABSL_FLAG</a>(<span class="keywordtype">bool</span>, minimize_permutation_support_size, <span class="keyword">false</span>,</div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="stringliteral">"Tweak the algorithm to try and minimize the support size"</span></div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="stringliteral">" of the generators produced. This may negatively impact the"</span></div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="stringliteral">" performance, but works great on the sat_holeXXX benchmarks"</span></div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="stringliteral">" to reduce the support size."</span>);</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> </div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> </div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span><span class="keyword">using</span> <a class="code hl_function" href="namespaceutil.html#aa94a02ae5c14feb50676668f2de166dc">util::GraphIsSymmetric</a>;</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> </div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span><span class="comment">// Some routines used below.</span></div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span><span class="keywordtype">void</span> SwapFrontAndBack(std::vector<int>* v) {</div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!v->empty());</div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>((*v)[0], v->back());</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span>}</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="keywordtype">bool</span> PartitionsAreCompatibleAfterPartIndex(<span class="keyword">const</span> DynamicPartition& p1,</div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keyword">const</span> DynamicPartition& p2,</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keywordtype">int</span> part_index) {</div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_parts = p1.NumParts();</div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">if</span> (p2.NumParts() != num_parts) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> p = part_index; p < num_parts; ++p) {</div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordflow">if</span> (p1.SizeOfPart(p) != p2.SizeOfPart(p) ||</div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> p1.ParentOfPart(p) != p2.ParentOfPart(p)) {</div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> }</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> }</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span>}</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><span class="comment">// Whether the "l1" list maps to "l2" under the permutation "permutation".</span></div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span><span class="comment">// This method uses a transient bitmask on all the elements, which</span></div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span><span class="comment">// should be entirely false before the call (and will be restored as such</span></div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span><span class="comment">// after it).</span></div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span><span class="comment">// TODO(user): Make this method support multi-elements (i.e. an element may</span></div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span><span class="comment">// be repeated in the list), and see if that's sufficient to make the whole</span></div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span><span class="comment">// graph symmetry finder support multi-arcs.</span></div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span><span class="keyword">template</span> <<span class="keyword">class</span> List></div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span><span class="keywordtype">bool</span> ListMapsToList(<span class="keyword">const</span> List& l1, <span class="keyword">const</span> List& l2,</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keyword">const</span> DynamicPermutation& permutation,</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> std::vector<bool>* tmp_node_mask) {</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordtype">int</span> num_elements_delta = 0;</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordtype">bool</span> match = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> mapped_x : l2) {</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> ++num_elements_delta;</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> (*tmp_node_mask)[mapped_x] = <span class="keyword">true</span>;</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="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> x : l1) {</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> --num_elements_delta;</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keyword">const</span> <span class="keywordtype">int</span> mapped_x = permutation.ImageOf(x);</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keywordflow">if</span> (!(*tmp_node_mask)[mapped_x]) {</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> match = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> }</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> (*tmp_node_mask)[mapped_x] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> }</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordflow">if</span> (num_elements_delta != 0) match = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="keywordflow">if</span> (!match) {</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="comment">// We need to clean up tmp_node_mask.</span></div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> x : l2) (*tmp_node_mask)[x] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> }</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keywordflow">return</span> match;</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span>}</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span>} <span class="comment">// namespace</span></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"><a class="line" href="classoperations__research_1_1_graph_symmetry_finder.html#af0ae1a4d86cfcf11128fe60ea0f8d20b"> 108</a></span><a class="code hl_function" href="classoperations__research_1_1_graph_symmetry_finder.html#af0ae1a4d86cfcf11128fe60ea0f8d20b">GraphSymmetryFinder::GraphSymmetryFinder</a>(<span class="keyword">const</span> <a class="code hl_class" href="classutil_1_1_static_graph.html">Graph</a>& graph, <span class="keywordtype">bool</span> is_undirected)</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> : graph_(graph),</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> tmp_dynamic_permutation_(NumNodes()),</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> tmp_node_mask_(NumNodes(), false),</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> tmp_degree_(NumNodes(), 0),</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> tmp_nodes_with_degree_(NumNodes() + 1) {</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// Set up an "unlimited" time limit by default.</span></div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> time_limit_ = &dummy_time_limit_;</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> tmp_partition_.<a class="code hl_function" href="classoperations__research_1_1_merging_partition.html#a50eca19efa71a0b70de25f9ad4a2a6f8">Reset</a>(NumNodes());</div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keywordflow">if</span> (is_undirected) {</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code hl_function" href="namespaceutil.html#aa94a02ae5c14feb50676668f2de166dc">GraphIsSymmetric</a>(graph));</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="comment">// Compute the reverse adjacency lists.</span></div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="comment">// First pass: compute the total in-degree of all nodes and put it in</span></div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="comment">// reverse_adj_list_index (shifted by two; see below why).</span></div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> reverse_adj_list_index_.assign(graph.<a class="code hl_function" href="classutil_1_1_base_graph.html#a6a2df5042167b234f6dc3aed4acfa6c9">num_nodes</a>() + <span class="comment">/*shift*/</span> 2, 0);</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : graph.<a class="code hl_function" href="classutil_1_1_base_graph.html#a8a40f2c75615a26ba71e94dd7d42f481">AllNodes</a>()) {</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a30b5726116ac85ea64777e5d6e333894">arc</a> : graph.<a class="code hl_function" href="classutil_1_1_static_graph.html#aeacdf885cd6777318b5aa4ef864e1066">OutgoingArcs</a>(node)) {</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> ++reverse_adj_list_index_[graph.<a class="code hl_function" href="classutil_1_1_static_graph.html#aceb0938bcb2e8e5f37986d4cf8e3a955">Head</a>(<a class="code hl_variable" href="local__search_8cc.html#a30b5726116ac85ea64777e5d6e333894">arc</a>) + <span class="comment">/*shift*/</span> 2];</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> }</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> }</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="comment">// Second pass: apply a cumulative sum over reverse_adj_list_index.</span></div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="comment">// After that, reverse_adj_list contains:</span></div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="comment">// [0, 0, in_degree(node0), in_degree(node0) + in_degree(node1), ...]</span></div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> std::partial_sum(reverse_adj_list_index_.begin() + <span class="comment">/*shift*/</span> 2,</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> reverse_adj_list_index_.end(),</div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> reverse_adj_list_index_.begin() + <span class="comment">/*shift*/</span> 2);</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="comment">// Third pass: populate "flattened_reverse_adj_lists", using</span></div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="comment">// reverse_adj_list_index[i] as a dynamic pointer to the yet-unpopulated</span></div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="comment">// area of the reverse adjacency list of node #i.</span></div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> flattened_reverse_adj_lists_.assign(graph.<a class="code hl_function" href="classutil_1_1_base_graph.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a>(), -1);</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : graph.<a class="code hl_function" href="classutil_1_1_base_graph.html#a8a40f2c75615a26ba71e94dd7d42f481">AllNodes</a>()) {</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a30b5726116ac85ea64777e5d6e333894">arc</a> : graph.<a class="code hl_function" href="classutil_1_1_static_graph.html#aeacdf885cd6777318b5aa4ef864e1066">OutgoingArcs</a>(node)) {</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> flattened_reverse_adj_lists_[reverse_adj_list_index_[graph.<a class="code hl_function" href="classutil_1_1_static_graph.html#aceb0938bcb2e8e5f37986d4cf8e3a955">Head</a>(<a class="code hl_variable" href="local__search_8cc.html#a30b5726116ac85ea64777e5d6e333894">arc</a>) +</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="comment">/*shift*/</span> 1]++] =</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> node;</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> }</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="comment">// The last pass shifted reverse_adj_list_index, so it's now as we want it:</span></div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="comment">// [0, in_degree(node0), in_degree(node0) + in_degree(node1), ...]</span></div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(graph.<a class="code hl_function" href="classutil_1_1_base_graph.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a>(), reverse_adj_list_index_[graph.<a class="code hl_function" href="classutil_1_1_base_graph.html#a6a2df5042167b234f6dc3aed4acfa6c9">num_nodes</a>()]);</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> i : flattened_reverse_adj_lists_) <a class="code hl_define" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(i, -1);</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> }</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> }</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span>}</div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> </div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_graph_symmetry_finder.html#a998043f7ad1e35dc5f6cb23e18f6e7dd"> 155</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_graph_symmetry_finder.html#a998043f7ad1e35dc5f6cb23e18f6e7dd">GraphSymmetryFinder::IsGraphAutomorphism</a>(</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_dynamic_permutation.html">DynamicPermutation</a>& permutation)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> base : permutation.<a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#afc48707ddd63d0978b9cfcd17c704694">AllMappingsSrc</a>()) {</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="keyword">const</span> <span class="keywordtype">int</span> image = permutation.<a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#a1976819faa164a8d10a66200dc2c3a96">ImageOf</a>(base);</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="keywordflow">if</span> (image == base) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <span class="keywordflow">if</span> (!ListMapsToList(graph_[base], graph_[image], permutation,</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> &tmp_node_mask_)) {</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> }</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> }</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <span class="keywordflow">if</span> (!reverse_adj_list_index_.empty()) {</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <span class="comment">// The graph was not symmetric: we must also check the incoming arcs</span></div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> <span class="comment">// to displaced nodes.</span></div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> base : permutation.<a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#afc48707ddd63d0978b9cfcd17c704694">AllMappingsSrc</a>()) {</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="keyword">const</span> <span class="keywordtype">int</span> image = permutation.<a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#a1976819faa164a8d10a66200dc2c3a96">ImageOf</a>(base);</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <span class="keywordflow">if</span> (image == base) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="keywordflow">if</span> (!ListMapsToList(TailsOfIncomingArcsTo(base),</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> TailsOfIncomingArcsTo(image), permutation,</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> &tmp_node_mask_)) {</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> }</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> }</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> }</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span>}</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="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span><span class="comment">// Specialized subroutine, to avoid code duplication: see its call site</span></div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span><span class="comment">// and its self-explanatory code.</span></div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span><span class="keyword">template</span> <<span class="keyword">class</span> T></div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span><span class="keyword">inline</span> <span class="keywordtype">void</span> IncrementCounterForNonSingletons(<span class="keyword">const</span> T& <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>,</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_dynamic_partition.html">DynamicPartition</a>& partition,</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> std::vector<int>* node_count,</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> std::vector<int>* nodes_seen,</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> int64_t* num_operations) {</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> *num_operations += <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.end() - <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.begin();</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>) {</div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <span class="keywordflow">if</span> (partition.<a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#a897ee69dceefdd60a6a4e90ab8b18a25">ElementsInSamePartAs</a>(node).<a class="code hl_function" href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#af9593d4a5ff4274efaf429cb4f9e57cc">size</a>() == 1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <span class="keyword">const</span> <span class="keywordtype">int</span> count = ++(*node_count)[node];</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <span class="keywordflow">if</span> (count == 1) nodes_seen->push_back(node);</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> }</div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span>}</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span>} <span class="comment">// namespace</span></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"><a class="line" href="classoperations__research_1_1_graph_symmetry_finder.html#a651a63b1943d8b8fa2346df1d1a2f55c"> 199</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_graph_symmetry_finder.html#a651a63b1943d8b8fa2346df1d1a2f55c">GraphSymmetryFinder::RecursivelyRefinePartitionByAdjacency</a>(</div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="keywordtype">int</span> first_unrefined_part_index, <a class="code hl_class" href="classoperations__research_1_1_dynamic_partition.html">DynamicPartition</a>* partition) {</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <span class="comment">// Rename, for readability of the code below.</span></div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> std::vector<int>& tmp_nodes_with_nonzero_degree = tmp_stack_;</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">// This function is the main bottleneck of the whole algorithm. We count the</span></div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <span class="comment">// number of blocks in the inner-most loops in num_operations. At the end we</span></div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="comment">// will multiply it by a factor to have some deterministic time that we will</span></div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <span class="comment">// append to the deterministic time counter.</span></div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> <span class="comment">// TODO(user): We are really imprecise in our counting, but it is fine. We</span></div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <span class="comment">// just need a way to enforce a deterministic limit on the computation effort.</span></div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> int64_t num_operations = 0;</div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> </div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> <span class="comment">// Assuming that the partition was refined based on the adjacency on</span></div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="comment">// parts [0 .. first_unrefined_part_index) already, we simply need to</span></div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="comment">// refine parts first_unrefined_part_index ... NumParts()-1, the latter bound</span></div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="comment">// being a moving target:</span></div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <span class="comment">// When a part #p < first_unrefined_part_index gets modified, it's always</span></div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> <span class="comment">// split in two: itself, and a new part #p'. Since #p was already refined</span></div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <span class="comment">// on, we only need to further refine on *one* of its two split parts.</span></div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <span class="comment">// And this will be done because p' > first_unrefined_part_index.</span></div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="comment">// Thus, the following loop really does the full recursive refinement as</span></div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <span class="comment">// advertised.</span></div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> std::vector<bool> adjacency_directions(1, <span class="comment">/*outgoing*/</span> <span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <span class="keywordflow">if</span> (!reverse_adj_list_index_.empty()) {</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> adjacency_directions.push_back(<span class="keyword">false</span>); <span class="comment">// Also look at incoming arcs.</span></div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> }</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> part_index = first_unrefined_part_index;</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> part_index < partition-><a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#ae91b7d9b6c4f0675b9ad3f38e5761853">NumParts</a>(); <span class="comment">// Moving target!</span></div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> ++part_index) {</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">bool</span> outgoing_adjacency : adjacency_directions) {</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <span class="comment">// Count the aggregated degree of all nodes, only looking at arcs that</span></div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <span class="comment">// come from/to the current part.</span></div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> <span class="keywordflow">if</span> (outgoing_adjacency) {</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : partition-><a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#a11ea4d0620bbdca30b7d9b8a23f8cdd8">ElementsInPart</a>(part_index)) {</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> IncrementCounterForNonSingletons(</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> graph_[node], *partition, &tmp_degree_,</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> &tmp_nodes_with_nonzero_degree, &num_operations);</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="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : partition-><a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#a11ea4d0620bbdca30b7d9b8a23f8cdd8">ElementsInPart</a>(part_index)) {</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> IncrementCounterForNonSingletons(</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> TailsOfIncomingArcsTo(node), *partition, &tmp_degree_,</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> &tmp_nodes_with_nonzero_degree, &num_operations);</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> }</div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> }</div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> <span class="comment">// Group the nodes by (nonzero) degree. Remember the maximum degree.</span></div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <span class="keywordtype">int</span> max_degree = 0;</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> num_operations += 3 + tmp_nodes_with_nonzero_degree.size();</div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : tmp_nodes_with_nonzero_degree) {</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="keyword">const</span> <span class="keywordtype">int</span> degree = tmp_degree_[node];</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> tmp_degree_[node] = 0; <span class="comment">// To clean up after us.</span></div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> max_degree = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_degree, degree);</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> tmp_nodes_with_degree_[degree].push_back(node);</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> }</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> tmp_nodes_with_nonzero_degree.clear(); <span class="comment">// To clean up after us.</span></div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <span class="comment">// For each degree, refine the partition by the set of nodes with that</span></div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> <span class="comment">// degree.</span></div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> degree = 1; degree <= max_degree; ++degree) {</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="comment">// We use a manually tuned factor 3 because Refine() does quite a bit of</span></div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> <span class="comment">// operations for each node in its argument.</span></div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> num_operations += 1 + 3 * tmp_nodes_with_degree_[degree].size();</div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> partition-><a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#a32f3aa9643111b05108d1120e48c1e13">Refine</a>(tmp_nodes_with_degree_[degree]);</div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> tmp_nodes_with_degree_[degree].clear(); <span class="comment">// To clean up after us.</span></div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> }</div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> }</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">// The coefficient was manually tuned (only on a few instances) so that the</span></div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> <span class="comment">// time is roughly correlated with seconds on a fast desktop computer from</span></div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> <span class="comment">// 2020.</span></div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> time_limit_-><a class="code hl_function" href="classoperations__research_1_1_time_limit.html#af90cfd1fc238433fc303ee28c5914eb9">AdvanceDeterministicTime</a>(1e-8 *</div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> <span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(num_operations));</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> </div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_graph_symmetry_finder.html#acb28211fa0581e72d3dcb6b43ebe857a"> 276</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_graph_symmetry_finder.html#acb28211fa0581e72d3dcb6b43ebe857a">GraphSymmetryFinder::DistinguishNodeInPartition</a>(</div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> <span class="keywordtype">int</span> node, <a class="code hl_class" href="classoperations__research_1_1_dynamic_partition.html">DynamicPartition</a>* partition, std::vector<int>* new_singletons) {</div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="keyword">const</span> <span class="keywordtype">int</span> original_num_parts = partition-><a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#ae91b7d9b6c4f0675b9ad3f38e5761853">NumParts</a>();</div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> partition-><a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#a32f3aa9643111b05108d1120e48c1e13">Refine</a>(std::vector<int>(1, node));</div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <a class="code hl_function" href="classoperations__research_1_1_graph_symmetry_finder.html#a651a63b1943d8b8fa2346df1d1a2f55c">RecursivelyRefinePartitionByAdjacency</a>(partition-><a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#ab22d95d31ef6edfd5a6770ff6d8c4f04">PartOf</a>(node), partition);</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> <span class="comment">// Explore the newly refined parts to gather all the new singletons.</span></div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> <span class="keywordflow">if</span> (new_singletons != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> new_singletons->clear();</div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> p = original_num_parts; p < partition-><a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#ae91b7d9b6c4f0675b9ad3f38e5761853">NumParts</a>(); ++p) {</div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <span class="keyword">const</span> <span class="keywordtype">int</span> parent = partition-><a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#ab8257c32911b0b991bec1af210d993be">ParentOfPart</a>(p);</div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="comment">// We may see the same singleton parent several times, so we guard them</span></div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <span class="comment">// with the tmp_node_mask_ boolean vector.</span></div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> <span class="keywordflow">if</span> (!tmp_node_mask_[parent] && parent < original_num_parts &&</div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> partition-><a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#a5634a596b0aa63843c28e8ed69e653ca">SizeOfPart</a>(parent) == 1) {</div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> tmp_node_mask_[parent] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> new_singletons->push_back(*partition-><a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#a11ea4d0620bbdca30b7d9b8a23f8cdd8">ElementsInPart</a>(parent).<a class="code hl_function" href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#a895e8e66079521889215308182c5591b">begin</a>());</div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> }</div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <span class="keywordflow">if</span> (partition-><a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#a5634a596b0aa63843c28e8ed69e653ca">SizeOfPart</a>(p) == 1) {</div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> new_singletons->push_back(*partition-><a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#a11ea4d0620bbdca30b7d9b8a23f8cdd8">ElementsInPart</a>(p).<a class="code hl_function" href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#a895e8e66079521889215308182c5591b">begin</a>());</div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> }</div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> }</div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> <span class="comment">// Reset tmp_node_mask_.</span></div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> p = original_num_parts; p < partition-><a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#ae91b7d9b6c4f0675b9ad3f38e5761853">NumParts</a>(); ++p) {</div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> tmp_node_mask_[partition-><a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#ab8257c32911b0b991bec1af210d993be">ParentOfPart</a>(p)] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> }</div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> }</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="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span><span class="keywordtype">void</span> MergeNodeEquivalenceClassesAccordingToPermutation(</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_sparse_permutation.html">SparsePermutation</a>& perm, <a class="code hl_class" href="classoperations__research_1_1_merging_partition.html">MergingPartition</a>* node_equivalence_classes,</div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> <a class="code hl_class" href="classoperations__research_1_1_dense_doubly_linked_list.html">DenseDoublyLinkedList</a>* sorted_representatives) {</div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> c = 0; c < perm.<a class="code hl_function" href="classoperations__research_1_1_sparse_permutation.html#a8c5fc5af6e649a82d169f61e4dab5e33">NumCycles</a>(); ++c) {</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> <span class="comment">// TODO(user): use the global element->image iterator when it exists.</span></div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> <span class="keywordtype">int</span> prev = -1;</div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> e : perm.<a class="code hl_function" href="classoperations__research_1_1_sparse_permutation.html#af567b4e287e268eb9ecee908f63e5b64">Cycle</a>(c)) {</div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> <span class="keywordflow">if</span> (prev >= 0) {</div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> <span class="keyword">const</span> <span class="keywordtype">int</span> removed_representative =</div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> node_equivalence_classes-><a class="code hl_function" href="classoperations__research_1_1_merging_partition.html#a612bd8d97219124a8d6fbac721bcdbc6">MergePartsOf</a>(prev, e);</div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> <span class="keywordflow">if</span> (sorted_representatives != <span class="keyword">nullptr</span> && removed_representative != -1) {</div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> sorted_representatives-><a class="code hl_function" href="classoperations__research_1_1_dense_doubly_linked_list.html#a209f8799ca534e48c873a6613131d358">Remove</a>(removed_representative);</div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> }</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> prev = e;</div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> }</div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> }</div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span>}</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">// Subroutine used by FindSymmetries(); see its call site. This finds and</span></div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span><span class="comment">// outputs (in "pruned_other_nodes") the list of all representatives (under</span></div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span><span class="comment">// "node_equivalence_classes") that are in the same part as</span></div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span><span class="comment">// "representative_node" in "partition"; other than "representative_node"</span></div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span><span class="comment">// itself.</span></div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span><span class="comment">// "node_equivalence_classes" must be compatible with "partition", i.e. two</span></div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span><span class="comment">// nodes that are in the same equivalence class must also be in the same part.</span></div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span><span class="comment">// To do this in O(output size), we also need the</span></div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span><span class="comment">// "representatives_sorted_by_index_in_partition" data structure: the</span></div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span><span class="comment">// representatives of the nodes of the targeted part are contiguous in that</span></div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span><span class="comment">// linked list.</span></div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span><span class="keywordtype">void</span> GetAllOtherRepresentativesInSamePartAs(</div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> <span class="keywordtype">int</span> representative_node, <span class="keyword">const</span> DynamicPartition& partition,</div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> <span class="keyword">const</span> DenseDoublyLinkedList& representatives_sorted_by_index_in_partition,</div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> MergingPartition* node_equivalence_classes, <span class="comment">// Only for debugging.</span></div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> std::vector<int>* pruned_other_nodes) {</div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> pruned_other_nodes->clear();</div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> <span class="keyword">const</span> <span class="keywordtype">int</span> part_index = partition.PartOf(representative_node);</div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> <span class="comment">// Iterate on all contiguous representatives after the initial one...</span></div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> <span class="keywordtype">int</span> repr = representative_node;</div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(repr, node_equivalence_classes->GetRoot(repr));</div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> repr = representatives_sorted_by_index_in_partition.Prev(repr);</div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> <span class="keywordflow">if</span> (repr < 0 || partition.PartOf(repr) != part_index) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> pruned_other_nodes->push_back(repr);</div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> }</div>
|
|
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> <span class="comment">// ... and then on all contiguous representatives *before* it.</span></div>
|
|
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> repr = representative_node;</div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(repr, node_equivalence_classes->GetRoot(repr));</div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> repr = representatives_sorted_by_index_in_partition.Next(repr);</div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> <span class="keywordflow">if</span> (repr < 0 || partition.PartOf(repr) != part_index) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> pruned_other_nodes->push_back(repr);</div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</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 code is a bit tricky, so we check that we're doing it right, by</span></div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> <span class="comment">// comparing its output to the brute-force, O(Part size) version.</span></div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> <span class="comment">// This also (partly) verifies that</span></div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> <span class="comment">// "representatives_sorted_by_index_in_partition" is what it claims it is.</span></div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> std::vector<int> expected_output;</div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> e : partition.ElementsInPart(part_index)) {</div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> <span class="keywordflow">if</span> (node_equivalence_classes->GetRoot(e) != representative_node) {</div>
|
|
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> expected_output.push_back(e);</div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> }</div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> }</div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> node_equivalence_classes->KeepOnlyOneNodePerPart(&expected_output);</div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span>& x : expected_output) x = node_equivalence_classes->GetRoot(x);</div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> std::sort(expected_output.begin(), expected_output.end());</div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> std::vector<int> sorted_output = *pruned_other_nodes;</div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> std::sort(sorted_output.begin(), sorted_output.end());</div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(absl::StrJoin(expected_output, <span class="stringliteral">" "</span>),</div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> absl::StrJoin(sorted_output, <span class="stringliteral">" "</span>));</div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</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">// namespace</span></div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> </div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_graph_symmetry_finder.html#ad1f88654797ab9271206d6a4c013a94e"> 383</a></span>absl::Status <a class="code hl_function" href="classoperations__research_1_1_graph_symmetry_finder.html#ad1f88654797ab9271206d6a4c013a94e">GraphSymmetryFinder::FindSymmetries</a>(</div>
|
|
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span> std::vector<int>* node_equivalence_classes_io,</div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> std::vector<std::unique_ptr<SparsePermutation>>* generators,</div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> std::vector<int>* factorized_automorphism_group_size,</div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> <a class="code hl_class" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* <a class="code hl_variable" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>) {</div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> <span class="comment">// Initialization.</span></div>
|
|
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> time_limit_ = <a class="code hl_variable" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a> == <span class="keyword">nullptr</span> ? &dummy_time_limit_ : <a class="code hl_variable" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>;</div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> <a class="code hl_define" href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a>(stats_.initialization_time.StartTimer());</div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> generators->clear();</div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> factorized_automorphism_group_size->clear();</div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> <span class="keywordflow">if</span> (node_equivalence_classes_io->size() != NumNodes()) {</div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> <span class="keywordflow">return</span> absl::Status(absl::StatusCode::kInvalidArgument,</div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> <span class="stringliteral">"Invalid 'node_equivalence_classes_io'."</span>);</div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> }</div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> <a class="code hl_class" href="classoperations__research_1_1_dynamic_partition.html">DynamicPartition</a> base_partition(*node_equivalence_classes_io);</div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> <span class="comment">// Break all inherent asymmetries in the graph.</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> <a class="code hl_class" href="classoperations__research_1_1_disabled_scoped_time_distribution_updater.html">ScopedTimeDistributionUpdater</a> u(&stats_.initialization_refine_time);</div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> <a class="code hl_function" href="classoperations__research_1_1_graph_symmetry_finder.html#a651a63b1943d8b8fa2346df1d1a2f55c">RecursivelyRefinePartitionByAdjacency</a>(<span class="comment">/*first_unrefined_part_index=*/</span>0,</div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> &base_partition);</div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> }</div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> <span class="keywordflow">if</span> (time_limit_-><a class="code hl_function" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>()) {</div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> <span class="keywordflow">return</span> absl::Status(absl::StatusCode::kDeadlineExceeded,</div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> <span class="stringliteral">"During the initial refinement."</span>);</div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> }</div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(4) << <span class="stringliteral">"Base partition: "</span></div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> << base_partition.<a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#ad07c56b1579801daaf3a9a750d26e792">DebugString</a>(<a class="code hl_enumvalue" href="classoperations__research_1_1_dynamic_partition.html#a5d89f8571b04ded41d29edffdb479199a6f2cdeb376ad23fd9f0d1164c25a0306">DynamicPartition::SORT_BY_PART</a>);</div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> </div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> <a class="code hl_class" href="classoperations__research_1_1_merging_partition.html">MergingPartition</a> node_equivalence_classes(NumNodes());</div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> std::vector<std::vector<int>> permutations_displacing_node(NumNodes());</div>
|
|
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> std::vector<int> potential_root_image_nodes;</div>
|
|
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span> <a class="code hl_define" href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a>(stats_.initialization_time.StopTimerAndAddElapsedTime());</div>
|
|
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> </div>
|
|
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> <span class="comment">// To find all permutations of the Graph that satisfy the current partition,</span></div>
|
|
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> <span class="comment">// we pick an element v that is not in a singleton part, and we</span></div>
|
|
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> <span class="comment">// split the search in two phases:</span></div>
|
|
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> <span class="comment">// 1) Find (the generators of) all permutations that keep v invariant.</span></div>
|
|
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> <span class="comment">// 2) For each w in PartOf(v) such that w != v:</span></div>
|
|
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> <span class="comment">// find *one* permutation that maps v to w, if it exists.</span></div>
|
|
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span> <span class="comment">// if it does exists, add this to the generators.</span></div>
|
|
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno"> 424</span> <span class="comment">// The part 1) is recursive.</span></div>
|
|
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> <span class="comment">// Since we can't really use true recursion because it will be too deep for</span></div>
|
|
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> <span class="comment">// the stack, we implement it iteratively. To do that, we unroll 1):</span></div>
|
|
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> <span class="comment">// the "invariant dive" is a single pass that successively refines the node</span></div>
|
|
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> <span class="comment">// base_partition with elements from non-singleton parts (the 'invariant</span></div>
|
|
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> <span class="comment">// node'), until all parts are singletons.</span></div>
|
|
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> <span class="comment">// We remember which nodes we picked as invariants, and also the successive</span></div>
|
|
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> <span class="comment">// partition sizes as we refine it, to allow us to backtrack.</span></div>
|
|
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> <span class="comment">// Then we'll perform 2) in the reverse order, backtracking the stack from 1)</span></div>
|
|
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> <span class="comment">// as using another dedicated stack for the search (see below).</span></div>
|
|
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> <a class="code hl_define" href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a>(stats_.invariant_dive_time.StartTimer());</div>
|
|
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> <span class="keyword">struct </span>InvariantDiveState {</div>
|
|
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> <span class="keywordtype">int</span> invariant_node;</div>
|
|
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span> <span class="keywordtype">int</span> num_parts_before_refinement;</div>
|
|
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> </div>
|
|
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span> InvariantDiveState(<span class="keywordtype">int</span> node, <span class="keywordtype">int</span> num_parts)</div>
|
|
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> : invariant_node(node), num_parts_before_refinement(num_parts) {}</div>
|
|
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> };</div>
|
|
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> std::vector<InvariantDiveState> invariant_dive_stack;</div>
|
|
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> <span class="comment">// TODO(user): experiment with, and briefly describe the results of various</span></div>
|
|
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> <span class="comment">// algorithms for picking the invariant node:</span></div>
|
|
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> <span class="comment">// - random selection</span></div>
|
|
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"> 447</span> <span class="comment">// - highest/lowest degree first</span></div>
|
|
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span> <span class="comment">// - enumerate by part index; or by part size</span></div>
|
|
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> <span class="comment">// - etc.</span></div>
|
|
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> invariant_node = 0; invariant_node < NumNodes(); ++invariant_node) {</div>
|
|
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</span> <span class="keywordflow">if</span> (base_partition.<a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#a897ee69dceefdd60a6a4e90ab8b18a25">ElementsInSamePartAs</a>(invariant_node).<a class="code hl_function" href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#af9593d4a5ff4274efaf429cb4f9e57cc">size</a>() == 1) {</div>
|
|
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"> 452</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span> }</div>
|
|
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span> invariant_dive_stack.push_back(</div>
|
|
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"> 455</span> InvariantDiveState(invariant_node, base_partition.<a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#ae91b7d9b6c4f0675b9ad3f38e5761853">NumParts</a>()));</div>
|
|
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span> <a class="code hl_function" href="classoperations__research_1_1_graph_symmetry_finder.html#acb28211fa0581e72d3dcb6b43ebe857a">DistinguishNodeInPartition</a>(invariant_node, &base_partition, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"> 457</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(4) << <span class="stringliteral">"Invariant dive: invariant node = "</span> << invariant_node</div>
|
|
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> << <span class="stringliteral">"; partition after: "</span></div>
|
|
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> << base_partition.<a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#ad07c56b1579801daaf3a9a750d26e792">DebugString</a>(<a class="code hl_enumvalue" href="classoperations__research_1_1_dynamic_partition.html#a5d89f8571b04ded41d29edffdb479199a6f2cdeb376ad23fd9f0d1164c25a0306">DynamicPartition::SORT_BY_PART</a>);</div>
|
|
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span> <span class="keywordflow">if</span> (time_limit_-><a class="code hl_function" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>()) {</div>
|
|
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> <span class="keywordflow">return</span> absl::Status(absl::StatusCode::kDeadlineExceeded,</div>
|
|
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> <span class="stringliteral">"During the invariant dive."</span>);</div>
|
|
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> }</div>
|
|
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> }</div>
|
|
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> <a class="code hl_class" href="classoperations__research_1_1_dense_doubly_linked_list.html">DenseDoublyLinkedList</a> representatives_sorted_by_index_in_partition(</div>
|
|
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> base_partition.<a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#ad8a3eb5fa76f501ec96f1664fc899c3b">ElementsInHierarchicalOrder</a>());</div>
|
|
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> <a class="code hl_class" href="classoperations__research_1_1_dynamic_partition.html">DynamicPartition</a> image_partition = base_partition;</div>
|
|
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> <a class="code hl_define" href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a>(stats_.invariant_dive_time.StopTimerAndAddElapsedTime());</div>
|
|
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> <span class="comment">// Now we've dived to the bottom: we're left with the identity permutation,</span></div>
|
|
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"> 470</span> <span class="comment">// which we don't need as a generator. We move on to phase 2).</span></div>
|
|
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span> </div>
|
|
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> <a class="code hl_define" href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a>(stats_.main_search_time.StartTimer());</div>
|
|
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> <span class="keywordflow">while</span> (!invariant_dive_stack.empty()) {</div>
|
|
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno"> 474</span> <span class="keywordflow">if</span> (time_limit_-><a class="code hl_function" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>()) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"> 475</span> <span class="comment">// Backtrack the last step of 1) (the invariant dive).</span></div>
|
|
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno"> 476</span> <a class="code hl_define" href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a>(stats_.invariant_unroll_time.StartTimer());</div>
|
|
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span> <span class="keyword">const</span> <span class="keywordtype">int</span> root_node = invariant_dive_stack.back().invariant_node;</div>
|
|
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> <span class="keyword">const</span> <span class="keywordtype">int</span> base_num_parts =</div>
|
|
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"> 479</span> invariant_dive_stack.back().num_parts_before_refinement;</div>
|
|
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"> 480</span> invariant_dive_stack.pop_back();</div>
|
|
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span> base_partition.<a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#a59a35941a5a6eb3747faddb449a49e2a">UndoRefineUntilNumPartsEqual</a>(base_num_parts);</div>
|
|
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> image_partition.<a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#a59a35941a5a6eb3747faddb449a49e2a">UndoRefineUntilNumPartsEqual</a>(base_num_parts);</div>
|
|
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(4) << <span class="stringliteral">"Backtracking invariant dive: root node = "</span> << root_node</div>
|
|
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> << <span class="stringliteral">"; partition: "</span></div>
|
|
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> << base_partition.<a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#ad07c56b1579801daaf3a9a750d26e792">DebugString</a>(<a class="code hl_enumvalue" href="classoperations__research_1_1_dynamic_partition.html#a5d89f8571b04ded41d29edffdb479199a6f2cdeb376ad23fd9f0d1164c25a0306">DynamicPartition::SORT_BY_PART</a>);</div>
|
|
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> </div>
|
|
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> <span class="comment">// Now we'll try to map "root_node" to all image nodes that seem compatible</span></div>
|
|
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> <span class="comment">// and that aren't "root_node" itself.</span></div>
|
|
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> <span class="comment">// Doing so, we're able to detect potential bad (or good) matches by</span></div>
|
|
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span> <span class="comment">// refining the 'base' partition with "root_node"; and refining the</span></div>
|
|
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> <span class="comment">// 'image' partition (which represents the partition of images nodes,</span></div>
|
|
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"> 493</span> <span class="comment">// i.e. the nodes after applying the currently implicit permutation)</span></div>
|
|
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> <span class="comment">// with that candidate image node: if the two partitions don't match, then</span></div>
|
|
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> <span class="comment">// the candidate image isn't compatible.</span></div>
|
|
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> <span class="comment">// If the partitions do match, we might either find the underlying</span></div>
|
|
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> <span class="comment">// permutation directly, or we might need to further try and map other</span></div>
|
|
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span> <span class="comment">// nodes to their image: this is a recursive search with backtracking.</span></div>
|
|
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span> </div>
|
|
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno"> 500</span> <span class="comment">// The potential images of root_node are the nodes in its part. They can be</span></div>
|
|
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno"> 501</span> <span class="comment">// pruned by the already computed equivalence classes.</span></div>
|
|
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno"> 502</span> <span class="comment">// TODO(user): better elect the representative of each equivalence class</span></div>
|
|
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno"> 503</span> <span class="comment">// in order to reduce the permutation support down the line</span></div>
|
|
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"> 504</span> <span class="comment">// TODO(user): Don't build a list; but instead use direct, inline iteration</span></div>
|
|
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"> 505</span> <span class="comment">// on the representatives in the while() loop below, to benefit from the</span></div>
|
|
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</span> <span class="comment">// incremental merging of the equivalence classes.</span></div>
|
|
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno"> 507</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(1, node_equivalence_classes.<a class="code hl_function" href="classoperations__research_1_1_merging_partition.html#a3d5f7b1e62f42b574085e671ae6dfb73">NumNodesInSamePartAs</a>(root_node));</div>
|
|
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno"> 508</span> GetAllOtherRepresentativesInSamePartAs(</div>
|
|
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno"> 509</span> root_node, base_partition, representatives_sorted_by_index_in_partition,</div>
|
|
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"> 510</span> &node_equivalence_classes, &potential_root_image_nodes);</div>
|
|
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"> 511</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!potential_root_image_nodes.empty());</div>
|
|
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno"> 512</span> <a class="code hl_define" href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a>(stats_.invariant_unroll_time.StopTimerAndAddElapsedTime());</div>
|
|
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span> </div>
|
|
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno"> 514</span> <span class="comment">// Try to map "root_node" to all of its potential images. For each image,</span></div>
|
|
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"> 515</span> <span class="comment">// we only care about finding a single compatible permutation, if it exists.</span></div>
|
|
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno"> 516</span> <span class="keywordflow">while</span> (!potential_root_image_nodes.empty()) {</div>
|
|
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno"> 517</span> <span class="keywordflow">if</span> (time_limit_-><a class="code hl_function" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>()) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno"> 518</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(4) << <span class="stringliteral">"Potential (pruned) images of root node "</span> << root_node</div>
|
|
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"> 519</span> << <span class="stringliteral">" left: ["</span> << absl::StrJoin(potential_root_image_nodes, <span class="stringliteral">" "</span>)</div>
|
|
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"> 520</span> << <span class="stringliteral">"]."</span>;</div>
|
|
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno"> 521</span> <span class="keyword">const</span> <span class="keywordtype">int</span> root_image_node = potential_root_image_nodes.back();</div>
|
|
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno"> 522</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(4) << <span class="stringliteral">"Trying image of root node: "</span> << root_image_node;</div>
|
|
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno"> 523</span> </div>
|
|
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno"> 524</span> std::unique_ptr<SparsePermutation> permutation =</div>
|
|
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"> 525</span> FindOneSuitablePermutation(root_node, root_image_node,</div>
|
|
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno"> 526</span> &base_partition, &image_partition,</div>
|
|
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno"> 527</span> *generators, permutations_displacing_node);</div>
|
|
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno"> 528</span> </div>
|
|
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno"> 529</span> <span class="keywordflow">if</span> (permutation != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno"> 530</span> <a class="code hl_class" href="classoperations__research_1_1_disabled_scoped_time_distribution_updater.html">ScopedTimeDistributionUpdater</a> u(&stats_.permutation_output_time);</div>
|
|
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno"> 531</span> <span class="comment">// We found a permutation. We store it in the list of generators, and</span></div>
|
|
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno"> 532</span> <span class="comment">// further prune out the remaining 'root' image candidates, taking into</span></div>
|
|
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno"> 533</span> <span class="comment">// account the permutation we just found.</span></div>
|
|
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno"> 534</span> MergeNodeEquivalenceClassesAccordingToPermutation(</div>
|
|
<div class="line"><a id="l00535" name="l00535"></a><span class="lineno"> 535</span> *permutation, &node_equivalence_classes,</div>
|
|
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno"> 536</span> &representatives_sorted_by_index_in_partition);</div>
|
|
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"> 537</span> <span class="comment">// HACK(user): to make sure that we keep root_image_node as the</span></div>
|
|
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno"> 538</span> <span class="comment">// representant of its part, we temporarily move it to the front</span></div>
|
|
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno"> 539</span> <span class="comment">// of the vector, then move it again to the back so that it gets</span></div>
|
|
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno"> 540</span> <span class="comment">// deleted by the pop_back() below.</span></div>
|
|
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno"> 541</span> SwapFrontAndBack(&potential_root_image_nodes);</div>
|
|
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno"> 542</span> node_equivalence_classes.<a class="code hl_function" href="classoperations__research_1_1_merging_partition.html#a80761f181b521aa284b7e687776b9fde">KeepOnlyOneNodePerPart</a>(</div>
|
|
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno"> 543</span> &potential_root_image_nodes);</div>
|
|
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno"> 544</span> SwapFrontAndBack(&potential_root_image_nodes);</div>
|
|
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno"> 545</span> </div>
|
|
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno"> 546</span> <span class="comment">// Register it onto the permutations_displacing_node vector.</span></div>
|
|
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"> 547</span> <span class="keyword">const</span> <span class="keywordtype">int</span> permutation_index = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(generators->size());</div>
|
|
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno"> 548</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : permutation->Support()) {</div>
|
|
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"> 549</span> permutations_displacing_node[node].push_back(permutation_index);</div>
|
|
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno"> 550</span> }</div>
|
|
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"> 551</span> </div>
|
|
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno"> 552</span> <span class="comment">// Move the permutation to the generator list (this also transfers</span></div>
|
|
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno"> 553</span> <span class="comment">// ownership).</span></div>
|
|
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno"> 554</span> generators->push_back(std::move(permutation));</div>
|
|
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno"> 555</span> }</div>
|
|
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno"> 556</span> </div>
|
|
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno"> 557</span> potential_root_image_nodes.pop_back();</div>
|
|
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno"> 558</span> }</div>
|
|
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno"> 559</span> </div>
|
|
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno"> 560</span> <span class="comment">// We keep track of the size of the orbit of 'root_node' under the</span></div>
|
|
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno"> 561</span> <span class="comment">// current subgroup: this is one of the factors of the total group size.</span></div>
|
|
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno"> 562</span> <span class="comment">// TODO(user): better, more complete explanation.</span></div>
|
|
<div class="line"><a id="l00563" name="l00563"></a><span class="lineno"> 563</span> factorized_automorphism_group_size->push_back(</div>
|
|
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno"> 564</span> node_equivalence_classes.<a class="code hl_function" href="classoperations__research_1_1_merging_partition.html#a3d5f7b1e62f42b574085e671ae6dfb73">NumNodesInSamePartAs</a>(root_node));</div>
|
|
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno"> 565</span> }</div>
|
|
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno"> 566</span> node_equivalence_classes.<a class="code hl_function" href="classoperations__research_1_1_merging_partition.html#a62cb833403d7861c5badb4de3389e06e">FillEquivalenceClasses</a>(node_equivalence_classes_io);</div>
|
|
<div class="line"><a id="l00567" name="l00567"></a><span class="lineno"> 567</span> <a class="code hl_define" href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a>(stats_.main_search_time.StopTimerAndAddElapsedTime());</div>
|
|
<div class="line"><a id="l00568" name="l00568"></a><span class="lineno"> 568</span> <a class="code hl_define" href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a>(stats_.SetPrintOrder(<a class="code hl_enumvalue" href="classoperations__research_1_1_stats_group.html#aa8fc83a27372d89cee2a2e5dd024b515a0a1aa84c65d99c7f8c2a52a0cb4b02b8">StatsGroup::SORT_BY_NAME</a>));</div>
|
|
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno"> 569</span> <a class="code hl_define" href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a>(<a class="code hl_define" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code hl_variable" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"Statistics: "</span> << stats_.StatString());</div>
|
|
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno"> 570</span> <span class="keywordflow">if</span> (time_limit_-><a class="code hl_function" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>()) {</div>
|
|
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno"> 571</span> <span class="keywordflow">return</span> absl::Status(absl::StatusCode::kDeadlineExceeded,</div>
|
|
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno"> 572</span> <span class="stringliteral">"Some automorphisms were found, but probably not all."</span>);</div>
|
|
<div class="line"><a id="l00573" name="l00573"></a><span class="lineno"> 573</span> }</div>
|
|
<div class="line"><a id="l00574" name="l00574"></a><span class="lineno"> 574</span> return ::absl::OkStatus();</div>
|
|
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno"> 575</span>}</div>
|
|
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno"> 576</span> </div>
|
|
<div class="line"><a id="l00577" name="l00577"></a><span class="lineno"> 577</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l00578" name="l00578"></a><span class="lineno"> 578</span><span class="comment">// This method can be easily understood in the context of</span></div>
|
|
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno"> 579</span><span class="comment">// ConfirmFullMatchOrFindNextMappingDecision(): see its call sites.</span></div>
|
|
<div class="line"><a id="l00580" name="l00580"></a><span class="lineno"> 580</span><span class="comment">// Knowing that we want to map some element of part #part_index of</span></div>
|
|
<div class="line"><a id="l00581" name="l00581"></a><span class="lineno"> 581</span><span class="comment">// "base_partition" to part #part_index of "image_partition", pick the "best"</span></div>
|
|
<div class="line"><a id="l00582" name="l00582"></a><span class="lineno"> 582</span><span class="comment">// such mapping, for the global search algorithm.</span></div>
|
|
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno"> 583</span><span class="keyword">inline</span> <span class="keywordtype">void</span> GetBestMapping(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_dynamic_partition.html">DynamicPartition</a>& base_partition,</div>
|
|
<div class="line"><a id="l00584" name="l00584"></a><span class="lineno"> 584</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_dynamic_partition.html">DynamicPartition</a>& image_partition,</div>
|
|
<div class="line"><a id="l00585" name="l00585"></a><span class="lineno"> 585</span> <span class="keywordtype">int</span> part_index, <span class="keywordtype">int</span>* base_node, <span class="keywordtype">int</span>* image_node) {</div>
|
|
<div class="line"><a id="l00586" name="l00586"></a><span class="lineno"> 586</span> <span class="comment">// As of pending CL 66620435, we've loosely tried three variants of</span></div>
|
|
<div class="line"><a id="l00587" name="l00587"></a><span class="lineno"> 587</span> <span class="comment">// GetBestMapping():</span></div>
|
|
<div class="line"><a id="l00588" name="l00588"></a><span class="lineno"> 588</span> <span class="comment">// 1) Just take the first element of the base part, map it to the first</span></div>
|
|
<div class="line"><a id="l00589" name="l00589"></a><span class="lineno"> 589</span> <span class="comment">// element of the image part.</span></div>
|
|
<div class="line"><a id="l00590" name="l00590"></a><span class="lineno"> 590</span> <span class="comment">// 2) Just take the first element of the base part, and map it to itself if</span></div>
|
|
<div class="line"><a id="l00591" name="l00591"></a><span class="lineno"> 591</span> <span class="comment">// possible, else map it to the first element of the image part</span></div>
|
|
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno"> 592</span> <span class="comment">// 3) Scan all elements of the base parts until we find one that can map to</span></div>
|
|
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno"> 593</span> <span class="comment">// itself. If there isn't one; we just fall back to the strategy 1).</span></div>
|
|
<div class="line"><a id="l00594" name="l00594"></a><span class="lineno"> 594</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00595" name="l00595"></a><span class="lineno"> 595</span> <span class="comment">// Variant 2) gives the best results on most benchmarks, in terms of speed,</span></div>
|
|
<div class="line"><a id="l00596" name="l00596"></a><span class="lineno"> 596</span> <span class="comment">// but 3) yields much smaller supports for the sat_holeXXX benchmarks, as</span></div>
|
|
<div class="line"><a id="l00597" name="l00597"></a><span class="lineno"> 597</span> <span class="comment">// long as it's combined with the other tweak enabled by</span></div>
|
|
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno"> 598</span> <span class="comment">// FLAGS_minimize_permutation_support_size.</span></div>
|
|
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno"> 599</span> <span class="keywordflow">if</span> (absl::GetFlag(FLAGS_minimize_permutation_support_size)) {</div>
|
|
<div class="line"><a id="l00600" name="l00600"></a><span class="lineno"> 600</span> <span class="comment">// Variant 3).</span></div>
|
|
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno"> 601</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : base_partition.<a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#a11ea4d0620bbdca30b7d9b8a23f8cdd8">ElementsInPart</a>(part_index)) {</div>
|
|
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno"> 602</span> <span class="keywordflow">if</span> (image_partition.<a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#ab22d95d31ef6edfd5a6770ff6d8c4f04">PartOf</a>(node) == part_index) {</div>
|
|
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno"> 603</span> *image_node = *base_node = node;</div>
|
|
<div class="line"><a id="l00604" name="l00604"></a><span class="lineno"> 604</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00605" name="l00605"></a><span class="lineno"> 605</span> }</div>
|
|
<div class="line"><a id="l00606" name="l00606"></a><span class="lineno"> 606</span> }</div>
|
|
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno"> 607</span> *base_node = *base_partition.<a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#a11ea4d0620bbdca30b7d9b8a23f8cdd8">ElementsInPart</a>(part_index).<a class="code hl_function" href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#a895e8e66079521889215308182c5591b">begin</a>();</div>
|
|
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno"> 608</span> *image_node = *image_partition.<a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#a11ea4d0620bbdca30b7d9b8a23f8cdd8">ElementsInPart</a>(part_index).<a class="code hl_function" href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#a895e8e66079521889215308182c5591b">begin</a>();</div>
|
|
<div class="line"><a id="l00609" name="l00609"></a><span class="lineno"> 609</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00610" name="l00610"></a><span class="lineno"> 610</span> }</div>
|
|
<div class="line"><a id="l00611" name="l00611"></a><span class="lineno"> 611</span> </div>
|
|
<div class="line"><a id="l00612" name="l00612"></a><span class="lineno"> 612</span> <span class="comment">// Variant 2).</span></div>
|
|
<div class="line"><a id="l00613" name="l00613"></a><span class="lineno"> 613</span> *base_node = *base_partition.<a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#a11ea4d0620bbdca30b7d9b8a23f8cdd8">ElementsInPart</a>(part_index).<a class="code hl_function" href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#a895e8e66079521889215308182c5591b">begin</a>();</div>
|
|
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno"> 614</span> <span class="keywordflow">if</span> (image_partition.<a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#ab22d95d31ef6edfd5a6770ff6d8c4f04">PartOf</a>(*base_node) == part_index) {</div>
|
|
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno"> 615</span> *image_node = *base_node;</div>
|
|
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno"> 616</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno"> 617</span> *image_node = *image_partition.<a class="code hl_function" href="classoperations__research_1_1_dynamic_partition.html#a11ea4d0620bbdca30b7d9b8a23f8cdd8">ElementsInPart</a>(part_index).<a class="code hl_function" href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#a895e8e66079521889215308182c5591b">begin</a>();</div>
|
|
<div class="line"><a id="l00618" name="l00618"></a><span class="lineno"> 618</span> }</div>
|
|
<div class="line"><a id="l00619" name="l00619"></a><span class="lineno"> 619</span>}</div>
|
|
<div class="line"><a id="l00620" name="l00620"></a><span class="lineno"> 620</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno"> 621</span> </div>
|
|
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno"> 622</span><span class="comment">// TODO(user): refactor this method and its submethods into a dedicated class</span></div>
|
|
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno"> 623</span><span class="comment">// whose members will be ominously accessed by all the class methods; most</span></div>
|
|
<div class="line"><a id="l00624" name="l00624"></a><span class="lineno"> 624</span><span class="comment">// notably the search state stack. This may improve readability.</span></div>
|
|
<div class="line"><a id="l00625" name="l00625"></a><span class="lineno"> 625</span>std::unique_ptr<SparsePermutation></div>
|
|
<div class="line"><a id="l00626" name="l00626"></a><span class="lineno"> 626</span>GraphSymmetryFinder::FindOneSuitablePermutation(</div>
|
|
<div class="line"><a id="l00627" name="l00627"></a><span class="lineno"> 627</span> <span class="keywordtype">int</span> root_node, <span class="keywordtype">int</span> root_image_node, DynamicPartition* base_partition,</div>
|
|
<div class="line"><a id="l00628" name="l00628"></a><span class="lineno"> 628</span> DynamicPartition* image_partition,</div>
|
|
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno"> 629</span> <span class="keyword">const</span> std::vector<std::unique_ptr<SparsePermutation>>&</div>
|
|
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno"> 630</span> generators_found_so_far,</div>
|
|
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno"> 631</span> <span class="keyword">const</span> std::vector<std::vector<int>>& permutations_displacing_node) {</div>
|
|
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno"> 632</span> <span class="comment">// DCHECKs() and statistics.</span></div>
|
|
<div class="line"><a id="l00633" name="l00633"></a><span class="lineno"> 633</span> <a class="code hl_typedef" href="namespaceoperations__research.html#ac3308533dde4fc559cab6f4f171d54c9">ScopedTimeDistributionUpdater</a> search_time_updater(&stats_.search_time);</div>
|
|
<div class="line"><a id="l00634" name="l00634"></a><span class="lineno"> 634</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(<span class="stringliteral">""</span>, tmp_dynamic_permutation_.<a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>());</div>
|
|
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno"> 635</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(base_partition->DebugString(<a class="code hl_enumvalue" href="classoperations__research_1_1_dynamic_partition.html#a5d89f8571b04ded41d29edffdb479199a6f2cdeb376ad23fd9f0d1164c25a0306">DynamicPartition::SORT_BY_PART</a>),</div>
|
|
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno"> 636</span> image_partition->DebugString(<a class="code hl_enumvalue" href="classoperations__research_1_1_dynamic_partition.html#a5d89f8571b04ded41d29edffdb479199a6f2cdeb376ad23fd9f0d1164c25a0306">DynamicPartition::SORT_BY_PART</a>));</div>
|
|
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno"> 637</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(search_states_.empty());</div>
|
|
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno"> 638</span> </div>
|
|
<div class="line"><a id="l00639" name="l00639"></a><span class="lineno"> 639</span> <span class="comment">// These will be used during the search. See their usage.</span></div>
|
|
<div class="line"><a id="l00640" name="l00640"></a><span class="lineno"> 640</span> std::vector<int> base_singletons;</div>
|
|
<div class="line"><a id="l00641" name="l00641"></a><span class="lineno"> 641</span> std::vector<int> image_singletons;</div>
|
|
<div class="line"><a id="l00642" name="l00642"></a><span class="lineno"> 642</span> <span class="keywordtype">int</span> next_base_node;</div>
|
|
<div class="line"><a id="l00643" name="l00643"></a><span class="lineno"> 643</span> <span class="keywordtype">int</span> next_image_node;</div>
|
|
<div class="line"><a id="l00644" name="l00644"></a><span class="lineno"> 644</span> <span class="keywordtype">int</span> min_potential_mismatching_part_index;</div>
|
|
<div class="line"><a id="l00645" name="l00645"></a><span class="lineno"> 645</span> std::vector<int> next_potential_image_nodes;</div>
|
|
<div class="line"><a id="l00646" name="l00646"></a><span class="lineno"> 646</span> </div>
|
|
<div class="line"><a id="l00647" name="l00647"></a><span class="lineno"> 647</span> <span class="comment">// Initialize the search: we can already distinguish "root_node" in the base</span></div>
|
|
<div class="line"><a id="l00648" name="l00648"></a><span class="lineno"> 648</span> <span class="comment">// partition. See the comment below.</span></div>
|
|
<div class="line"><a id="l00649" name="l00649"></a><span class="lineno"> 649</span> search_states_.emplace_back(</div>
|
|
<div class="line"><a id="l00650" name="l00650"></a><span class="lineno"> 650</span> <span class="comment">/*base_node=*/</span>root_node, <span class="comment">/*first_image_node=*/</span>-1,</div>
|
|
<div class="line"><a id="l00651" name="l00651"></a><span class="lineno"> 651</span> <span class="comment">/*num_parts_before_trying_to_map_base_node=*/</span>base_partition->NumParts(),</div>
|
|
<div class="line"><a id="l00652" name="l00652"></a><span class="lineno"> 652</span> <span class="comment">/*min_potential_mismatching_part_index=*/</span>base_partition->NumParts());</div>
|
|
<div class="line"><a id="l00653" name="l00653"></a><span class="lineno"> 653</span> <span class="comment">// We inject the image node directly as the "remaining_pruned_image_nodes".</span></div>
|
|
<div class="line"><a id="l00654" name="l00654"></a><span class="lineno"> 654</span> search_states_.back().remaining_pruned_image_nodes.assign(1, root_image_node);</div>
|
|
<div class="line"><a id="l00655" name="l00655"></a><span class="lineno"> 655</span> {</div>
|
|
<div class="line"><a id="l00656" name="l00656"></a><span class="lineno"> 656</span> <a class="code hl_typedef" href="namespaceoperations__research.html#ac3308533dde4fc559cab6f4f171d54c9">ScopedTimeDistributionUpdater</a> u(&stats_.initial_search_refine_time);</div>
|
|
<div class="line"><a id="l00657" name="l00657"></a><span class="lineno"> 657</span> <a class="code hl_function" href="classoperations__research_1_1_graph_symmetry_finder.html#acb28211fa0581e72d3dcb6b43ebe857a">DistinguishNodeInPartition</a>(root_node, base_partition, &base_singletons);</div>
|
|
<div class="line"><a id="l00658" name="l00658"></a><span class="lineno"> 658</span> }</div>
|
|
<div class="line"><a id="l00659" name="l00659"></a><span class="lineno"> 659</span> <span class="keywordflow">while</span> (!search_states_.empty()) {</div>
|
|
<div class="line"><a id="l00660" name="l00660"></a><span class="lineno"> 660</span> <span class="keywordflow">if</span> (time_limit_-><a class="code hl_function" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>()) <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00661" name="l00661"></a><span class="lineno"> 661</span> <span class="comment">// When exploring a SearchState "ss", we're supposed to have:</span></div>
|
|
<div class="line"><a id="l00662" name="l00662"></a><span class="lineno"> 662</span> <span class="comment">// - A base_partition that has already been refined on ss->base_node.</span></div>
|
|
<div class="line"><a id="l00663" name="l00663"></a><span class="lineno"> 663</span> <span class="comment">// (base_singleton is the list of singletons created on the base</span></div>
|
|
<div class="line"><a id="l00664" name="l00664"></a><span class="lineno"> 664</span> <span class="comment">// partition during that refinement).</span></div>
|
|
<div class="line"><a id="l00665" name="l00665"></a><span class="lineno"> 665</span> <span class="comment">// - A non-empty list of potential image nodes (we'll try them in reverse</span></div>
|
|
<div class="line"><a id="l00666" name="l00666"></a><span class="lineno"> 666</span> <span class="comment">// order).</span></div>
|
|
<div class="line"><a id="l00667" name="l00667"></a><span class="lineno"> 667</span> <span class="comment">// - An image partition that hasn't been refined yet.</span></div>
|
|
<div class="line"><a id="l00668" name="l00668"></a><span class="lineno"> 668</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00669" name="l00669"></a><span class="lineno"> 669</span> <span class="comment">// Also, one should note that the base partition (before its refinement on</span></div>
|
|
<div class="line"><a id="l00670" name="l00670"></a><span class="lineno"> 670</span> <span class="comment">// base_node) was deemed compatible with the image partition as it is now.</span></div>
|
|
<div class="line"><a id="l00671" name="l00671"></a><span class="lineno"> 671</span> <span class="keyword">const</span> SearchState& ss = search_states_.back();</div>
|
|
<div class="line"><a id="l00672" name="l00672"></a><span class="lineno"> 672</span> <span class="keyword">const</span> <span class="keywordtype">int</span> image_node = ss.first_image_node >= 0</div>
|
|
<div class="line"><a id="l00673" name="l00673"></a><span class="lineno"> 673</span> ? ss.first_image_node</div>
|
|
<div class="line"><a id="l00674" name="l00674"></a><span class="lineno"> 674</span> : ss.remaining_pruned_image_nodes.back();</div>
|
|
<div class="line"><a id="l00675" name="l00675"></a><span class="lineno"> 675</span> </div>
|
|
<div class="line"><a id="l00676" name="l00676"></a><span class="lineno"> 676</span> <span class="comment">// Statistics, DCHECKs.</span></div>
|
|
<div class="line"><a id="l00677" name="l00677"></a><span class="lineno"> 677</span> <a class="code hl_define" href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a>(stats_.search_depth.Add(search_states_.size()));</div>
|
|
<div class="line"><a id="l00678" name="l00678"></a><span class="lineno"> 678</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(ss.num_parts_before_trying_to_map_base_node,</div>
|
|
<div class="line"><a id="l00679" name="l00679"></a><span class="lineno"> 679</span> image_partition->NumParts());</div>
|
|
<div class="line"><a id="l00680" name="l00680"></a><span class="lineno"> 680</span> </div>
|
|
<div class="line"><a id="l00681" name="l00681"></a><span class="lineno"> 681</span> <span class="comment">// Apply the decision: map base_node to image_node. Since base_partition</span></div>
|
|
<div class="line"><a id="l00682" name="l00682"></a><span class="lineno"> 682</span> <span class="comment">// was already refined on base_node, we just need to refine image_partition.</span></div>
|
|
<div class="line"><a id="l00683" name="l00683"></a><span class="lineno"> 683</span> {</div>
|
|
<div class="line"><a id="l00684" name="l00684"></a><span class="lineno"> 684</span> <a class="code hl_typedef" href="namespaceoperations__research.html#ac3308533dde4fc559cab6f4f171d54c9">ScopedTimeDistributionUpdater</a> u(&stats_.search_refine_time);</div>
|
|
<div class="line"><a id="l00685" name="l00685"></a><span class="lineno"> 685</span> <a class="code hl_function" href="classoperations__research_1_1_graph_symmetry_finder.html#acb28211fa0581e72d3dcb6b43ebe857a">DistinguishNodeInPartition</a>(image_node, image_partition,</div>
|
|
<div class="line"><a id="l00686" name="l00686"></a><span class="lineno"> 686</span> &image_singletons);</div>
|
|
<div class="line"><a id="l00687" name="l00687"></a><span class="lineno"> 687</span> }</div>
|
|
<div class="line"><a id="l00688" name="l00688"></a><span class="lineno"> 688</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(4) << ss.DebugString();</div>
|
|
<div class="line"><a id="l00689" name="l00689"></a><span class="lineno"> 689</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(4) << base_partition->DebugString(<a class="code hl_enumvalue" href="classoperations__research_1_1_dynamic_partition.html#a5d89f8571b04ded41d29edffdb479199a6f2cdeb376ad23fd9f0d1164c25a0306">DynamicPartition::SORT_BY_PART</a>);</div>
|
|
<div class="line"><a id="l00690" name="l00690"></a><span class="lineno"> 690</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(4) << image_partition->DebugString(<a class="code hl_enumvalue" href="classoperations__research_1_1_dynamic_partition.html#a5d89f8571b04ded41d29edffdb479199a6f2cdeb376ad23fd9f0d1164c25a0306">DynamicPartition::SORT_BY_PART</a>);</div>
|
|
<div class="line"><a id="l00691" name="l00691"></a><span class="lineno"> 691</span> </div>
|
|
<div class="line"><a id="l00692" name="l00692"></a><span class="lineno"> 692</span> <span class="comment">// Run some diagnoses on the two partitions. There are many outcomes, so</span></div>
|
|
<div class="line"><a id="l00693" name="l00693"></a><span class="lineno"> 693</span> <span class="comment">// it's a bit complicated:</span></div>
|
|
<div class="line"><a id="l00694" name="l00694"></a><span class="lineno"> 694</span> <span class="comment">// 1) The partitions are incompatible</span></div>
|
|
<div class="line"><a id="l00695" name="l00695"></a><span class="lineno"> 695</span> <span class="comment">// - Because of a straightfoward criterion (size mismatch).</span></div>
|
|
<div class="line"><a id="l00696" name="l00696"></a><span class="lineno"> 696</span> <span class="comment">// - Because they are both fully refined (i.e. singletons only), yet the</span></div>
|
|
<div class="line"><a id="l00697" name="l00697"></a><span class="lineno"> 697</span> <span class="comment">// permutation induced by them is not a graph automorpshim.</span></div>
|
|
<div class="line"><a id="l00698" name="l00698"></a><span class="lineno"> 698</span> <span class="comment">// 2) The partitions induce a permutation (all their non-singleton parts are</span></div>
|
|
<div class="line"><a id="l00699" name="l00699"></a><span class="lineno"> 699</span> <span class="comment">// identical), and this permutation is a graph automorphism.</span></div>
|
|
<div class="line"><a id="l00700" name="l00700"></a><span class="lineno"> 700</span> <span class="comment">// 3) The partitions need further refinement:</span></div>
|
|
<div class="line"><a id="l00701" name="l00701"></a><span class="lineno"> 701</span> <span class="comment">// - Because some non-singleton parts aren't equal in the base and image</span></div>
|
|
<div class="line"><a id="l00702" name="l00702"></a><span class="lineno"> 702</span> <span class="comment">// partition</span></div>
|
|
<div class="line"><a id="l00703" name="l00703"></a><span class="lineno"> 703</span> <span class="comment">// - Or because they are a full match (i.e. may induce a permutation,</span></div>
|
|
<div class="line"><a id="l00704" name="l00704"></a><span class="lineno"> 704</span> <span class="comment">// like in 2)), but the induced permutation isn't a graph automorphism.</span></div>
|
|
<div class="line"><a id="l00705" name="l00705"></a><span class="lineno"> 705</span> <span class="keywordtype">bool</span> compatible = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00706" name="l00706"></a><span class="lineno"> 706</span> {</div>
|
|
<div class="line"><a id="l00707" name="l00707"></a><span class="lineno"> 707</span> <a class="code hl_typedef" href="namespaceoperations__research.html#ac3308533dde4fc559cab6f4f171d54c9">ScopedTimeDistributionUpdater</a> u(&stats_.quick_compatibility_time);</div>
|
|
<div class="line"><a id="l00708" name="l00708"></a><span class="lineno"> 708</span> compatible = PartitionsAreCompatibleAfterPartIndex(</div>
|
|
<div class="line"><a id="l00709" name="l00709"></a><span class="lineno"> 709</span> *base_partition, *image_partition,</div>
|
|
<div class="line"><a id="l00710" name="l00710"></a><span class="lineno"> 710</span> ss.num_parts_before_trying_to_map_base_node);</div>
|
|
<div class="line"><a id="l00711" name="l00711"></a><span class="lineno"> 711</span> u.AlsoUpdate(compatible ? &stats_.quick_compatibility_success_time</div>
|
|
<div class="line"><a id="l00712" name="l00712"></a><span class="lineno"> 712</span> : &stats_.quick_compatibility_fail_time);</div>
|
|
<div class="line"><a id="l00713" name="l00713"></a><span class="lineno"> 713</span> }</div>
|
|
<div class="line"><a id="l00714" name="l00714"></a><span class="lineno"> 714</span> <span class="keywordtype">bool</span> partitions_are_full_match = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00715" name="l00715"></a><span class="lineno"> 715</span> <span class="keywordflow">if</span> (compatible) {</div>
|
|
<div class="line"><a id="l00716" name="l00716"></a><span class="lineno"> 716</span> {</div>
|
|
<div class="line"><a id="l00717" name="l00717"></a><span class="lineno"> 717</span> <a class="code hl_typedef" href="namespaceoperations__research.html#ac3308533dde4fc559cab6f4f171d54c9">ScopedTimeDistributionUpdater</a> u(</div>
|
|
<div class="line"><a id="l00718" name="l00718"></a><span class="lineno"> 718</span> &stats_.dynamic_permutation_refinement_time);</div>
|
|
<div class="line"><a id="l00719" name="l00719"></a><span class="lineno"> 719</span> tmp_dynamic_permutation_.<a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#aeb46445d022e7bc495f212704791824a">AddMappings</a>(base_singletons, image_singletons);</div>
|
|
<div class="line"><a id="l00720" name="l00720"></a><span class="lineno"> 720</span> }</div>
|
|
<div class="line"><a id="l00721" name="l00721"></a><span class="lineno"> 721</span> <a class="code hl_typedef" href="namespaceoperations__research.html#ac3308533dde4fc559cab6f4f171d54c9">ScopedTimeDistributionUpdater</a> u(&stats_.map_election_std_time);</div>
|
|
<div class="line"><a id="l00722" name="l00722"></a><span class="lineno"> 722</span> min_potential_mismatching_part_index =</div>
|
|
<div class="line"><a id="l00723" name="l00723"></a><span class="lineno"> 723</span> ss.min_potential_mismatching_part_index;</div>
|
|
<div class="line"><a id="l00724" name="l00724"></a><span class="lineno"> 724</span> partitions_are_full_match = ConfirmFullMatchOrFindNextMappingDecision(</div>
|
|
<div class="line"><a id="l00725" name="l00725"></a><span class="lineno"> 725</span> *base_partition, *image_partition, tmp_dynamic_permutation_,</div>
|
|
<div class="line"><a id="l00726" name="l00726"></a><span class="lineno"> 726</span> &min_potential_mismatching_part_index, &next_base_node,</div>
|
|
<div class="line"><a id="l00727" name="l00727"></a><span class="lineno"> 727</span> &next_image_node);</div>
|
|
<div class="line"><a id="l00728" name="l00728"></a><span class="lineno"> 728</span> u.AlsoUpdate(partitions_are_full_match</div>
|
|
<div class="line"><a id="l00729" name="l00729"></a><span class="lineno"> 729</span> ? &stats_.map_election_std_full_match_time</div>
|
|
<div class="line"><a id="l00730" name="l00730"></a><span class="lineno"> 730</span> : &stats_.map_election_std_mapping_time);</div>
|
|
<div class="line"><a id="l00731" name="l00731"></a><span class="lineno"> 731</span> }</div>
|
|
<div class="line"><a id="l00732" name="l00732"></a><span class="lineno"> 732</span> <span class="keywordflow">if</span> (compatible && partitions_are_full_match) {</div>
|
|
<div class="line"><a id="l00733" name="l00733"></a><span class="lineno"> 733</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(min_potential_mismatching_part_index,</div>
|
|
<div class="line"><a id="l00734" name="l00734"></a><span class="lineno"> 734</span> base_partition->NumParts());</div>
|
|
<div class="line"><a id="l00735" name="l00735"></a><span class="lineno"> 735</span> <span class="comment">// We have a permutation candidate!</span></div>
|
|
<div class="line"><a id="l00736" name="l00736"></a><span class="lineno"> 736</span> <span class="comment">// Note(user): we also deal with (extremely rare) false positives for</span></div>
|
|
<div class="line"><a id="l00737" name="l00737"></a><span class="lineno"> 737</span> <span class="comment">// "partitions_are_full_match" here: in case they aren't a full match,</span></div>
|
|
<div class="line"><a id="l00738" name="l00738"></a><span class="lineno"> 738</span> <span class="comment">// IsGraphAutomorphism() will catch that; and we'll simply deepen the</span></div>
|
|
<div class="line"><a id="l00739" name="l00739"></a><span class="lineno"> 739</span> <span class="comment">// search.</span></div>
|
|
<div class="line"><a id="l00740" name="l00740"></a><span class="lineno"> 740</span> <span class="keywordtype">bool</span> is_automorphism = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00741" name="l00741"></a><span class="lineno"> 741</span> {</div>
|
|
<div class="line"><a id="l00742" name="l00742"></a><span class="lineno"> 742</span> <a class="code hl_typedef" href="namespaceoperations__research.html#ac3308533dde4fc559cab6f4f171d54c9">ScopedTimeDistributionUpdater</a> u(&stats_.automorphism_test_time);</div>
|
|
<div class="line"><a id="l00743" name="l00743"></a><span class="lineno"> 743</span> is_automorphism = <a class="code hl_function" href="classoperations__research_1_1_graph_symmetry_finder.html#a998043f7ad1e35dc5f6cb23e18f6e7dd">IsGraphAutomorphism</a>(tmp_dynamic_permutation_);</div>
|
|
<div class="line"><a id="l00744" name="l00744"></a><span class="lineno"> 744</span> u.AlsoUpdate(is_automorphism ? &stats_.automorphism_test_success_time</div>
|
|
<div class="line"><a id="l00745" name="l00745"></a><span class="lineno"> 745</span> : &stats_.automorphism_test_fail_time);</div>
|
|
<div class="line"><a id="l00746" name="l00746"></a><span class="lineno"> 746</span> }</div>
|
|
<div class="line"><a id="l00747" name="l00747"></a><span class="lineno"> 747</span> <span class="keywordflow">if</span> (is_automorphism) {</div>
|
|
<div class="line"><a id="l00748" name="l00748"></a><span class="lineno"> 748</span> <a class="code hl_typedef" href="namespaceoperations__research.html#ac3308533dde4fc559cab6f4f171d54c9">ScopedTimeDistributionUpdater</a> u(&stats_.search_finalize_time);</div>
|
|
<div class="line"><a id="l00749" name="l00749"></a><span class="lineno"> 749</span> <span class="comment">// We found a valid permutation. We can return it, but first we</span></div>
|
|
<div class="line"><a id="l00750" name="l00750"></a><span class="lineno"> 750</span> <span class="comment">// must restore the partitions to their original state.</span></div>
|
|
<div class="line"><a id="l00751" name="l00751"></a><span class="lineno"> 751</span> std::unique_ptr<SparsePermutation> sparse_permutation(</div>
|
|
<div class="line"><a id="l00752" name="l00752"></a><span class="lineno"> 752</span> tmp_dynamic_permutation_.<a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#a4829347e4722a1281369b9a251280fcc">CreateSparsePermutation</a>());</div>
|
|
<div class="line"><a id="l00753" name="l00753"></a><span class="lineno"> 753</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(4) << <span class="stringliteral">"Automorphism found: "</span> << sparse_permutation->DebugString();</div>
|
|
<div class="line"><a id="l00754" name="l00754"></a><span class="lineno"> 754</span> <span class="keyword">const</span> <span class="keywordtype">int</span> base_num_parts =</div>
|
|
<div class="line"><a id="l00755" name="l00755"></a><span class="lineno"> 755</span> search_states_[0].num_parts_before_trying_to_map_base_node;</div>
|
|
<div class="line"><a id="l00756" name="l00756"></a><span class="lineno"> 756</span> base_partition->UndoRefineUntilNumPartsEqual(base_num_parts);</div>
|
|
<div class="line"><a id="l00757" name="l00757"></a><span class="lineno"> 757</span> image_partition->UndoRefineUntilNumPartsEqual(base_num_parts);</div>
|
|
<div class="line"><a id="l00758" name="l00758"></a><span class="lineno"> 758</span> tmp_dynamic_permutation_.<a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#a372de693ad40b3f42839c8ec6ac845f4">Reset</a>();</div>
|
|
<div class="line"><a id="l00759" name="l00759"></a><span class="lineno"> 759</span> search_states_.clear();</div>
|
|
<div class="line"><a id="l00760" name="l00760"></a><span class="lineno"> 760</span> </div>
|
|
<div class="line"><a id="l00761" name="l00761"></a><span class="lineno"> 761</span> search_time_updater.AlsoUpdate(&stats_.search_time_success);</div>
|
|
<div class="line"><a id="l00762" name="l00762"></a><span class="lineno"> 762</span> <span class="keywordflow">return</span> sparse_permutation;</div>
|
|
<div class="line"><a id="l00763" name="l00763"></a><span class="lineno"> 763</span> }</div>
|
|
<div class="line"><a id="l00764" name="l00764"></a><span class="lineno"> 764</span> </div>
|
|
<div class="line"><a id="l00765" name="l00765"></a><span class="lineno"> 765</span> <span class="comment">// The permutation isn't a valid automorphism. Either the partitions were</span></div>
|
|
<div class="line"><a id="l00766" name="l00766"></a><span class="lineno"> 766</span> <span class="comment">// fully refined, and we deem them incompatible, or they weren't, and we</span></div>
|
|
<div class="line"><a id="l00767" name="l00767"></a><span class="lineno"> 767</span> <span class="comment">// consider them as 'not a full match'.</span></div>
|
|
<div class="line"><a id="l00768" name="l00768"></a><span class="lineno"> 768</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(4) << <span class="stringliteral">"Permutation candidate isn't a valid automorphism."</span>;</div>
|
|
<div class="line"><a id="l00769" name="l00769"></a><span class="lineno"> 769</span> <span class="keywordflow">if</span> (base_partition->NumParts() == NumNodes()) {</div>
|
|
<div class="line"><a id="l00770" name="l00770"></a><span class="lineno"> 770</span> <span class="comment">// Fully refined: the partitions are incompatible.</span></div>
|
|
<div class="line"><a id="l00771" name="l00771"></a><span class="lineno"> 771</span> compatible = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00772" name="l00772"></a><span class="lineno"> 772</span> <a class="code hl_typedef" href="namespaceoperations__research.html#ac3308533dde4fc559cab6f4f171d54c9">ScopedTimeDistributionUpdater</a> u(&stats_.dynamic_permutation_undo_time);</div>
|
|
<div class="line"><a id="l00773" name="l00773"></a><span class="lineno"> 773</span> tmp_dynamic_permutation_.<a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#ae8f61c84a06024a7d6343902f44e7e59">UndoLastMappings</a>(&base_singletons);</div>
|
|
<div class="line"><a id="l00774" name="l00774"></a><span class="lineno"> 774</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00775" name="l00775"></a><span class="lineno"> 775</span> <a class="code hl_typedef" href="namespaceoperations__research.html#ac3308533dde4fc559cab6f4f171d54c9">ScopedTimeDistributionUpdater</a> u(&stats_.map_reelection_time);</div>
|
|
<div class="line"><a id="l00776" name="l00776"></a><span class="lineno"> 776</span> <span class="comment">// TODO(user, viger): try to get the non-singleton part from</span></div>
|
|
<div class="line"><a id="l00777" name="l00777"></a><span class="lineno"> 777</span> <span class="comment">// DynamicPermutation in O(1). On some graphs like the symmetry of the</span></div>
|
|
<div class="line"><a id="l00778" name="l00778"></a><span class="lineno"> 778</span> <span class="comment">// mip problem lectsched-4-obj.mps.gz, this take the majority of the</span></div>
|
|
<div class="line"><a id="l00779" name="l00779"></a><span class="lineno"> 779</span> <span class="comment">// time!</span></div>
|
|
<div class="line"><a id="l00780" name="l00780"></a><span class="lineno"> 780</span> <span class="keywordtype">int</span> non_singleton_part = 0;</div>
|
|
<div class="line"><a id="l00781" name="l00781"></a><span class="lineno"> 781</span> {</div>
|
|
<div class="line"><a id="l00782" name="l00782"></a><span class="lineno"> 782</span> <a class="code hl_typedef" href="namespaceoperations__research.html#ac3308533dde4fc559cab6f4f171d54c9">ScopedTimeDistributionUpdater</a> u(&stats_.non_singleton_search_time);</div>
|
|
<div class="line"><a id="l00783" name="l00783"></a><span class="lineno"> 783</span> <span class="keywordflow">while</span> (base_partition->SizeOfPart(non_singleton_part) == 1) {</div>
|
|
<div class="line"><a id="l00784" name="l00784"></a><span class="lineno"> 784</span> ++non_singleton_part;</div>
|
|
<div class="line"><a id="l00785" name="l00785"></a><span class="lineno"> 785</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(non_singleton_part, base_partition->NumParts());</div>
|
|
<div class="line"><a id="l00786" name="l00786"></a><span class="lineno"> 786</span> }</div>
|
|
<div class="line"><a id="l00787" name="l00787"></a><span class="lineno"> 787</span> }</div>
|
|
<div class="line"><a id="l00788" name="l00788"></a><span class="lineno"> 788</span> time_limit_-><a class="code hl_function" href="classoperations__research_1_1_time_limit.html#af90cfd1fc238433fc303ee28c5914eb9">AdvanceDeterministicTime</a>(</div>
|
|
<div class="line"><a id="l00789" name="l00789"></a><span class="lineno"> 789</span> 1e-9 * <span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(non_singleton_part));</div>
|
|
<div class="line"><a id="l00790" name="l00790"></a><span class="lineno"> 790</span> </div>
|
|
<div class="line"><a id="l00791" name="l00791"></a><span class="lineno"> 791</span> <span class="comment">// The partitions are compatible, but we'll deepen the search on some</span></div>
|
|
<div class="line"><a id="l00792" name="l00792"></a><span class="lineno"> 792</span> <span class="comment">// non-singleton part. We can pick any base and image node in this case.</span></div>
|
|
<div class="line"><a id="l00793" name="l00793"></a><span class="lineno"> 793</span> GetBestMapping(*base_partition, *image_partition, non_singleton_part,</div>
|
|
<div class="line"><a id="l00794" name="l00794"></a><span class="lineno"> 794</span> &next_base_node, &next_image_node);</div>
|
|
<div class="line"><a id="l00795" name="l00795"></a><span class="lineno"> 795</span> }</div>
|
|
<div class="line"><a id="l00796" name="l00796"></a><span class="lineno"> 796</span> }</div>
|
|
<div class="line"><a id="l00797" name="l00797"></a><span class="lineno"> 797</span> </div>
|
|
<div class="line"><a id="l00798" name="l00798"></a><span class="lineno"> 798</span> <span class="comment">// Now we've fully diagnosed our partitions, and have already dealt with</span></div>
|
|
<div class="line"><a id="l00799" name="l00799"></a><span class="lineno"> 799</span> <span class="comment">// case 2). We're left to deal with 1) and 3).</span></div>
|
|
<div class="line"><a id="l00800" name="l00800"></a><span class="lineno"> 800</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00801" name="l00801"></a><span class="lineno"> 801</span> <span class="comment">// Case 1): partitions are incompatible.</span></div>
|
|
<div class="line"><a id="l00802" name="l00802"></a><span class="lineno"> 802</span> <span class="keywordflow">if</span> (!compatible) {</div>
|
|
<div class="line"><a id="l00803" name="l00803"></a><span class="lineno"> 803</span> <a class="code hl_typedef" href="namespaceoperations__research.html#ac3308533dde4fc559cab6f4f171d54c9">ScopedTimeDistributionUpdater</a> u(&stats_.backtracking_time);</div>
|
|
<div class="line"><a id="l00804" name="l00804"></a><span class="lineno"> 804</span> <span class="comment">// We invalidate the current image node, and prune the remaining image</span></div>
|
|
<div class="line"><a id="l00805" name="l00805"></a><span class="lineno"> 805</span> <span class="comment">// nodes. We might be left with no other image nodes, which means that</span></div>
|
|
<div class="line"><a id="l00806" name="l00806"></a><span class="lineno"> 806</span> <span class="comment">// we'll backtrack, i.e. pop our current SearchState and invalidate the</span></div>
|
|
<div class="line"><a id="l00807" name="l00807"></a><span class="lineno"> 807</span> <span class="comment">// 'current' image node of the upper SearchState (which might lead to us</span></div>
|
|
<div class="line"><a id="l00808" name="l00808"></a><span class="lineno"> 808</span> <span class="comment">// backtracking it, and so on).</span></div>
|
|
<div class="line"><a id="l00809" name="l00809"></a><span class="lineno"> 809</span> <span class="keywordflow">while</span> (!search_states_.empty()) {</div>
|
|
<div class="line"><a id="l00810" name="l00810"></a><span class="lineno"> 810</span> SearchState* <span class="keyword">const</span> last_ss = &search_states_.back();</div>
|
|
<div class="line"><a id="l00811" name="l00811"></a><span class="lineno"> 811</span> image_partition->UndoRefineUntilNumPartsEqual(</div>
|
|
<div class="line"><a id="l00812" name="l00812"></a><span class="lineno"> 812</span> last_ss->num_parts_before_trying_to_map_base_node);</div>
|
|
<div class="line"><a id="l00813" name="l00813"></a><span class="lineno"> 813</span> <span class="keywordflow">if</span> (last_ss->first_image_node >= 0) {</div>
|
|
<div class="line"><a id="l00814" name="l00814"></a><span class="lineno"> 814</span> <span class="comment">// Find out and prune the remaining potential image nodes: there is</span></div>
|
|
<div class="line"><a id="l00815" name="l00815"></a><span class="lineno"> 815</span> <span class="comment">// no permutation that maps base_node -> image_node that is</span></div>
|
|
<div class="line"><a id="l00816" name="l00816"></a><span class="lineno"> 816</span> <span class="comment">// compatible with the current partition, so there can't be a</span></div>
|
|
<div class="line"><a id="l00817" name="l00817"></a><span class="lineno"> 817</span> <span class="comment">// permutation that maps base_node -> X either, for all X in the orbit</span></div>
|
|
<div class="line"><a id="l00818" name="l00818"></a><span class="lineno"> 818</span> <span class="comment">// of 'image_node' under valid permutations compatible with the</span></div>
|
|
<div class="line"><a id="l00819" name="l00819"></a><span class="lineno"> 819</span> <span class="comment">// current partition. Ditto for other potential image nodes.</span></div>
|
|
<div class="line"><a id="l00820" name="l00820"></a><span class="lineno"> 820</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00821" name="l00821"></a><span class="lineno"> 821</span> <span class="comment">// TODO(user): fix this: we should really be collecting all</span></div>
|
|
<div class="line"><a id="l00822" name="l00822"></a><span class="lineno"> 822</span> <span class="comment">// permutations displacing any node in "image_part", for the pruning</span></div>
|
|
<div class="line"><a id="l00823" name="l00823"></a><span class="lineno"> 823</span> <span class="comment">// to be really exhaustive. We could also consider alternative ways,</span></div>
|
|
<div class="line"><a id="l00824" name="l00824"></a><span class="lineno"> 824</span> <span class="comment">// like incrementally maintaining the list of permutations compatible</span></div>
|
|
<div class="line"><a id="l00825" name="l00825"></a><span class="lineno"> 825</span> <span class="comment">// with the partition so far.</span></div>
|
|
<div class="line"><a id="l00826" name="l00826"></a><span class="lineno"> 826</span> <span class="keyword">const</span> <span class="keywordtype">int</span> part = image_partition->PartOf(last_ss->first_image_node);</div>
|
|
<div class="line"><a id="l00827" name="l00827"></a><span class="lineno"> 827</span> last_ss->remaining_pruned_image_nodes.reserve(</div>
|
|
<div class="line"><a id="l00828" name="l00828"></a><span class="lineno"> 828</span> image_partition->SizeOfPart(part));</div>
|
|
<div class="line"><a id="l00829" name="l00829"></a><span class="lineno"> 829</span> last_ss->remaining_pruned_image_nodes.push_back(</div>
|
|
<div class="line"><a id="l00830" name="l00830"></a><span class="lineno"> 830</span> last_ss->first_image_node);</div>
|
|
<div class="line"><a id="l00831" name="l00831"></a><span class="lineno"> 831</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> e : image_partition->ElementsInPart(part)) {</div>
|
|
<div class="line"><a id="l00832" name="l00832"></a><span class="lineno"> 832</span> <span class="keywordflow">if</span> (e != last_ss->first_image_node) {</div>
|
|
<div class="line"><a id="l00833" name="l00833"></a><span class="lineno"> 833</span> last_ss->remaining_pruned_image_nodes.push_back(e);</div>
|
|
<div class="line"><a id="l00834" name="l00834"></a><span class="lineno"> 834</span> }</div>
|
|
<div class="line"><a id="l00835" name="l00835"></a><span class="lineno"> 835</span> }</div>
|
|
<div class="line"><a id="l00836" name="l00836"></a><span class="lineno"> 836</span> {</div>
|
|
<div class="line"><a id="l00837" name="l00837"></a><span class="lineno"> 837</span> <a class="code hl_typedef" href="namespaceoperations__research.html#ac3308533dde4fc559cab6f4f171d54c9">ScopedTimeDistributionUpdater</a> u(&stats_.pruning_time);</div>
|
|
<div class="line"><a id="l00838" name="l00838"></a><span class="lineno"> 838</span> PruneOrbitsUnderPermutationsCompatibleWithPartition(</div>
|
|
<div class="line"><a id="l00839" name="l00839"></a><span class="lineno"> 839</span> *image_partition, generators_found_so_far,</div>
|
|
<div class="line"><a id="l00840" name="l00840"></a><span class="lineno"> 840</span> permutations_displacing_node[last_ss->first_image_node],</div>
|
|
<div class="line"><a id="l00841" name="l00841"></a><span class="lineno"> 841</span> &last_ss->remaining_pruned_image_nodes);</div>
|
|
<div class="line"><a id="l00842" name="l00842"></a><span class="lineno"> 842</span> }</div>
|
|
<div class="line"><a id="l00843" name="l00843"></a><span class="lineno"> 843</span> SwapFrontAndBack(&last_ss->remaining_pruned_image_nodes);</div>
|
|
<div class="line"><a id="l00844" name="l00844"></a><span class="lineno"> 844</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(last_ss->remaining_pruned_image_nodes.back(),</div>
|
|
<div class="line"><a id="l00845" name="l00845"></a><span class="lineno"> 845</span> last_ss->first_image_node);</div>
|
|
<div class="line"><a id="l00846" name="l00846"></a><span class="lineno"> 846</span> last_ss->first_image_node = -1;</div>
|
|
<div class="line"><a id="l00847" name="l00847"></a><span class="lineno"> 847</span> }</div>
|
|
<div class="line"><a id="l00848" name="l00848"></a><span class="lineno"> 848</span> last_ss->remaining_pruned_image_nodes.pop_back();</div>
|
|
<div class="line"><a id="l00849" name="l00849"></a><span class="lineno"> 849</span> <span class="keywordflow">if</span> (!last_ss->remaining_pruned_image_nodes.empty()) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00850" name="l00850"></a><span class="lineno"> 850</span> </div>
|
|
<div class="line"><a id="l00851" name="l00851"></a><span class="lineno"> 851</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(4) << <span class="stringliteral">"Backtracking one level up."</span>;</div>
|
|
<div class="line"><a id="l00852" name="l00852"></a><span class="lineno"> 852</span> base_partition->UndoRefineUntilNumPartsEqual(</div>
|
|
<div class="line"><a id="l00853" name="l00853"></a><span class="lineno"> 853</span> last_ss->num_parts_before_trying_to_map_base_node);</div>
|
|
<div class="line"><a id="l00854" name="l00854"></a><span class="lineno"> 854</span> <span class="comment">// If this was the root search state (i.e. we fully backtracked and</span></div>
|
|
<div class="line"><a id="l00855" name="l00855"></a><span class="lineno"> 855</span> <span class="comment">// will exit the search after that), we don't have mappings to undo.</span></div>
|
|
<div class="line"><a id="l00856" name="l00856"></a><span class="lineno"> 856</span> <span class="comment">// We run UndoLastMappings() anyway, because it's a no-op in that case.</span></div>
|
|
<div class="line"><a id="l00857" name="l00857"></a><span class="lineno"> 857</span> tmp_dynamic_permutation_.<a class="code hl_function" href="classoperations__research_1_1_dynamic_permutation.html#ae8f61c84a06024a7d6343902f44e7e59">UndoLastMappings</a>(&base_singletons);</div>
|
|
<div class="line"><a id="l00858" name="l00858"></a><span class="lineno"> 858</span> search_states_.pop_back();</div>
|
|
<div class="line"><a id="l00859" name="l00859"></a><span class="lineno"> 859</span> }</div>
|
|
<div class="line"><a id="l00860" name="l00860"></a><span class="lineno"> 860</span> <span class="comment">// Continue the search.</span></div>
|
|
<div class="line"><a id="l00861" name="l00861"></a><span class="lineno"> 861</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00862" name="l00862"></a><span class="lineno"> 862</span> }</div>
|
|
<div class="line"><a id="l00863" name="l00863"></a><span class="lineno"> 863</span> </div>
|
|
<div class="line"><a id="l00864" name="l00864"></a><span class="lineno"> 864</span> <span class="comment">// Case 3): we deepen the search.</span></div>
|
|
<div class="line"><a id="l00865" name="l00865"></a><span class="lineno"> 865</span> <span class="comment">// Since the search loop starts from an already-refined base_partition,</span></div>
|
|
<div class="line"><a id="l00866" name="l00866"></a><span class="lineno"> 866</span> <span class="comment">// we must do it here.</span></div>
|
|
<div class="line"><a id="l00867" name="l00867"></a><span class="lineno"> 867</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(4) << <span class="stringliteral">" Deepening the search."</span>;</div>
|
|
<div class="line"><a id="l00868" name="l00868"></a><span class="lineno"> 868</span> search_states_.emplace_back(</div>
|
|
<div class="line"><a id="l00869" name="l00869"></a><span class="lineno"> 869</span> next_base_node, next_image_node,</div>
|
|
<div class="line"><a id="l00870" name="l00870"></a><span class="lineno"> 870</span> <span class="comment">/*num_parts_before_trying_to_map_base_node*/</span> base_partition->NumParts(),</div>
|
|
<div class="line"><a id="l00871" name="l00871"></a><span class="lineno"> 871</span> min_potential_mismatching_part_index);</div>
|
|
<div class="line"><a id="l00872" name="l00872"></a><span class="lineno"> 872</span> {</div>
|
|
<div class="line"><a id="l00873" name="l00873"></a><span class="lineno"> 873</span> <a class="code hl_typedef" href="namespaceoperations__research.html#ac3308533dde4fc559cab6f4f171d54c9">ScopedTimeDistributionUpdater</a> u(&stats_.search_refine_time);</div>
|
|
<div class="line"><a id="l00874" name="l00874"></a><span class="lineno"> 874</span> <a class="code hl_function" href="classoperations__research_1_1_graph_symmetry_finder.html#acb28211fa0581e72d3dcb6b43ebe857a">DistinguishNodeInPartition</a>(next_base_node, base_partition,</div>
|
|
<div class="line"><a id="l00875" name="l00875"></a><span class="lineno"> 875</span> &base_singletons);</div>
|
|
<div class="line"><a id="l00876" name="l00876"></a><span class="lineno"> 876</span> }</div>
|
|
<div class="line"><a id="l00877" name="l00877"></a><span class="lineno"> 877</span> }</div>
|
|
<div class="line"><a id="l00878" name="l00878"></a><span class="lineno"> 878</span> <span class="comment">// We exhausted the search; we didn't find any permutation.</span></div>
|
|
<div class="line"><a id="l00879" name="l00879"></a><span class="lineno"> 879</span> search_time_updater.AlsoUpdate(&stats_.search_time_fail);</div>
|
|
<div class="line"><a id="l00880" name="l00880"></a><span class="lineno"> 880</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00881" name="l00881"></a><span class="lineno"> 881</span>}</div>
|
|
<div class="line"><a id="l00882" name="l00882"></a><span class="lineno"> 882</span> </div>
|
|
<div class="line"><a id="l00883" name="l00883"></a><span class="lineno"> 883</span><a class="code hl_class" href="classutil_1_1_begin_end_wrapper.html">util::BeginEndWrapper<std::vector<int>::const_iterator</a>></div>
|
|
<div class="line"><a id="l00884" name="l00884"></a><span class="lineno"> 884</span>GraphSymmetryFinder::TailsOfIncomingArcsTo(<span class="keywordtype">int</span> node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00885" name="l00885"></a><span class="lineno"> 885</span> <span class="keywordflow">return</span> <a class="code hl_class" href="classutil_1_1_begin_end_wrapper.html">util::BeginEndWrapper<std::vector<int>::const_iterator</a>>(</div>
|
|
<div class="line"><a id="l00886" name="l00886"></a><span class="lineno"> 886</span> flattened_reverse_adj_lists_.begin() + reverse_adj_list_index_[node],</div>
|
|
<div class="line"><a id="l00887" name="l00887"></a><span class="lineno"> 887</span> flattened_reverse_adj_lists_.begin() + reverse_adj_list_index_[node + 1]);</div>
|
|
<div class="line"><a id="l00888" name="l00888"></a><span class="lineno"> 888</span>}</div>
|
|
<div class="line"><a id="l00889" name="l00889"></a><span class="lineno"> 889</span> </div>
|
|
<div class="line"><a id="l00890" name="l00890"></a><span class="lineno"> 890</span><span class="keywordtype">void</span> GraphSymmetryFinder::PruneOrbitsUnderPermutationsCompatibleWithPartition(</div>
|
|
<div class="line"><a id="l00891" name="l00891"></a><span class="lineno"> 891</span> <span class="keyword">const</span> DynamicPartition& partition,</div>
|
|
<div class="line"><a id="l00892" name="l00892"></a><span class="lineno"> 892</span> <span class="keyword">const</span> std::vector<std::unique_ptr<SparsePermutation>>& permutations,</div>
|
|
<div class="line"><a id="l00893" name="l00893"></a><span class="lineno"> 893</span> <span class="keyword">const</span> std::vector<int>& permutation_indices, std::vector<int>* <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>) {</div>
|
|
<div class="line"><a id="l00894" name="l00894"></a><span class="lineno"> 894</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(4) << <span class="stringliteral">" Pruning ["</span> << absl::StrJoin(*<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, <span class="stringliteral">", "</span>) << <span class="stringliteral">"]"</span>;</div>
|
|
<div class="line"><a id="l00895" name="l00895"></a><span class="lineno"> 895</span> <span class="comment">// TODO(user): apply a smarter test to decide whether to do the pruning</span></div>
|
|
<div class="line"><a id="l00896" name="l00896"></a><span class="lineno"> 896</span> <span class="comment">// or not: we can accurately estimate the cost of pruning (iterate through</span></div>
|
|
<div class="line"><a id="l00897" name="l00897"></a><span class="lineno"> 897</span> <span class="comment">// all generators found so far) and its estimated benefit (the cost of</span></div>
|
|
<div class="line"><a id="l00898" name="l00898"></a><span class="lineno"> 898</span> <span class="comment">// the search below the state that we're currently in, times the expected</span></div>
|
|
<div class="line"><a id="l00899" name="l00899"></a><span class="lineno"> 899</span> <span class="comment">// number of pruned nodes). Sometimes it may be better to skip the</span></div>
|
|
<div class="line"><a id="l00900" name="l00900"></a><span class="lineno"> 900</span> <span class="comment">// pruning.</span></div>
|
|
<div class="line"><a id="l00901" name="l00901"></a><span class="lineno"> 901</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>->size() <= 1) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00902" name="l00902"></a><span class="lineno"> 902</span> </div>
|
|
<div class="line"><a id="l00903" name="l00903"></a><span class="lineno"> 903</span> <span class="comment">// Iterate on all targeted permutations. If they are compatible, apply</span></div>
|
|
<div class="line"><a id="l00904" name="l00904"></a><span class="lineno"> 904</span> <span class="comment">// them to tmp_partition_ which will contain the incrementally merged</span></div>
|
|
<div class="line"><a id="l00905" name="l00905"></a><span class="lineno"> 905</span> <span class="comment">// equivalence classes.</span></div>
|
|
<div class="line"><a id="l00906" name="l00906"></a><span class="lineno"> 906</span> std::vector<int>& tmp_nodes_on_support =</div>
|
|
<div class="line"><a id="l00907" name="l00907"></a><span class="lineno"> 907</span> tmp_stack_; <span class="comment">// Rename, for readability.</span></div>
|
|
<div class="line"><a id="l00908" name="l00908"></a><span class="lineno"> 908</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(tmp_nodes_on_support.empty());</div>
|
|
<div class="line"><a id="l00909" name="l00909"></a><span class="lineno"> 909</span> <span class="comment">// TODO(user): investigate further optimizations: maybe it's possible</span></div>
|
|
<div class="line"><a id="l00910" name="l00910"></a><span class="lineno"> 910</span> <span class="comment">// to incrementally maintain the set of permutations that is compatible</span></div>
|
|
<div class="line"><a id="l00911" name="l00911"></a><span class="lineno"> 911</span> <span class="comment">// with the current partition, instead of recomputing it here?</span></div>
|
|
<div class="line"><a id="l00912" name="l00912"></a><span class="lineno"> 912</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> p : permutation_indices) {</div>
|
|
<div class="line"><a id="l00913" name="l00913"></a><span class="lineno"> 913</span> <span class="keyword">const</span> SparsePermutation& permutation = *permutations[p];</div>
|
|
<div class="line"><a id="l00914" name="l00914"></a><span class="lineno"> 914</span> <span class="comment">// First, a quick compatibility check: the permutation's cycles must be</span></div>
|
|
<div class="line"><a id="l00915" name="l00915"></a><span class="lineno"> 915</span> <span class="comment">// smaller or equal to the size of the part that they are included in.</span></div>
|
|
<div class="line"><a id="l00916" name="l00916"></a><span class="lineno"> 916</span> <span class="keywordtype">bool</span> compatible = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00917" name="l00917"></a><span class="lineno"> 917</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> c = 0; c < permutation.NumCycles(); ++c) {</div>
|
|
<div class="line"><a id="l00918" name="l00918"></a><span class="lineno"> 918</span> <span class="keyword">const</span> SparsePermutation::Iterator cycle = permutation.Cycle(c);</div>
|
|
<div class="line"><a id="l00919" name="l00919"></a><span class="lineno"> 919</span> <span class="keywordflow">if</span> (cycle.size() ></div>
|
|
<div class="line"><a id="l00920" name="l00920"></a><span class="lineno"> 920</span> partition.SizeOfPart(partition.PartOf(*cycle.begin()))) {</div>
|
|
<div class="line"><a id="l00921" name="l00921"></a><span class="lineno"> 921</span> compatible = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00922" name="l00922"></a><span class="lineno"> 922</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00923" name="l00923"></a><span class="lineno"> 923</span> }</div>
|
|
<div class="line"><a id="l00924" name="l00924"></a><span class="lineno"> 924</span> }</div>
|
|
<div class="line"><a id="l00925" name="l00925"></a><span class="lineno"> 925</span> <span class="keywordflow">if</span> (!compatible) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00926" name="l00926"></a><span class="lineno"> 926</span> <span class="comment">// Now the full compatibility check: each cycle of the permutation must</span></div>
|
|
<div class="line"><a id="l00927" name="l00927"></a><span class="lineno"> 927</span> <span class="comment">// be fully included in an image part.</span></div>
|
|
<div class="line"><a id="l00928" name="l00928"></a><span class="lineno"> 928</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> c = 0; c < permutation.NumCycles(); ++c) {</div>
|
|
<div class="line"><a id="l00929" name="l00929"></a><span class="lineno"> 929</span> <span class="keywordtype">int</span> part = -1;</div>
|
|
<div class="line"><a id="l00930" name="l00930"></a><span class="lineno"> 930</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : permutation.Cycle(c)) {</div>
|
|
<div class="line"><a id="l00931" name="l00931"></a><span class="lineno"> 931</span> <span class="keywordflow">if</span> (partition.PartOf(node) != part) {</div>
|
|
<div class="line"><a id="l00932" name="l00932"></a><span class="lineno"> 932</span> <span class="keywordflow">if</span> (part >= 0) {</div>
|
|
<div class="line"><a id="l00933" name="l00933"></a><span class="lineno"> 933</span> compatible = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00934" name="l00934"></a><span class="lineno"> 934</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00935" name="l00935"></a><span class="lineno"> 935</span> }</div>
|
|
<div class="line"><a id="l00936" name="l00936"></a><span class="lineno"> 936</span> part = partition.PartOf(node); <span class="comment">// Initialization of 'part'.</span></div>
|
|
<div class="line"><a id="l00937" name="l00937"></a><span class="lineno"> 937</span> }</div>
|
|
<div class="line"><a id="l00938" name="l00938"></a><span class="lineno"> 938</span> }</div>
|
|
<div class="line"><a id="l00939" name="l00939"></a><span class="lineno"> 939</span> }</div>
|
|
<div class="line"><a id="l00940" name="l00940"></a><span class="lineno"> 940</span> <span class="keywordflow">if</span> (!compatible) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00941" name="l00941"></a><span class="lineno"> 941</span> <span class="comment">// The permutation is fully compatible!</span></div>
|
|
<div class="line"><a id="l00942" name="l00942"></a><span class="lineno"> 942</span> <span class="comment">// TODO(user): ignore cycles that are outside of image_part.</span></div>
|
|
<div class="line"><a id="l00943" name="l00943"></a><span class="lineno"> 943</span> MergeNodeEquivalenceClassesAccordingToPermutation(permutation,</div>
|
|
<div class="line"><a id="l00944" name="l00944"></a><span class="lineno"> 944</span> &tmp_partition_, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00945" name="l00945"></a><span class="lineno"> 945</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : permutation.Support()) {</div>
|
|
<div class="line"><a id="l00946" name="l00946"></a><span class="lineno"> 946</span> <span class="keywordflow">if</span> (!tmp_node_mask_[node]) {</div>
|
|
<div class="line"><a id="l00947" name="l00947"></a><span class="lineno"> 947</span> tmp_node_mask_[node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00948" name="l00948"></a><span class="lineno"> 948</span> tmp_nodes_on_support.push_back(node);</div>
|
|
<div class="line"><a id="l00949" name="l00949"></a><span class="lineno"> 949</span> }</div>
|
|
<div class="line"><a id="l00950" name="l00950"></a><span class="lineno"> 950</span> }</div>
|
|
<div class="line"><a id="l00951" name="l00951"></a><span class="lineno"> 951</span> }</div>
|
|
<div class="line"><a id="l00952" name="l00952"></a><span class="lineno"> 952</span> </div>
|
|
<div class="line"><a id="l00953" name="l00953"></a><span class="lineno"> 953</span> <span class="comment">// Apply the pruning.</span></div>
|
|
<div class="line"><a id="l00954" name="l00954"></a><span class="lineno"> 954</span> tmp_partition_.<a class="code hl_function" href="classoperations__research_1_1_merging_partition.html#a80761f181b521aa284b7e687776b9fde">KeepOnlyOneNodePerPart</a>(<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>);</div>
|
|
<div class="line"><a id="l00955" name="l00955"></a><span class="lineno"> 955</span> </div>
|
|
<div class="line"><a id="l00956" name="l00956"></a><span class="lineno"> 956</span> <span class="comment">// Reset the "tmp_" structures sparsely.</span></div>
|
|
<div class="line"><a id="l00957" name="l00957"></a><span class="lineno"> 957</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : tmp_nodes_on_support) {</div>
|
|
<div class="line"><a id="l00958" name="l00958"></a><span class="lineno"> 958</span> tmp_node_mask_[node] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00959" name="l00959"></a><span class="lineno"> 959</span> tmp_partition_.<a class="code hl_function" href="classoperations__research_1_1_merging_partition.html#a4368033ed0d5b2fc75727265e0c8f2d7">ResetNode</a>(node);</div>
|
|
<div class="line"><a id="l00960" name="l00960"></a><span class="lineno"> 960</span> }</div>
|
|
<div class="line"><a id="l00961" name="l00961"></a><span class="lineno"> 961</span> tmp_nodes_on_support.clear();</div>
|
|
<div class="line"><a id="l00962" name="l00962"></a><span class="lineno"> 962</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(4) << <span class="stringliteral">" Pruned: ["</span> << absl::StrJoin(*<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, <span class="stringliteral">", "</span>) << <span class="stringliteral">"]"</span>;</div>
|
|
<div class="line"><a id="l00963" name="l00963"></a><span class="lineno"> 963</span>}</div>
|
|
<div class="line"><a id="l00964" name="l00964"></a><span class="lineno"> 964</span> </div>
|
|
<div class="line"><a id="l00965" name="l00965"></a><span class="lineno"> 965</span><span class="keywordtype">bool</span> GraphSymmetryFinder::ConfirmFullMatchOrFindNextMappingDecision(</div>
|
|
<div class="line"><a id="l00966" name="l00966"></a><span class="lineno"> 966</span> <span class="keyword">const</span> DynamicPartition& base_partition,</div>
|
|
<div class="line"><a id="l00967" name="l00967"></a><span class="lineno"> 967</span> <span class="keyword">const</span> DynamicPartition& image_partition,</div>
|
|
<div class="line"><a id="l00968" name="l00968"></a><span class="lineno"> 968</span> <span class="keyword">const</span> DynamicPermutation& current_permutation_candidate,</div>
|
|
<div class="line"><a id="l00969" name="l00969"></a><span class="lineno"> 969</span> <span class="keywordtype">int</span>* min_potential_mismatching_part_index_io, <span class="keywordtype">int</span>* next_base_node,</div>
|
|
<div class="line"><a id="l00970" name="l00970"></a><span class="lineno"> 970</span> <span class="keywordtype">int</span>* next_image_node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00971" name="l00971"></a><span class="lineno"> 971</span> *next_base_node = -1;</div>
|
|
<div class="line"><a id="l00972" name="l00972"></a><span class="lineno"> 972</span> *next_image_node = -1;</div>
|
|
<div class="line"><a id="l00973" name="l00973"></a><span class="lineno"> 973</span> </div>
|
|
<div class="line"><a id="l00974" name="l00974"></a><span class="lineno"> 974</span> <span class="comment">// The following clause should be true most of the times, except in some</span></div>
|
|
<div class="line"><a id="l00975" name="l00975"></a><span class="lineno"> 975</span> <span class="comment">// specific use cases.</span></div>
|
|
<div class="line"><a id="l00976" name="l00976"></a><span class="lineno"> 976</span> <span class="keywordflow">if</span> (!absl::GetFlag(FLAGS_minimize_permutation_support_size)) {</div>
|
|
<div class="line"><a id="l00977" name="l00977"></a><span class="lineno"> 977</span> <span class="comment">// First, we try to map the loose ends of the current permutations: these</span></div>
|
|
<div class="line"><a id="l00978" name="l00978"></a><span class="lineno"> 978</span> <span class="comment">// loose ends can't be mapped to themselves, so we'll have to map them to</span></div>
|
|
<div class="line"><a id="l00979" name="l00979"></a><span class="lineno"> 979</span> <span class="comment">// something anyway.</span></div>
|
|
<div class="line"><a id="l00980" name="l00980"></a><span class="lineno"> 980</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> loose_node : current_permutation_candidate.LooseEnds()) {</div>
|
|
<div class="line"><a id="l00981" name="l00981"></a><span class="lineno"> 981</span> <a class="code hl_define" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(base_partition.ElementsInSamePartAs(loose_node).size(), 1);</div>
|
|
<div class="line"><a id="l00982" name="l00982"></a><span class="lineno"> 982</span> *next_base_node = loose_node;</div>
|
|
<div class="line"><a id="l00983" name="l00983"></a><span class="lineno"> 983</span> <span class="keyword">const</span> <span class="keywordtype">int</span> root = current_permutation_candidate.RootOf(loose_node);</div>
|
|
<div class="line"><a id="l00984" name="l00984"></a><span class="lineno"> 984</span> <a class="code hl_define" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(root, loose_node);</div>
|
|
<div class="line"><a id="l00985" name="l00985"></a><span class="lineno"> 985</span> <span class="keywordflow">if</span> (image_partition.PartOf(root) == base_partition.PartOf(loose_node)) {</div>
|
|
<div class="line"><a id="l00986" name="l00986"></a><span class="lineno"> 986</span> <span class="comment">// We prioritize mapping a loose end to its own root (i.e. close a</span></div>
|
|
<div class="line"><a id="l00987" name="l00987"></a><span class="lineno"> 987</span> <span class="comment">// cycle), if possible, like here: we exit immediately.</span></div>
|
|
<div class="line"><a id="l00988" name="l00988"></a><span class="lineno"> 988</span> *next_image_node = root;</div>
|
|
<div class="line"><a id="l00989" name="l00989"></a><span class="lineno"> 989</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00990" name="l00990"></a><span class="lineno"> 990</span> }</div>
|
|
<div class="line"><a id="l00991" name="l00991"></a><span class="lineno"> 991</span> }</div>
|
|
<div class="line"><a id="l00992" name="l00992"></a><span class="lineno"> 992</span> <span class="keywordflow">if</span> (*next_base_node != -1) {</div>
|
|
<div class="line"><a id="l00993" name="l00993"></a><span class="lineno"> 993</span> <span class="comment">// We found loose ends, but none that mapped to its own root. Just pick</span></div>
|
|
<div class="line"><a id="l00994" name="l00994"></a><span class="lineno"> 994</span> <span class="comment">// any valid image.</span></div>
|
|
<div class="line"><a id="l00995" name="l00995"></a><span class="lineno"> 995</span> *next_image_node =</div>
|
|
<div class="line"><a id="l00996" name="l00996"></a><span class="lineno"> 996</span> *image_partition</div>
|
|
<div class="line"><a id="l00997" name="l00997"></a><span class="lineno"> 997</span> .ElementsInPart(base_partition.PartOf(*next_base_node))</div>
|
|
<div class="line"><a id="l00998" name="l00998"></a><span class="lineno"> 998</span> .begin();</div>
|
|
<div class="line"><a id="l00999" name="l00999"></a><span class="lineno"> 999</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01000" name="l01000"></a><span class="lineno"> 1000</span> }</div>
|
|
<div class="line"><a id="l01001" name="l01001"></a><span class="lineno"> 1001</span> }</div>
|
|
<div class="line"><a id="l01002" name="l01002"></a><span class="lineno"> 1002</span> </div>
|
|
<div class="line"><a id="l01003" name="l01003"></a><span class="lineno"> 1003</span> <span class="comment">// If there is no loose node (i.e. the current permutation only has closed</span></div>
|
|
<div class="line"><a id="l01004" name="l01004"></a><span class="lineno"> 1004</span> <span class="comment">// cycles), we fall back to picking any part that is different in the base and</span></div>
|
|
<div class="line"><a id="l01005" name="l01005"></a><span class="lineno"> 1005</span> <span class="comment">// image partitions; because we know that some mapping decision will have to</span></div>
|
|
<div class="line"><a id="l01006" name="l01006"></a><span class="lineno"> 1006</span> <span class="comment">// be made there.</span></div>
|
|
<div class="line"><a id="l01007" name="l01007"></a><span class="lineno"> 1007</span> <span class="comment">// SUBTLE: we use "min_potential_mismatching_part_index_io" to incrementally</span></div>
|
|
<div class="line"><a id="l01008" name="l01008"></a><span class="lineno"> 1008</span> <span class="comment">// keep running this search (for a mismatching part) from where we left off.</span></div>
|
|
<div class="line"><a id="l01009" name="l01009"></a><span class="lineno"> 1009</span> <span class="comment">// TODO(user): implement a simpler search for a mismatching part: it's</span></div>
|
|
<div class="line"><a id="l01010" name="l01010"></a><span class="lineno"> 1010</span> <span class="comment">// trivially possible if the base partition maintains a hash set of all</span></div>
|
|
<div class="line"><a id="l01011" name="l01011"></a><span class="lineno"> 1011</span> <span class="comment">// Fprints of its parts, and if the image partition uses that to maintain the</span></div>
|
|
<div class="line"><a id="l01012" name="l01012"></a><span class="lineno"> 1012</span> <span class="comment">// list of 'different' non-singleton parts.</span></div>
|
|
<div class="line"><a id="l01013" name="l01013"></a><span class="lineno"> 1013</span> <span class="keyword">const</span> <span class="keywordtype">int</span> initial_min_potential_mismatching_part_index =</div>
|
|
<div class="line"><a id="l01014" name="l01014"></a><span class="lineno"> 1014</span> *min_potential_mismatching_part_index_io;</div>
|
|
<div class="line"><a id="l01015" name="l01015"></a><span class="lineno"> 1015</span> <span class="keywordflow">for</span> (; *min_potential_mismatching_part_index_io < base_partition.NumParts();</div>
|
|
<div class="line"><a id="l01016" name="l01016"></a><span class="lineno"> 1016</span> ++*min_potential_mismatching_part_index_io) {</div>
|
|
<div class="line"><a id="l01017" name="l01017"></a><span class="lineno"> 1017</span> <span class="keyword">const</span> <span class="keywordtype">int</span> p = *min_potential_mismatching_part_index_io;</div>
|
|
<div class="line"><a id="l01018" name="l01018"></a><span class="lineno"> 1018</span> <span class="keywordflow">if</span> (base_partition.SizeOfPart(p) != 1 &&</div>
|
|
<div class="line"><a id="l01019" name="l01019"></a><span class="lineno"> 1019</span> base_partition.FprintOfPart(p) != image_partition.FprintOfPart(p)) {</div>
|
|
<div class="line"><a id="l01020" name="l01020"></a><span class="lineno"> 1020</span> GetBestMapping(base_partition, image_partition, p, next_base_node,</div>
|
|
<div class="line"><a id="l01021" name="l01021"></a><span class="lineno"> 1021</span> next_image_node);</div>
|
|
<div class="line"><a id="l01022" name="l01022"></a><span class="lineno"> 1022</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01023" name="l01023"></a><span class="lineno"> 1023</span> }</div>
|
|
<div class="line"><a id="l01024" name="l01024"></a><span class="lineno"> 1024</span> </div>
|
|
<div class="line"><a id="l01025" name="l01025"></a><span class="lineno"> 1025</span> <span class="keyword">const</span> <span class="keywordtype">int</span> parent = base_partition.ParentOfPart(p);</div>
|
|
<div class="line"><a id="l01026" name="l01026"></a><span class="lineno"> 1026</span> <span class="keywordflow">if</span> (parent < initial_min_potential_mismatching_part_index &&</div>
|
|
<div class="line"><a id="l01027" name="l01027"></a><span class="lineno"> 1027</span> base_partition.SizeOfPart(parent) != 1 &&</div>
|
|
<div class="line"><a id="l01028" name="l01028"></a><span class="lineno"> 1028</span> base_partition.FprintOfPart(parent) !=</div>
|
|
<div class="line"><a id="l01029" name="l01029"></a><span class="lineno"> 1029</span> image_partition.FprintOfPart(parent)) {</div>
|
|
<div class="line"><a id="l01030" name="l01030"></a><span class="lineno"> 1030</span> GetBestMapping(base_partition, image_partition, parent, next_base_node,</div>
|
|
<div class="line"><a id="l01031" name="l01031"></a><span class="lineno"> 1031</span> next_image_node);</div>
|
|
<div class="line"><a id="l01032" name="l01032"></a><span class="lineno"> 1032</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01033" name="l01033"></a><span class="lineno"> 1033</span> }</div>
|
|
<div class="line"><a id="l01034" name="l01034"></a><span class="lineno"> 1034</span> }</div>
|
|
<div class="line"><a id="l01035" name="l01035"></a><span class="lineno"> 1035</span> </div>
|
|
<div class="line"><a id="l01036" name="l01036"></a><span class="lineno"> 1036</span> <span class="comment">// We didn't find an unequal part. DCHECK that our "incremental" check was</span></div>
|
|
<div class="line"><a id="l01037" name="l01037"></a><span class="lineno"> 1037</span> <span class="comment">// actually correct and that all non-singleton parts are indeed equal.</span></div>
|
|
<div class="line"><a id="l01038" name="l01038"></a><span class="lineno"> 1038</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div>
|
|
<div class="line"><a id="l01039" name="l01039"></a><span class="lineno"> 1039</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> p = 0; p < base_partition.NumParts(); ++p) {</div>
|
|
<div class="line"><a id="l01040" name="l01040"></a><span class="lineno"> 1040</span> <span class="keywordflow">if</span> (base_partition.SizeOfPart(p) != 1) {</div>
|
|
<div class="line"><a id="l01041" name="l01041"></a><span class="lineno"> 1041</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(base_partition.FprintOfPart(p),</div>
|
|
<div class="line"><a id="l01042" name="l01042"></a><span class="lineno"> 1042</span> image_partition.FprintOfPart(p));</div>
|
|
<div class="line"><a id="l01043" name="l01043"></a><span class="lineno"> 1043</span> }</div>
|
|
<div class="line"><a id="l01044" name="l01044"></a><span class="lineno"> 1044</span> }</div>
|
|
<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span> }</div>
|
|
<div class="line"><a id="l01046" name="l01046"></a><span class="lineno"> 1046</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01047" name="l01047"></a><span class="lineno"> 1047</span>}</div>
|
|
<div class="line"><a id="l01048" name="l01048"></a><span class="lineno"> 1048</span> </div>
|
|
<div class="line"><a id="l01049" name="l01049"></a><span class="lineno"> 1049</span>std::string GraphSymmetryFinder::SearchState::DebugString()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l01050" name="l01050"></a><span class="lineno"> 1050</span> <span class="keywordflow">return</span> absl::StrFormat(</div>
|
|
<div class="line"><a id="l01051" name="l01051"></a><span class="lineno"> 1051</span> <span class="stringliteral">"SearchState{ base_node=%d, first_image_node=%d,"</span></div>
|
|
<div class="line"><a id="l01052" name="l01052"></a><span class="lineno"> 1052</span> <span class="stringliteral">" remaining_pruned_image_nodes=[%s],"</span></div>
|
|
<div class="line"><a id="l01053" name="l01053"></a><span class="lineno"> 1053</span> <span class="stringliteral">" num_parts_before_trying_to_map_base_node=%d }"</span>,</div>
|
|
<div class="line"><a id="l01054" name="l01054"></a><span class="lineno"> 1054</span> base_node, first_image_node,</div>
|
|
<div class="line"><a id="l01055" name="l01055"></a><span class="lineno"> 1055</span> absl::StrJoin(remaining_pruned_image_nodes, <span class="stringliteral">" "</span>),</div>
|
|
<div class="line"><a id="l01056" name="l01056"></a><span class="lineno"> 1056</span> num_parts_before_trying_to_map_base_node);</div>
|
|
<div class="line"><a id="l01057" name="l01057"></a><span class="lineno"> 1057</span>}</div>
|
|
<div class="line"><a id="l01058" name="l01058"></a><span class="lineno"> 1058</span> </div>
|
|
<div class="line"><a id="l01059" name="l01059"></a><span class="lineno"> 1059</span>} <span class="comment">// namespace operations_research</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_a46e69120fbd3b36e6960e096d23b66f0"><div class="ttname"><a href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a></div><div class="ttdeci">#define DCHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00892">base/logging.h:892</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00703">base/logging.h:703</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab4f56aa24c4c9cddc47a6abd2d747f9a"><div class="ttname"><a href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a></div><div class="ttdeci">#define DCHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00896">base/logging.h:896</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="abase_2logging_8h_html_accad43a85d781d53381cd53a9894b6ae"><div class="ttname"><a href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a></div><div class="ttdeci">#define LOG(severity)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00420">base/logging.h:420</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#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="abase_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00984">base/logging.h:984</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dense_doubly_linked_list_html"><div class="ttname"><a href="classoperations__research_1_1_dense_doubly_linked_list.html">operations_research::DenseDoublyLinkedList</a></div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00029">dense_doubly_linked_list.h:29</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dense_doubly_linked_list_html_a209f8799ca534e48c873a6613131d358"><div class="ttname"><a href="classoperations__research_1_1_dense_doubly_linked_list.html#a209f8799ca534e48c873a6613131d358">operations_research::DenseDoublyLinkedList::Remove</a></div><div class="ttdeci">void Remove(int i)</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00068">dense_doubly_linked_list.h:68</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disabled_scoped_time_distribution_updater_html"><div class="ttname"><a href="classoperations__research_1_1_disabled_scoped_time_distribution_updater.html">operations_research::DisabledScopedTimeDistributionUpdater</a></div><div class="ttdef"><b>Definition:</b> <a href="stats_8h_source.html#l00343">stats.h:343</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_partition_html"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html">operations_research::DynamicPartition</a></div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00050">dynamic_partition.h:50</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_partition_html_a11ea4d0620bbdca30b7d9b8a23f8cdd8"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a11ea4d0620bbdca30b7d9b8a23f8cdd8">operations_research::DynamicPartition::ElementsInPart</a></div><div class="ttdeci">IterablePart ElementsInPart(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00277">dynamic_partition.h:277</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_partition_html_a32f3aa9643111b05108d1120e48c1e13"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a32f3aa9643111b05108d1120e48c1e13">operations_research::DynamicPartition::Refine</a></div><div class="ttdeci">void Refine(const std::vector< int > &distinguished_subset)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8cc_source.html#l00097">dynamic_partition.cc:97</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_partition_html_a5634a596b0aa63843c28e8ed69e653ca"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a5634a596b0aa63843c28e8ed69e653ca">operations_research::DynamicPartition::SizeOfPart</a></div><div class="ttdeci">int SizeOfPart(int part) const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00291">dynamic_partition.h:291</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_partition_html_a59a35941a5a6eb3747faddb449a49e2a"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a59a35941a5a6eb3747faddb449a49e2a">operations_research::DynamicPartition::UndoRefineUntilNumPartsEqual</a></div><div class="ttdeci">void UndoRefineUntilNumPartsEqual(int original_num_parts)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8cc_source.html#l00162">dynamic_partition.cc:162</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_partition_html_a5d89f8571b04ded41d29edffdb479199a6f2cdeb376ad23fd9f0d1164c25a0306"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a5d89f8571b04ded41d29edffdb479199a6f2cdeb376ad23fd9f0d1164c25a0306">operations_research::DynamicPartition::SORT_BY_PART</a></div><div class="ttdeci">@ SORT_BY_PART</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00123">dynamic_partition.h:123</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_partition_html_a897ee69dceefdd60a6a4e90ab8b18a25"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a897ee69dceefdd60a6a4e90ab8b18a25">operations_research::DynamicPartition::ElementsInSamePartAs</a></div><div class="ttdeci">IterablePart ElementsInSamePartAs(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00304">dynamic_partition.h:304</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_partition_html_ab22d95d31ef6edfd5a6770ff6d8c4f04"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#ab22d95d31ef6edfd5a6770ff6d8c4f04">operations_research::DynamicPartition::PartOf</a></div><div class="ttdeci">int PartOf(int element) const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00285">dynamic_partition.h:285</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_partition_html_ab8257c32911b0b991bec1af210d993be"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#ab8257c32911b0b991bec1af210d993be">operations_research::DynamicPartition::ParentOfPart</a></div><div class="ttdeci">int ParentOfPart(int part) const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00298">dynamic_partition.h:298</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_partition_html_ad07c56b1579801daaf3a9a750d26e792"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#ad07c56b1579801daaf3a9a750d26e792">operations_research::DynamicPartition::DebugString</a></div><div class="ttdeci">std::string DebugString(DebugStringSorting sorting) const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8cc_source.html#l00185">dynamic_partition.cc:185</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_partition_html_ad8a3eb5fa76f501ec96f1664fc899c3b"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#ad8a3eb5fa76f501ec96f1664fc899c3b">operations_research::DynamicPartition::ElementsInHierarchicalOrder</a></div><div class="ttdeci">const std::vector< int > & ElementsInHierarchicalOrder() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00137">dynamic_partition.h:137</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_partition_html_ae91b7d9b6c4f0675b9ad3f38e5761853"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#ae91b7d9b6c4f0675b9ad3f38e5761853">operations_research::DynamicPartition::NumParts</a></div><div class="ttdeci">const int NumParts() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00062">dynamic_partition.h:62</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_permutation_html"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html">operations_research::DynamicPermutation</a></div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8h_source.html#l00033">dynamic_permutation.h:33</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_permutation_html_a1976819faa164a8d10a66200dc2c3a96"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html#a1976819faa164a8d10a66200dc2c3a96">operations_research::DynamicPermutation::ImageOf</a></div><div class="ttdeci">int ImageOf(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8h_source.html#l00114">dynamic_permutation.h:114</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_permutation_html_a372de693ad40b3f42839c8ec6ac845f4"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html#a372de693ad40b3f42839c8ec6ac845f4">operations_research::DynamicPermutation::Reset</a></div><div class="ttdeci">void Reset()</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8cc_source.html#l00078">dynamic_permutation.cc:78</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_permutation_html_a4829347e4722a1281369b9a251280fcc"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html#a4829347e4722a1281369b9a251280fcc">operations_research::DynamicPermutation::CreateSparsePermutation</a></div><div class="ttdeci">std::unique_ptr< SparsePermutation > CreateSparsePermutation() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8cc_source.html#l00089">dynamic_permutation.cc:89</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_permutation_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html#a764be64f3029f8b8e23511061d8de355">operations_research::DynamicPermutation::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8cc_source.html#l00119">dynamic_permutation.cc:119</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_permutation_html_ae8f61c84a06024a7d6343902f44e7e59"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html#ae8f61c84a06024a7d6343902f44e7e59">operations_research::DynamicPermutation::UndoLastMappings</a></div><div class="ttdeci">void UndoLastMappings(std::vector< int > *undone_mapping_src)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8cc_source.html#l00049">dynamic_permutation.cc:49</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_permutation_html_aeb46445d022e7bc495f212704791824a"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html#aeb46445d022e7bc495f212704791824a">operations_research::DynamicPermutation::AddMappings</a></div><div class="ttdeci">void AddMappings(const std::vector< int > &src, const std::vector< int > &dst)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8cc_source.html#l00027">dynamic_permutation.cc:27</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dynamic_permutation_html_afc48707ddd63d0978b9cfcd17c704694"><div class="ttname"><a href="classoperations__research_1_1_dynamic_permutation.html#afc48707ddd63d0978b9cfcd17c704694">operations_research::DynamicPermutation::AllMappingsSrc</a></div><div class="ttdeci">const std::vector< int > & AllMappingsSrc() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__permutation_8h_source.html#l00067">dynamic_permutation.h:67</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_graph_symmetry_finder_html_a651a63b1943d8b8fa2346df1d1a2f55c"><div class="ttname"><a href="classoperations__research_1_1_graph_symmetry_finder.html#a651a63b1943d8b8fa2346df1d1a2f55c">operations_research::GraphSymmetryFinder::RecursivelyRefinePartitionByAdjacency</a></div><div class="ttdeci">void RecursivelyRefinePartitionByAdjacency(int first_unrefined_part_index, DynamicPartition *partition)</div><div class="ttdef"><b>Definition:</b> <a href="find__graph__symmetries_8cc_source.html#l00199">find_graph_symmetries.cc:199</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_graph_symmetry_finder_html_a998043f7ad1e35dc5f6cb23e18f6e7dd"><div class="ttname"><a href="classoperations__research_1_1_graph_symmetry_finder.html#a998043f7ad1e35dc5f6cb23e18f6e7dd">operations_research::GraphSymmetryFinder::IsGraphAutomorphism</a></div><div class="ttdeci">bool IsGraphAutomorphism(const DynamicPermutation &permutation) const</div><div class="ttdef"><b>Definition:</b> <a href="find__graph__symmetries_8cc_source.html#l00155">find_graph_symmetries.cc:155</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_graph_symmetry_finder_html_acb28211fa0581e72d3dcb6b43ebe857a"><div class="ttname"><a href="classoperations__research_1_1_graph_symmetry_finder.html#acb28211fa0581e72d3dcb6b43ebe857a">operations_research::GraphSymmetryFinder::DistinguishNodeInPartition</a></div><div class="ttdeci">void DistinguishNodeInPartition(int node, DynamicPartition *partition, std::vector< int > *new_singletons_or_null)</div><div class="ttdef"><b>Definition:</b> <a href="find__graph__symmetries_8cc_source.html#l00276">find_graph_symmetries.cc:276</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_graph_symmetry_finder_html_ad1f88654797ab9271206d6a4c013a94e"><div class="ttname"><a href="classoperations__research_1_1_graph_symmetry_finder.html#ad1f88654797ab9271206d6a4c013a94e">operations_research::GraphSymmetryFinder::FindSymmetries</a></div><div class="ttdeci">absl::Status FindSymmetries(std::vector< int > *node_equivalence_classes_io, std::vector< std::unique_ptr< SparsePermutation > > *generators, std::vector< int > *factorized_automorphism_group_size, TimeLimit *time_limit=nullptr)</div><div class="ttdef"><b>Definition:</b> <a href="find__graph__symmetries_8cc_source.html#l00383">find_graph_symmetries.cc:383</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_graph_symmetry_finder_html_af0ae1a4d86cfcf11128fe60ea0f8d20b"><div class="ttname"><a href="classoperations__research_1_1_graph_symmetry_finder.html#af0ae1a4d86cfcf11128fe60ea0f8d20b">operations_research::GraphSymmetryFinder::GraphSymmetryFinder</a></div><div class="ttdeci">GraphSymmetryFinder(const Graph &graph, bool is_undirected)</div><div class="ttdef"><b>Definition:</b> <a href="find__graph__symmetries_8cc_source.html#l00108">find_graph_symmetries.cc:108</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_merging_partition_html"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html">operations_research::MergingPartition</a></div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00204">dynamic_partition.h:204</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_merging_partition_html_a3d5f7b1e62f42b574085e671ae6dfb73"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a3d5f7b1e62f42b574085e671ae6dfb73">operations_research::MergingPartition::NumNodesInSamePartAs</a></div><div class="ttdeci">int NumNodesInSamePartAs(int node)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00252">dynamic_partition.h:252</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_merging_partition_html_a4368033ed0d5b2fc75727265e0c8f2d7"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a4368033ed0d5b2fc75727265e0c8f2d7">operations_research::MergingPartition::ResetNode</a></div><div class="ttdeci">void ResetNode(int node)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00340">dynamic_partition.h:340</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_merging_partition_html_a50eca19efa71a0b70de25f9ad4a2a6f8"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a50eca19efa71a0b70de25f9ad4a2a6f8">operations_research::MergingPartition::Reset</a></div><div class="ttdeci">void Reset(int num_nodes)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8cc_source.html#l00206">dynamic_partition.cc:206</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_merging_partition_html_a612bd8d97219124a8d6fbac721bcdbc6"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a612bd8d97219124a8d6fbac721bcdbc6">operations_research::MergingPartition::MergePartsOf</a></div><div class="ttdeci">int MergePartsOf(int node1, int node2)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8cc_source.html#l00214">dynamic_partition.cc:214</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_merging_partition_html_a62cb833403d7861c5badb4de3389e06e"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a62cb833403d7861c5badb4de3389e06e">operations_research::MergingPartition::FillEquivalenceClasses</a></div><div class="ttdeci">int FillEquivalenceClasses(std::vector< int > *node_equivalence_classes)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8cc_source.html#l00262">dynamic_partition.cc:262</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_merging_partition_html_a80761f181b521aa284b7e687776b9fde"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a80761f181b521aa284b7e687776b9fde">operations_research::MergingPartition::KeepOnlyOneNodePerPart</a></div><div class="ttdeci">void KeepOnlyOneNodePerPart(std::vector< int > *nodes)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8cc_source.html#l00246">dynamic_partition.cc:246</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_permutation_html"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html">operations_research::SparsePermutation</a></div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00027">sparse_permutation.h:27</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_permutation_html_a8c5fc5af6e649a82d169f61e4dab5e33"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#a8c5fc5af6e649a82d169f61e4dab5e33">operations_research::SparsePermutation::NumCycles</a></div><div class="ttdeci">int NumCycles() const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00033">sparse_permutation.h:33</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_permutation_html_af567b4e287e268eb9ecee908f63e5b64"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#af567b4e287e268eb9ecee908f63e5b64">operations_research::SparsePermutation::Cycle</a></div><div class="ttdeci">Iterator Cycle(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00117">sparse_permutation.h:117</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_stats_group_html_aa8fc83a27372d89cee2a2e5dd024b515a0a1aa84c65d99c7f8c2a52a0cb4b02b8"><div class="ttname"><a href="classoperations__research_1_1_stats_group.html#aa8fc83a27372d89cee2a2e5dd024b515a0a1aa84c65d99c7f8c2a52a0cb4b02b8">operations_research::StatsGroup::SORT_BY_NAME</a></div><div class="ttdeci">@ SORT_BY_NAME</div><div class="ttdef"><b>Definition:</b> <a href="stats_8h_source.html#l00135">stats.h:135</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html">operations_research::TimeLimit</a></div><div class="ttdoc">A simple class to enforce both an elapsed time limit and a deterministic time limit in the same threa...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00106">time_limit.h:106</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html_a810d5f7aaf80cc09cf5a094e20c1aaca"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">operations_research::TimeLimit::LimitReached</a></div><div class="ttdeci">bool LimitReached()</div><div class="ttdoc">Returns true when the external limit is true, or the deterministic time is over the deterministic lim...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00546">time_limit.h:546</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html_af90cfd1fc238433fc303ee28c5914eb9"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html#af90cfd1fc238433fc303ee28c5914eb9">operations_research::TimeLimit::AdvanceDeterministicTime</a></div><div class="ttdeci">void AdvanceDeterministicTime(double deterministic_duration)</div><div class="ttdoc">Advances the deterministic time.</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00227">time_limit.h:227</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1_base_graph_html_a4d3fc55a2fe209a908470199437cec9a"><div class="ttname"><a href="classutil_1_1_base_graph.html#a4d3fc55a2fe209a908470199437cec9a">util::BaseGraph::num_arcs</a></div><div class="ttdeci">ArcIndexType num_arcs() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00207">graph.h:207</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1_base_graph_html_a6a2df5042167b234f6dc3aed4acfa6c9"><div class="ttname"><a href="classutil_1_1_base_graph.html#a6a2df5042167b234f6dc3aed4acfa6c9">util::BaseGraph::num_nodes</a></div><div class="ttdeci">NodeIndexType num_nodes() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00204">graph.h:204</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1_base_graph_html_a8a40f2c75615a26ba71e94dd7d42f481"><div class="ttname"><a href="classutil_1_1_base_graph.html#a8a40f2c75615a26ba71e94dd7d42f481">util::BaseGraph::AllNodes</a></div><div class="ttdeci">IntegerRange< NodeIndex > AllNodes() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00937">graph.h:937</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1_begin_end_wrapper_html"><div class="ttname"><a href="classutil_1_1_begin_end_wrapper.html">util::BeginEndWrapper</a></div><div class="ttdef"><b>Definition:</b> <a href="iterators_8h_source.html#l00038">iterators.h:38</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1_static_graph_html"><div class="ttname"><a href="classutil_1_1_static_graph.html">util::StaticGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00399">graph.h:399</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1_static_graph_html_aceb0938bcb2e8e5f37986d4cf8e3a955"><div class="ttname"><a href="classutil_1_1_static_graph.html#aceb0938bcb2e8e5f37986d4cf8e3a955">util::StaticGraph::Head</a></div><div class="ttdeci">NodeIndexType Head(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01315">graph.h:1315</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1_static_graph_html_aeacdf885cd6777318b5aa4ef864e1066"><div class="ttname"><a href="classutil_1_1_static_graph.html#aeacdf885cd6777318b5aa4ef864e1066">util::StaticGraph::OutgoingArcs</a></div><div class="ttdeci">BeginEndWrapper< OutgoingArcIterator > OutgoingArcs(NodeIndexType node) const</div></div>
|
|
<div class="ttc" id="acommandlineflags_8h_html"><div class="ttname"><a href="commandlineflags_8h.html">commandlineflags.h</a></div></div>
|
|
<div class="ttc" id="acp__model__solver_8cc_html_aec8af5c1be4e1b6d4330e1161028de21"><div class="ttname"><a href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a></div><div class="ttdeci">ModelSharedTimeLimit * time_limit</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l02050">cp_model_solver.cc:2050</a></div></div>
|
|
<div class="ttc" id="adense__doubly__linked__list_8h_html"><div class="ttname"><a href="dense__doubly__linked__list_8h.html">dense_doubly_linked_list.h</a></div></div>
|
|
<div class="ttc" id="adynamic__partition_8h_html"><div class="ttname"><a href="dynamic__partition_8h.html">dynamic_partition.h</a></div></div>
|
|
<div class="ttc" id="adynamic__permutation_8h_html"><div class="ttname"><a href="dynamic__permutation_8h.html">dynamic_permutation.h</a></div></div>
|
|
<div class="ttc" id="afind__graph__symmetries_8cc_html_a319b3c460e91c76ad49c4589748e4f0c"><div class="ttname"><a href="find__graph__symmetries_8cc.html#a319b3c460e91c76ad49c4589748e4f0c">ABSL_FLAG</a></div><div class="ttdeci">ABSL_FLAG(bool, minimize_permutation_support_size, false, "Tweak the algorithm to try and minimize the support size" " of the generators produced. This may negatively impact the" " performance, but works great on the sat_holeXXX benchmarks" " to reduce the support size.")</div></div>
|
|
<div class="ttc" id="afind__graph__symmetries_8h_html"><div class="ttname"><a href="find__graph__symmetries_8h.html">find_graph_symmetries.h</a></div></div>
|
|
<div class="ttc" id="agraph_2util_8h_html"><div class="ttname"><a href="graph_2util_8h.html">util.h</a></div></div>
|
|
<div class="ttc" id="aiterators_8h_html"><div class="ttname"><a href="iterators_8h.html">iterators.h</a></div></div>
|
|
<div class="ttc" id="alocal__search_8cc_html_a30b5726116ac85ea64777e5d6e333894"><div class="ttname"><a href="local__search_8cc.html#a30b5726116ac85ea64777e5d6e333894">arc</a></div><div class="ttdeci">int arc</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l02751">local_search.cc:2751</a></div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_ab4a2cbab234914b320b7fae11b6e8cb9"><div class="ttname"><a href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a></div><div class="ttdeci">const int INFO</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00031">log_severity.h:31</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html_a7f536a3b33f9bed8f75734e035d30725"><div class="ttname"><a href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a></div><div class="ttdeci">const bool DEBUG_MODE</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00024">macros.h:24</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a5de89a1f6e3f80a49a0d76136d8044e2"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">operations_research::math_opt::swap</a></div><div class="ttdeci">void swap(IdMap< K, V > &a, IdMap< K, V > &b)</div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00262">id_map.h:262</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_ac3308533dde4fc559cab6f4f171d54c9"><div class="ttname"><a href="namespaceoperations__research.html#ac3308533dde4fc559cab6f4f171d54c9">operations_research::ScopedTimeDistributionUpdater</a></div><div class="ttdeci">DisabledScopedTimeDistributionUpdater ScopedTimeDistributionUpdater</div><div class="ttdef"><b>Definition:</b> <a href="stats_8h_source.html#l00434">stats.h:434</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_html_aa94a02ae5c14feb50676668f2de166dc"><div class="ttname"><a href="namespaceutil.html#aa94a02ae5c14feb50676668f2de166dc">util::GraphIsSymmetric</a></div><div class="ttdeci">bool GraphIsSymmetric(const Graph &graph)</div><div class="ttdef"><b>Definition:</b> <a href="graph_2util_8h_source.html#l00218">graph/util.h:218</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_a6b7983ccd32c86cbbc3d4d9cda4cac17"><div class="ttname"><a href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a></div><div class="ttdeci">int nodes</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03997">routing_search.cc:3997</a></div></div>
|
|
<div class="ttc" id="asparse__permutation_8h_html"><div class="ttname"><a href="sparse__permutation_8h.html">sparse_permutation.h</a></div></div>
|
|
<div class="ttc" id="astats_8h_html_a3c3e6b102f0d91c523099325c98e1887"><div class="ttname"><a href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a></div><div class="ttdeci">#define IF_STATS_ENABLED(instructions)</div><div class="ttdef"><b>Definition:</b> <a href="stats_8h_source.html#l00437">stats.h:437</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_dynamic_partition_1_1_iterable_part_html_a895e8e66079521889215308182c5591b"><div class="ttname"><a href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#a895e8e66079521889215308182c5591b">operations_research::DynamicPartition::IterablePart::begin</a></div><div class="ttdeci">std::vector< int >::const_iterator begin() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00185">dynamic_partition.h:185</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_dynamic_partition_1_1_iterable_part_html_af9593d4a5ff4274efaf429cb4f9e57cc"><div class="ttname"><a href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#af9593d4a5ff4274efaf429cb4f9e57cc">operations_research::DynamicPartition::IterablePart::size</a></div><div class="ttdeci">int size() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00190">dynamic_partition.h:190</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_80dda7a75b0dfcf996988638a63eb03a.html">algorithms</a></li><li class="navelem"><a class="el" href="find__graph__symmetries_8cc.html">find_graph_symmetries.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>
|