Files
ortools-clone/docs/cpp/sparse__permutation_8cc_source.html

192 lines
19 KiB
HTML
Raw Normal View History

2020-09-02 09:42:51 +02:00
<!-- 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"/>
2020-10-09 12:00:09 +02:00
<meta name="generator" content="Doxygen 1.8.20"/>
2020-09-02 09:42:51 +02:00
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>OR-Tools: sparse_permutation.cc Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">OR-Tools
&#160;<span id="projectnumber">8.0</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
2020-10-09 12:00:09 +02:00
<!-- Generated by Doxygen 1.8.20 -->
2020-09-02 09:42:51 +02:00
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;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&amp;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&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('sparse__permutation_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">sparse_permutation.cc</div> </div>
</div><!--header-->
<div class="contents">
<a href="sparse__permutation_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>&#160;<span class="comment">// Copyright 2010-2018 Google LLC</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="comment">// Licensed under the Apache License, Version 2.0 (the &quot;License&quot;);</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<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>&#160;<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>&#160;<span class="comment">//</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<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>&#160;<span class="comment">//</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<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>&#160;<span class="comment">// distributed under the License is distributed on an &quot;AS IS&quot; BASIS,</span></div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;<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>&#160;<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>&#160;<span class="comment">// limitations under the License.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>&#160; </div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="sparse__permutation_8h.html">ortools/algorithms/sparse_permutation.h</a>&quot;</span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160; </div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;<span class="preprocessor">#include &lt;algorithm&gt;</span></div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160; </div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="preprocessor">#include &quot;absl/strings/str_join.h&quot;</span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>&quot;</span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160; </div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160; </div>
2020-10-09 12:00:09 +02:00
<div class="line"><a name="l00023"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_permutation.html#a9add43490c45e4334099bb15b6e6eab0"> 23</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_sparse_permutation.html#a9add43490c45e4334099bb15b6e6eab0">SparsePermutation::RemoveCycles</a>(<span class="keyword">const</span> std::vector&lt;int&gt;&amp; cycle_indices) {</div>
2020-09-02 09:42:51 +02:00
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160; <span class="comment">// TODO(user): make this a class member to avoid allocation if the complexity</span></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160; <span class="comment">// becomes an issue. In this case, also optimize the loop below by not copying</span></div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160; <span class="comment">// the first cycles.</span></div>
2020-10-09 12:00:09 +02:00
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160; std::vector&lt;bool&gt; should_be_deleted(<a class="code" href="classoperations__research_1_1_sparse_permutation.html#a8c5fc5af6e649a82d169f61e4dab5e33">NumCycles</a>(), <span class="keyword">false</span>);</div>
2020-09-02 09:42:51 +02:00
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : cycle_indices) {</div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160; DCHECK_GE(i, 0);</div>
2020-10-09 12:00:09 +02:00
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160; DCHECK_LT(i, <a class="code" href="classoperations__research_1_1_sparse_permutation.html#a8c5fc5af6e649a82d169f61e4dab5e33">NumCycles</a>());</div>
2020-09-02 09:42:51 +02:00
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160; DCHECK(!should_be_deleted[i])</div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160; &lt;&lt; <span class="stringliteral">&quot;Duplicate index given to RemoveCycles(): &quot;</span> &lt;&lt; i;</div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160; should_be_deleted[i] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; }</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160; <span class="keywordtype">int</span> new_cycles_size = 0; <span class="comment">// new index in cycles_</span></div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160; <span class="keywordtype">int</span> new_cycle_ends_size = 0; <span class="comment">// new index in cycle_ends_</span></div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160; <span class="keywordtype">int</span> start = 0;</div>
2020-10-09 12:00:09 +02:00
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code" href="classoperations__research_1_1_sparse_permutation.html#a8c5fc5af6e649a82d169f61e4dab5e33">NumCycles</a>(); ++i) {</div>
2020-09-02 09:42:51 +02:00
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> end = cycle_ends_[i];</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; <span class="keywordflow">if</span> (!should_be_deleted[i]) {</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = start; j &lt; end; ++j) {</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; cycles_[new_cycles_size++] = cycles_[j];</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; }</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; cycle_ends_[new_cycle_ends_size++] = new_cycles_size;</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; }</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; start = end;</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; }</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; cycles_.resize(new_cycles_size);</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; cycle_ends_.resize(new_cycle_ends_size);</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160;}</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; </div>
2020-10-09 12:00:09 +02:00
<div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sparse_permutation.html#a764be64f3029f8b8e23511061d8de355"> 52</a></span>&#160;std::string <a class="code" href="classoperations__research_1_1_sparse_permutation.html#a764be64f3029f8b8e23511061d8de355">SparsePermutation::DebugString</a>()<span class="keyword"> const </span>{</div>
2020-09-02 09:42:51 +02:00
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; DCHECK_EQ(cycles_.empty(), cycle_ends_.empty());</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <span class="keywordflow">if</span> (!cycles_.empty()) DCHECK_EQ(cycles_.size(), cycle_ends_.back());</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; std::vector&lt;std::vector&lt;int&gt;&gt; cycles;</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <span class="keywordtype">int</span> start = 0;</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> end : cycle_ends_) {</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; <span class="comment">// Find the minimum.</span></div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <span class="keywordtype">int</span> min_pos = start;</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = start + 1; i &lt; end; ++i) {</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <span class="keywordflow">if</span> (cycles_[i] &lt; cycles_[min_pos]) min_pos = i;</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; }</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; std::vector&lt;int&gt; cycle;</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = min_pos; i &lt; end; ++i) cycle.push_back(cycles_[i]);</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = start; i &lt; min_pos; ++i) cycle.push_back(cycles_[i]);</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; cycles.push_back(cycle);</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; start = end;</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; }</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; std::sort(cycles.begin(), cycles.end());</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; std::string out;</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">const</span> std::vector&lt;int&gt;&amp; cycle : cycles) {</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; <span class="keywordflow">if</span> (!out.empty()) out += <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; out += <span class="stringliteral">&quot;(&quot;</span>;</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; out += absl::StrJoin(cycle, <span class="stringliteral">&quot; &quot;</span>);</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; out += <span class="stringliteral">&quot;)&quot;</span>;</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; }</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; <span class="keywordflow">return</span> out;</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160;}</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; </div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160;} <span class="comment">// namespace operations_research</span></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<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="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
2020-10-09 12:00:09 +02:00
<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_a9add43490c45e4334099bb15b6e6eab0"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#a9add43490c45e4334099bb15b6e6eab0">operations_research::SparsePermutation::RemoveCycles</a></div><div class="ttdeci">void RemoveCycles(const std::vector&lt; int &gt; &amp;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="aclassoperations__research_1_1_sparse_permutation_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#a764be64f3029f8b8e23511061d8de355">operations_research::SparsePermutation::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8cc_source.html#l00052">sparse_permutation.cc:52</a></div></div>
2020-09-02 09:42:51 +02:00
<!-- 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="sparse__permutation_8cc.html">sparse_permutation.cc</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
2020-10-09 12:00:09 +02:00
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.20 </li>
2020-09-02 09:42:51 +02:00
</ul>
</div>
</body>
</html>