<ahref="sparse__permutation_8h.html">Go to the documentation of this file.</a><divclass="fragment"><divclass="line"><aname="l00001"></a><spanclass="lineno"> 1</span> <spanclass="comment">// Copyright 2010-2021 Google LLC</span></div><divclass="line"><aname="l00002"></a><spanclass="lineno"> 2</span> <spanclass="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><divclass="line"><aname="l00003"></a><spanclass="lineno"> 3</span> <spanclass="comment">// you may not use this file except in compliance with the License.</span></div><divclass="line"><aname="l00004"></a><spanclass="lineno"> 4</span> <spanclass="comment">// You may obtain a copy of the License at</span></div><divclass="line"><aname="l00005"></a><spanclass="lineno"> 5</span> <spanclass="comment">//</span></div><divclass="line"><aname="l00006"></a><spanclass="lineno"> 6</span> <spanclass="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><divclass="line"><aname="l00007"></a><spanclass="lineno"> 7</span> <spanclass="comment">//</span></div><divclass="line"><aname="l00008"></a><spanclass="lineno"> 8</span> <spanclass="comment">// Unless required by applicable law or agreed to in writing, software</span></div><divclass="line"><aname="l00009"></a><spanclass="lineno"> 9</span> <spanclass="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><divclass="line"><aname="l00010"></a><spanclass="lineno"> 10</span> <spanclass="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><divclass="line"><aname="l00011"></a><spanclass="lineno"> 11</span> <spanclass="comment">// See the License for the specific language governing permissions and</span></div><divclass="line"><aname="l00012"></a><spanclass="lineno"> 12</span> <spanclass="comment">// limitations under the License.</span></div><divclass="line"><aname="l00013"></a><spanclass="lineno"> 13</span> </div><divclass="line"><aname="l00014"></a><spanclass="lineno"> 14</span> <spanclass="preprocessor">#ifndef OR_TOOLS_ALGORITHMS_SPARSE_PERMUTATION_H_</span></div><divclass="line"><aname="l00015"></a><spanclass="lineno"> 15</span> <spanclass="preprocessor">#define OR_TOOLS_ALGORITHMS_SPARSE_PERMUTATION_H_</span></div><divclass="line"><aname="l00016"></a><spanclass="lineno"> 16</span> </div><divclass="line"><aname="l00017"></a><spanclass="lineno"> 17</span> <spanclass="preprocessor">#include <string></span></div><divclass="line"><aname="l00018"></a><spanclass="lineno"> 18</span> <spanclass="preprocessor">#include <vector></span></div><divclass="line"><aname="l00019"></a><spanclass="lineno"> 19</span> </div><divclass="line"><aname="l00020"></a><spanclass="lineno"> 20</span> <spanclass="preprocessor">#include "ortools/base/logging.h"</span></div><divclass="line"><aname="l00021"></a><spanclass="lineno"> 21</span> </div><divclass="line"><aname="l00022"></a><spanclass="lineno"> 22</span> <spanclass="keyword">namespace </span><aclass="code"href="namespaceoperations__research.html">operations_research</a> {</div><divclass="line"><aname="l00023"></a><spanclass="lineno"> 23</span> </div><divclass="line"><aname="l00024"></a><spanclass="lineno"> 24</span> <spanclass="comment">// A compact representation for permutations of {0..N-1} that displaces few</span></div><divclass="line"><aname="l00025"></a><spanclass="lineno"> 25</span> <spanclass="comment">// elements: it needs only O(K) memory for a permutation that displaces</span></div><divclass="line"><aname="l00026"></a><spanclass="lineno"> 26</span> <spanclass="comment">// K elements.</span></div><divclass="line"><aname="l00027"></a><spanclass="lineno"><aclass="line"href="classoperations__research_1_1_sparse_permutation.html">
<divclass="ttc"id="structoperations__research_1_1_sparse_permutation_1_1_iterator_html_a45e7d9be5295e365dc2f6e1f46f969e1"><divclass="ttname"><ahref="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a45e7d9be5295e365dc2f6e1f46f969e1">operations_research::SparsePermutation::Iterator::Iterator</a></div><divclass="ttdeci">Iterator(const std::vector< int >::const_iterator &b, const std::vector< int >::const_iterator &e)</div><divclass="ttdef"><b>Definition:</b><ahref="sparse__permutation_8h_source.html#l00105">sparse_permutation.h:105</a></div></div>
<divclass="ttc"id="classoperations__research_1_1_sparse_permutation_html_a9add43490c45e4334099bb15b6e6eab0"><divclass="ttname"><ahref="classoperations__research_1_1_sparse_permutation.html#a9add43490c45e4334099bb15b6e6eab0">operations_research::SparsePermutation::RemoveCycles</a></div><divclass="ttdeci">void RemoveCycles(const std::vector< int >&cycle_indices)</div></div>
<divclass="ttc"id="structoperations__research_1_1_sparse_permutation_1_1_iterator_html_a8497b34029ee966694083aa34c9022b5"><divclass="ttname"><ahref="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a8497b34029ee966694083aa34c9022b5">operations_research::SparsePermutation::Iterator::begin</a></div><divclass="ttdeci">std::vector< int >::const_iterator begin() const</div><divclass="ttdef"><b>Definition:</b><ahref="sparse__permutation_8h_source.html#l00109">sparse_permutation.h:109</a></div></div>
<divclass="ttc"id="structoperations__research_1_1_sparse_permutation_1_1_iterator_html_a152bd708ae8b28ef466f2a3fc7540ae9"><divclass="ttname"><ahref="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a152bd708ae8b28ef466f2a3fc7540ae9">operations_research::SparsePermutation::Iterator::end</a></div><divclass="ttdeci">std::vector< int >::const_iterator end() const</div><divclass="ttdef"><b>Definition:</b><ahref="sparse__permutation_8h_source.html#l00110">sparse_permutation.h:110</a></div></div>
<divclass="ttc"id="structoperations__research_1_1_sparse_permutation_1_1_iterator_html_a90184cfdf1a6d1e0e22c93105954a44e"><divclass="ttname"><ahref="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a90184cfdf1a6d1e0e22c93105954a44e">operations_research::SparsePermutation::Iterator::begin_</a></div><divclass="ttdeci">const std::vector< int >::const_iterator begin_</div><divclass="ttdef"><b>Definition:</b><ahref="sparse__permutation_8h_source.html#l00111">sparse_permutation.h:111</a></div></div>
<divclass="ttc"id="structoperations__research_1_1_sparse_permutation_1_1_iterator_html_a57fece117afab3e8dd6d54a015c783f6"><divclass="ttname"><ahref="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a57fece117afab3e8dd6d54a015c783f6">operations_research::SparsePermutation::Iterator::end_</a></div><divclass="ttdeci">const std::vector< int >::const_iterator end_</div><divclass="ttdef"><b>Definition:</b><ahref="sparse__permutation_8h_source.html#l00112">sparse_permutation.h:112</a></div></div>
<divclass="ttc"id="structoperations__research_1_1_sparse_permutation_1_1_iterator_html_a5a85aaf56880f04a078dc182410090df"><divclass="ttname"><ahref="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a5a85aaf56880f04a078dc182410090df">operations_research::SparsePermutation::Iterator::const_iterator</a></div><divclass="ttdeci">std::vector< int >::const_iterator const_iterator</div><divclass="ttdef"><b>Definition:</b><ahref="sparse__permutation_8h_source.html#l00102">sparse_permutation.h:102</a></div></div>
