439 lines
62 KiB
HTML
439 lines
62 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.18"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: cp_model_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">8.0</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.18 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('cp__model__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">cp_model_symmetries.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="cp__model__symmetries_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="cp__model__symmetries_8h.html">ortools/sat/cp_model_symmetries.h</a>"</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  </div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>  </div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include "absl/memory/memory.h"</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "google/protobuf/repeated_field.h"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</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 name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="hash_8h.html">ortools/base/hash.h</a>"</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="map__util_8h.html">ortools/base/map_util.h</a>"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="cp__model__utils_8h.html">ortools/sat/cp_model_utils.h</a>"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  </div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  </div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="keyword">struct </span>VectorHash {</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  std::size_t operator()(<span class="keyword">const</span> std::vector<int64>& values)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keywordtype">size_t</span> <a class="code" href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a> = 0;</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> : values) {</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <a class="code" href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a> = <a class="code" href="namespaceutil__hash.html#aa2ba7114404f5416e797636b0e1eddcd">util_hash::Hash</a>(<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>, <a class="code" href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a>);</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  }</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordflow">return</span> <a class="code" href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a>;</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  }</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> };</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  </div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// A simple class to generate equivalence class number for</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// GenerateGraphForSymmetryDetection().</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="keyword">class </span>IdGenerator {</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  IdGenerator() {}</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  </div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="comment">// If the key was never seen before, then generate a new id, otherwise return</span></div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="comment">// the previously generated id.</span></div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordtype">int</span> GetId(<span class="keyword">const</span> std::vector<int64>& key) {</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">return</span> <a class="code" href="namespacegtl.html#a7a0f8dc4187504b814d8a8be463b517c">gtl::LookupOrInsert</a>(&id_map_, key, id_map_.size());</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  }</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  </div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  absl::flat_hash_map<std::vector<int64>, int, VectorHash> id_map_;</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> };</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  </div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// Appends values in `repeated_field` to `vector`.</span></div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// We use a template as proto int64 != C++ int64 in open source.</span></div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="keyword">template</span> <<span class="keyword">typename</span> FieldInt64Type></div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="keywordtype">void</span> Append(</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keyword">const</span> google::protobuf::RepeatedField<FieldInt64Type>& repeated_field,</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  std::vector<int64>* vector) {</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  CHECK(vector != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> FieldInt64Type <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> : repeated_field) {</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  vector->push_back(<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>);</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  }</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> }</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  </div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// Returns a graph whose automorphisms can be mapped back to the symmetries of</span></div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment">// the model described in the given CpModelProto.</span></div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// Any permutation of the graph that respects the initial_equivalence_classes</span></div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment">// output can be mapped to a symmetry of the given problem simply by taking its</span></div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// restriction on the first num_variables nodes and interpreting its index as a</span></div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment">// variable index. In a sense, a node with a low enough index #i is in</span></div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment">// one-to-one correspondence with the variable #i (using the index</span></div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment">// representation of variables).</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment">// The format of the initial_equivalence_classes is the same as the one</span></div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment">// described in GraphSymmetryFinder::FindSymmetries(). The classes must be dense</span></div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment">// in [0, num_classes) and any symmetry will only map nodes with the same class</span></div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// between each other.</span></div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> std::unique_ptr<Graph> <a class="code" href="namespaceoperations__research_1_1sat.html#a3f6fa74408ea28eb41f29e9696d9a9a2">GenerateGraphForSymmetryDetection</a>(</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keyword">const</span> CpModelProto& problem,</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  std::vector<int>* initial_equivalence_classes) {</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  CHECK(initial_equivalence_classes != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  </div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_variables = problem.variables_size();</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">auto</span> graph = absl::make_unique<Graph>();</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  initial_equivalence_classes->clear();</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">enum</span> NodeType {</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  VARIABLE_NODE,</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  CONSTRAINT_NODE,</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  CONSTRAINT_COEFFICIENT_NODE,</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  ENFORCEMENT_LITERAL</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  };</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  IdGenerator id_generator;</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  </div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// For two variables to be in the same equivalence class, they need to have</span></div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">// the same objective coefficient, and the same possible bounds.</span></div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  std::vector<int64> objective_by_var(num_variables, 0);</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < problem.objective().vars_size(); ++i) {</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  objective_by_var[problem.objective().vars(i)] =</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  problem.objective().coeffs(i);</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  }</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  </div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">auto</span> new_node = [&initial_equivalence_classes,</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  &id_generator](<span class="keyword">const</span> std::vector<int64>& key) {</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="comment">// Since we add nodes one by one, initial_equivalence_classes->size() gives</span></div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="comment">// the number of nodes at any point, which we use as the next node index.</span></div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> node = initial_equivalence_classes->size();</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  initial_equivalence_classes->push_back(id_generator.GetId(key));</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">return</span> node;</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  };</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  </div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v = 0; v < num_variables; ++v) {</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keyword">const</span> IntegerVariableProto& variable = problem.variables(v);</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  std::vector<int64> key = {VARIABLE_NODE, objective_by_var[v]};</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  Append(variable.domain(), &key);</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  CHECK_EQ(v, new_node(key));</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="comment">// Make sure the graph contains all the variable nodes, even if no edges are</span></div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="comment">// attached to them through constraints.</span></div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  graph->AddNode(v);</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  }</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  </div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keyword">auto</span> add_edge = [&graph](<span class="keywordtype">int</span> node_1, <span class="keywordtype">int</span> node_2) {</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  graph->AddArc(node_1, node_2);</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  graph->AddArc(node_2, node_1);</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  };</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">auto</span> add_literal_edge = [&add_edge, &new_node](<span class="keywordtype">int</span> ref, <span class="keywordtype">int</span> constraint_node) {</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> variable_node = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(ref);</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(ref)) {</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  add_edge(variable_node, constraint_node);</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> coefficient_node = new_node({CONSTRAINT_COEFFICIENT_NODE, -1});</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  </div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  add_edge(variable_node, coefficient_node);</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  add_edge(coefficient_node, constraint_node);</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  }</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  };</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  </div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">// Add constraints to the graph.</span></div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ConstraintProto& constraint : problem.constraints()) {</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> constraint_node = initial_equivalence_classes->size();</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  std::vector<int64> key = {CONSTRAINT_NODE, constraint.constraint_case()};</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  </div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">switch</span> (constraint.constraint_case()) {</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordflow">case</span> ConstraintProto::kLinear: {</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  Append(constraint.linear().domain(), &key);</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  CHECK_EQ(constraint_node, new_node(key));</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  </div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < constraint.linear().vars_size(); ++i) {</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordflow">if</span> (constraint.linear().coeffs(i) == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> ref = constraint.linear().vars(i);</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> variable_node = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(ref);</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> coeff = <a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(ref)</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  ? constraint.linear().coeffs(i)</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  : -constraint.linear().coeffs(i);</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">if</span> (coeff == 1) {</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="comment">// For all coefficients equal to one, which are the most common, we</span></div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="comment">// can optimize the size of the graph by omitting the coefficient</span></div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="comment">// node altogether.</span></div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  add_edge(variable_node, constraint_node);</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> coefficient_node =</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  new_node({CONSTRAINT_COEFFICIENT_NODE, coeff});</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  </div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  add_edge(variable_node, coefficient_node);</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  add_edge(coefficient_node, constraint_node);</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  }</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  }</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">case</span> ConstraintProto::kBoolOr: {</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  CHECK_EQ(constraint_node, new_node(key));</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> ref : constraint.bool_or().literals()) {</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  add_literal_edge(ref, constraint_node);</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  }</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  }</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">case</span> ConstraintProto::kBoolXor: {</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  CHECK_EQ(constraint_node, new_node(key));</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> ref : constraint.bool_xor().literals()) {</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  add_literal_edge(ref, constraint_node);</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  }</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  }</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">case</span> ConstraintProto::kBoolAnd: {</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">if</span> (constraint.enforcement_literal_size() == 0) {</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// All literals are true in this case.</span></div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  CHECK_EQ(constraint_node, new_node(key));</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> ref : constraint.bool_and().literals()) {</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  add_literal_edge(ref, constraint_node);</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  }</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  }</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  </div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">// To make the BoolAnd constraint more generic in the graph, we expand</span></div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="comment">// it into a set of BoolOr constraints where</span></div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="comment">// not(enforcement_literal) OR literal = true</span></div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="comment">// for all constraint's literals. This is equivalent to</span></div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">// enforcement_literal => literal</span></div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="comment">// for all literals.</span></div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  std::vector<int64> key = {CONSTRAINT_NODE, ConstraintProto::kBoolOr};</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> non_enforcement_literal =</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#ae0803b8198728cd4f6e58498d9c60091">NegatedRef</a>(constraint.enforcement_literal(0));</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : constraint.bool_and().literals()) {</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> constraint_node = new_node(key);</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  add_literal_edge(non_enforcement_literal, constraint_node);</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  add_literal_edge(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>, constraint_node);</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  }</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  }</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordflow">default</span>: {</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="comment">// If the model contains any non-supported constraints, return an empty</span></div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="comment">// graph.</span></div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="comment">// TODO(user): support other types of constraints.</span></div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  LOG(ERROR) << <span class="stringliteral">"Unsupported constraint type "</span></div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  << constraint.constraint_case();</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  }</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  }</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  </div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">if</span> (constraint.constraint_case() != ConstraintProto::kBoolAnd &&</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  constraint.enforcement_literal_size() > 0) {</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> ref = constraint.enforcement_literal(0);</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> enforcement_literal_node = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(ref);</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> enforcement_type_node =</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  new_node({ENFORCEMENT_LITERAL, <a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(ref)});</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  </div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  add_edge(constraint_node, enforcement_type_node);</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  add_edge(enforcement_type_node, enforcement_literal_node);</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  }</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  }</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  </div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  graph->Build();</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  DCHECK_EQ(graph->num_nodes(), initial_equivalence_classes->size());</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordflow">return</span> graph;</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span> }</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  </div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a418890b4cbc1a5c377cd8e6a7a6bc881"> 243</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a418890b4cbc1a5c377cd8e6a7a6bc881">FindCpModelSymmetries</a>(</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keyword">const</span> CpModelProto& problem,</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  std::vector<std::unique_ptr<SparsePermutation>>* generators,</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordtype">double</span> time_limit_seconds) {</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  CHECK(generators != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  generators->clear();</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  </div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keyword">typedef</span> <a class="code" href="classutil_1_1StaticGraph.html">GraphSymmetryFinder::Graph</a> <a class="code" href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">Graph</a>;</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  </div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  std::vector<int> equivalence_classes;</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  std::unique_ptr<Graph> graph(</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  GenerateGraphForSymmetryDetection<Graph>(problem, &equivalence_classes));</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordflow">if</span> (graph == <span class="keyword">nullptr</span>) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  </div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  LOG(INFO) << <span class="stringliteral">"Graph has "</span> << graph->num_nodes() << <span class="stringliteral">" nodes and "</span></div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  << graph->num_arcs() / 2 << <span class="stringliteral">" edges."</span>;</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  </div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <a class="code" href="classoperations__research_1_1GraphSymmetryFinder.html">GraphSymmetryFinder</a> symmetry_finder(*graph, <span class="comment">/*is_undirected=*/</span><span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  std::vector<int> factorized_automorphism_group_size;</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <a class="code" href="base_2logging_8h.html#a9f96ed9f06763f0821fdbb4d29031d8d">CHECK_OK</a>(symmetry_finder.<a class="code" href="classoperations__research_1_1GraphSymmetryFinder.html#a3a3796326515a59739024432c5dff6d8">FindSymmetries</a>(time_limit_seconds,</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  &equivalence_classes, generators,</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  &factorized_automorphism_group_size));</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  </div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="comment">// Remove from the permutations the part not concerning the variables.</span></div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="comment">// Note that some permutations may become empty, which means that we had</span></div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="comment">// duplicate constraints.</span></div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordtype">double</span> average_support_size = 0.0;</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordtype">int</span> num_generators = 0;</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < generators->size(); ++i) {</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <a class="code" href="classoperations__research_1_1SparsePermutation.html">SparsePermutation</a>* permutation = (*generators)[i].get();</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  std::vector<int> to_delete;</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < permutation-><a class="code" href="classoperations__research_1_1SparsePermutation.html#a8c5fc5af6e649a82d169f61e4dab5e33">NumCycles</a>(); ++j) {</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="comment">// Because variable nodes are in a separate equivalence class than any</span></div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// other node, a cycle can either contain only variable nodes or none, so</span></div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="comment">// we just need to check one element of the cycle.</span></div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">if</span> (*(permutation-><a class="code" href="classoperations__research_1_1SparsePermutation.html#af567b4e287e268eb9ecee908f63e5b64">Cycle</a>(j).<a class="code" href="structoperations__research_1_1SparsePermutation_1_1Iterator.html#a8497b34029ee966694083aa34c9022b5">begin</a>()) >= problem.variables_size()) {</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  to_delete.push_back(j);</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="comment">// Verify that the cycle's entire support does not touch any variable.</span></div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : permutation-><a class="code" href="classoperations__research_1_1SparsePermutation.html#af567b4e287e268eb9ecee908f63e5b64">Cycle</a>(j)) {</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  DCHECK_GE(node, problem.variables_size());</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  }</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  }</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  }</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  }</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  permutation-><a class="code" href="classoperations__research_1_1SparsePermutation.html#a9add43490c45e4334099bb15b6e6eab0">RemoveCycles</a>(to_delete);</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">if</span> (!permutation-><a class="code" href="classoperations__research_1_1SparsePermutation.html#ab601acb5aed920b1e61210d497462976">Support</a>().empty()) {</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  average_support_size += permutation-><a class="code" href="classoperations__research_1_1SparsePermutation.html#ab601acb5aed920b1e61210d497462976">Support</a>().size();</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  swap((*generators)[num_generators], (*generators)[i]);</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  ++num_generators;</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  LOG(INFO) << <span class="stringliteral">"The model contains duplicate constraints!"</span>;</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  }</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  }</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  generators->resize(num_generators);</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  average_support_size /= num_generators;</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  LOG(INFO) << <span class="stringliteral">"# of generators: "</span> << num_generators;</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  LOG(INFO) << <span class="stringliteral">"Average support size: "</span> << average_support_size;</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span> }</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  </div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span> } <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span> } <span class="comment">// namespace operations_research</span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div class="ttc" id="anamespacegtl_html_a7a0f8dc4187504b814d8a8be463b517c"><div class="ttname"><a href="namespacegtl.html#a7a0f8dc4187504b814d8a8be463b517c">gtl::LookupOrInsert</a></div><div class="ttdeci">Collection::value_type::second_type & LookupOrInsert(Collection *const collection, const typename Collection::value_type::first_type &key, const typename Collection::value_type::second_type &value)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00207">map_util.h:207</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SparsePermutation_html_af567b4e287e268eb9ecee908f63e5b64"><div class="ttname"><a href="classoperations__research_1_1SparsePermutation.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="amap__util_8h_html"><div class="ttname"><a href="map__util_8h.html">map_util.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a9f96ed9f06763f0821fdbb4d29031d8d"><div class="ttname"><a href="base_2logging_8h.html#a9f96ed9f06763f0821fdbb4d29031d8d">CHECK_OK</a></div><div class="ttdeci">#define CHECK_OK(x)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00030">base/logging.h:29</a></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="anamespaceutil_html_a2f76166dbe0c4055a1f256235ad00478"><div class="ttname"><a href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">util::Graph</a></div><div class="ttdeci">ListGraph Graph</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02354">graph.h:2354</a></div></div>
|
|
<div class="ttc" id="amatrix__utils_8cc_html_ad96c5e641806a06a23e5d5b9fca20e89"><div class="ttname"><a href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a></div><div class="ttdeci">int64 hash</div><div class="ttdef"><b>Definition:</b> <a href="matrix__utils_8cc_source.html#l00060">matrix_utils.cc:60</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a21edc7ca4cc5802c8779d68556bc09cf"><div class="ttname"><a href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a></div><div class="ttdeci">int64 value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SparsePermutation_html_a8c5fc5af6e649a82d169f61e4dab5e33"><div class="ttname"><a href="classoperations__research_1_1SparsePermutation.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_1GraphSymmetryFinder_html"><div class="ttname"><a href="classoperations__research_1_1GraphSymmetryFinder.html">operations_research::GraphSymmetryFinder</a></div><div class="ttdef"><b>Definition:</b> <a href="find__graph__symmetries_8h_source.html#l00043">find_graph_symmetries.h:43</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a"><div class="ttname"><a href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a></div><div class="ttdeci">int64_t int64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00034">integral_types.h:34</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_acdbc8ad33149d45a6e6fcd8b72fd68ed"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">operations_research::sat::PositiveRef</a></div><div class="ttdeci">int PositiveRef(int ref)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__utils_8h_source.html#l00033">cp_model_utils.h:33</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html_a7f536a3b33f9bed8f75734e035d30725"><div class="ttname"><a href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a></div><div class="ttdeci">const bool DEBUG_MODE</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00024">macros.h:24</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SparsePermutation_html_ab601acb5aed920b1e61210d497462976"><div class="ttname"><a href="classoperations__research_1_1SparsePermutation.html#ab601acb5aed920b1e61210d497462976">operations_research::SparsePermutation::Support</a></div><div class="ttdeci">const std::vector< int > & Support() const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00037">sparse_permutation.h:37</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SparsePermutation_html_a9add43490c45e4334099bb15b6e6eab0"><div class="ttname"><a href="classoperations__research_1_1SparsePermutation.html#a9add43490c45e4334099bb15b6e6eab0">operations_research::SparsePermutation::RemoveCycles</a></div><div class="ttdeci">void RemoveCycles(const std::vector< int > &cycle_indices)</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8cc_source.html#l00023">sparse_permutation.cc:23</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1StaticGraph_html"><div class="ttname"><a href="classutil_1_1StaticGraph.html">util::StaticGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00396">graph.h:396</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1SparsePermutation_1_1Iterator_html_a8497b34029ee966694083aa34c9022b5"><div class="ttname"><a href="structoperations__research_1_1SparsePermutation_1_1Iterator.html#a8497b34029ee966694083aa34c9022b5">operations_research::SparsePermutation::Iterator::begin</a></div><div class="ttdeci">std::vector< int >::const_iterator begin() const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00109">sparse_permutation.h:109</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ae0803b8198728cd4f6e58498d9c60091"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae0803b8198728cd4f6e58498d9c60091">operations_research::sat::NegatedRef</a></div><div class="ttdeci">int NegatedRef(int ref)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__utils_8h_source.html#l00032">cp_model_utils.h:32</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a3f6fa74408ea28eb41f29e9696d9a9a2"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3f6fa74408ea28eb41f29e9696d9a9a2">operations_research::sat::GenerateGraphForSymmetryDetection</a></div><div class="ttdeci">Graph * GenerateGraphForSymmetryDetection(const LinearBooleanProblem &problem, std::vector< int > *initial_equivalence_classes)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00532">boolean_problem.cc:532</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SparsePermutation_html"><div class="ttname"><a href="classoperations__research_1_1SparsePermutation.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="anamespaceoperations__research_1_1sat_html_a217338425de4389014563f1f24331713"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">operations_research::sat::RefIsPositive</a></div><div class="ttdeci">bool RefIsPositive(int ref)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__utils_8h_source.html#l00034">cp_model_utils.h:34</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a418890b4cbc1a5c377cd8e6a7a6bc881"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a418890b4cbc1a5c377cd8e6a7a6bc881">operations_research::sat::FindCpModelSymmetries</a></div><div class="ttdeci">void FindCpModelSymmetries(const CpModelProto &problem, std::vector< std::unique_ptr< SparsePermutation >> *generators, double time_limit_seconds)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__symmetries_8cc_source.html#l00243">cp_model_symmetries.cc:243</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GraphSymmetryFinder_html_a3a3796326515a59739024432c5dff6d8"><div class="ttname"><a href="classoperations__research_1_1GraphSymmetryFinder.html#a3a3796326515a59739024432c5dff6d8">operations_research::GraphSymmetryFinder::FindSymmetries</a></div><div class="ttdeci">absl::Status FindSymmetries(double time_limit_seconds, std::vector< int > *node_equivalence_classes_io, std::vector< std::unique_ptr< SparsePermutation > > *generators, std::vector< int > *factorized_automorphism_group_size)</div><div class="ttdef"><b>Definition:</b> <a href="find__graph__symmetries_8cc_source.html#l00355">find_graph_symmetries.cc:355</a></div></div>
|
|
<div class="ttc" id="ahash_8h_html"><div class="ttname"><a href="hash_8h.html">hash.h</a></div></div>
|
|
<div class="ttc" id="aoptimization_8cc_html_af63dcc00f2023fdf498e0829e6fb8a6b"><div class="ttname"><a href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a></div><div class="ttdeci">Literal literal</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00084">optimization.cc:84</a></div></div>
|
|
<div class="ttc" id="acp__model__symmetries_8h_html"><div class="ttname"><a href="cp__model__symmetries_8h.html">cp_model_symmetries.h</a></div></div>
|
|
<div class="ttc" id="anamespaceutil__hash_html_aa2ba7114404f5416e797636b0e1eddcd"><div class="ttname"><a href="namespaceutil__hash.html#aa2ba7114404f5416e797636b0e1eddcd">util_hash::Hash</a></div><div class="ttdeci">uint64 Hash(uint64 num, uint64 c)</div><div class="ttdef"><b>Definition:</b> <a href="hash_8h_source.html#l00150">hash.h:150</a></div></div>
|
|
<div class="ttc" id="acp__model__utils_8h_html"><div class="ttname"><a href="cp__model__utils_8h.html">cp_model_utils.h</a></div></div>
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="cp__model__symmetries_8cc.html">cp_model_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.8.18 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|