<ahref="dynamic__partition_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-2018 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="comment">// TODO(user,user): refine this toplevel comment when this file settles.</span></div><divclass="line"><aname="l00015"></a><spanclass="lineno"> 15</span> <spanclass="comment">//</span></div><divclass="line"><aname="l00016"></a><spanclass="lineno"> 16</span> <spanclass="comment">// Two dynamic partition classes: one that incrementally splits a partition</span></div><divclass="line"><aname="l00017"></a><spanclass="lineno"> 17</span> <spanclass="comment">// into more and more parts; one that incrementally merges a partition into less</span></div><divclass="line"><aname="l00018"></a><spanclass="lineno"> 18</span> <spanclass="comment">// and less parts.</span></div><divclass="line"><aname="l00019"></a><spanclass="lineno"> 19</span> <spanclass="comment">//</span></div><divclass="line"><aname="l00020"></a><spanclass="lineno"> 20</span> <spanclass="comment">// GLOSSARY:</span></div><divclass="line"><aname="l00021"></a><spanclass="lineno"> 21</span> <spanclass="comment">// The partition classes maintain a partition of N integers 0..N-1</span></div><divclass="line"><aname="l00022"></a><spanclass="lineno"> 22</span> <spanclass="comment">// (aka "elements") into disjoint equivalence classes (aka "parts").</span></div><divclass="line"><aname="l00023"></a><spanclass="lineno"> 23</span> <spanclass="comment">//</span></div><divclass="line"><aname="l00024"></a><spanclass="lineno"> 24</span> <spanclass="comment">// SAFETY:</span></div><divclass="line"><aname="l00025"></a><spanclass="lineno"> 25</span> <spanclass="comment">// Like std::vector<int> crashes when used improperly, these classes are not</span></div><divclass="line"><aname="l00026"></a><spanclass="lineno"> 26</span> <spanclass="co
<divclass="ttc"id="classoperations__research_1_1MergingPartition_html_a62fb42554b2c7db5121b5b4230188d9d"><divclass="ttname"><ahref="classoperations__research_1_1MergingPartition.html#a62fb42554b2c7db5121b5b4230188d9d">operations_research::MergingPartition::DebugString</a></div><divclass="ttdeci">std::string DebugString()</div><divclass="ttdoc">Dump all components, with nodes sorted within each part and parts sorted lexicographically.</div></div>
<divclass="ttc"id="structoperations__research_1_1DynamicPartition_1_1IterablePart_html_ac1869cef1d61b3cf54d2336f9e1768b0"><divclass="ttname"><ahref="structoperations__research_1_1DynamicPartition_1_1IterablePart.html#ac1869cef1d61b3cf54d2336f9e1768b0">operations_research::DynamicPartition::IterablePart::begin_</a></div><divclass="ttdeci">std::vector< int >::const_iterator begin_</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00186">dynamic_partition.h:186</a></div></div>
<divclass="ttc"id="classoperations__research_1_1MergingPartition_html"><divclass="ttname"><ahref="classoperations__research_1_1MergingPartition.html">operations_research::MergingPartition</a></div><divclass="ttdoc">Partition class that supports incremental merging, using the union-find algorithm (see http://en....</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00203">dynamic_partition.h:203</a></div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPartition_html_afe6f90b99c0b1d646b00ad2d1bb0a09d"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPartition.html#afe6f90b99c0b1d646b00ad2d1bb0a09d">operations_research::DynamicPartition::DynamicPartition</a></div><divclass="ttdeci">DynamicPartition(int num_elements)</div><divclass="ttdoc">Creates a DynamicPartition on n elements, numbered 0..n-1.</div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPartition_html_a67b2a5be57842485dcb3c3db93bc2e1a"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPartition.html#a67b2a5be57842485dcb3c3db93bc2e1a">operations_research::DynamicPartition::DebugStringSorting</a></div><divclass="ttdeci">DebugStringSorting</div><divclass="ttdoc">Dump the partition to a std::string.</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00117">dynamic_partition.h:117</a></div></div>
<divclass="ttc"id="classoperations__research_1_1MergingPartition_html_a955ac764e9c8dcd4358202de4ecd47fd"><divclass="ttname"><ahref="classoperations__research_1_1MergingPartition.html#a955ac764e9c8dcd4358202de4ecd47fd">operations_research::MergingPartition::ResetNode</a></div><divclass="ttdeci">void ResetNode(int node)</div><divclass="ttdoc">Advanced usage: sets 'node' to be in its original singleton.</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00339">dynamic_partition.h:339</a></div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPartition_html_a67b2a5be57842485dcb3c3db93bc2e1aacb9b001cac613035de5d6f1f38f7fda1"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPartition.html#a67b2a5be57842485dcb3c3db93bc2e1aacb9b001cac613035de5d6f1f38f7fda1">operations_research::DynamicPartition::SORT_LEXICOGRAPHICALLY</a></div><divclass="ttdoc">Elements are sorted within parts, and parts are then sorted lexicographically.</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00120">dynamic_partition.h:120</a></div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPartition_html_a0f4d81d407e148e26480f5ef01778270"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPartition.html#a0f4d81d407e148e26480f5ef01778270">operations_research::DynamicPartition::NumParts</a></div><divclass="ttdeci">const int NumParts() const</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00061">dynamic_partition.h:61</a></div></div>
<divclass="ttc"id="structoperations__research_1_1DynamicPartition_1_1IterablePart_html_ae0d65370bdf691912b56f25f52a4561e"><divclass="ttname"><ahref="structoperations__research_1_1DynamicPartition_1_1IterablePart.html#ae0d65370bdf691912b56f25f52a4561e">operations_research::DynamicPartition::IterablePart::value_type</a></div><divclass="ttdeci">int value_type</div><divclass="ttdoc">These typedefs allow this iterator to be used within testing::ElementsAre.</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00197">dynamic_partition.h:197</a></div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPartition_html"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPartition.html">operations_research::DynamicPartition</a></div><divclass="ttdoc">Partition class that supports incremental splitting, with backtracking.</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00049">dynamic_partition.h:49</a></div></div>
<divclass="ttc"id="structoperations__research_1_1DynamicPartition_1_1IterablePart_html_abd3e25c24209be1e6cffda93230bbdd9"><divclass="ttname"><ahref="structoperations__research_1_1DynamicPartition_1_1IterablePart.html#abd3e25c24209be1e6cffda93230bbdd9">operations_research::DynamicPartition::IterablePart::end</a></div><divclass="ttdeci">std::vector< int >::const_iterator end() const</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00185">dynamic_partition.h:185</a></div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPartition_html_ac1dcc361f73f495e0f362f834b224e89"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPartition.html#ac1dcc361f73f495e0f362f834b224e89">operations_research::DynamicPartition::ElementsInPart</a></div><divclass="ttdeci">IterablePart ElementsInPart(int i) const</div><divclass="ttdoc">*** Implementation of inline methods of the above classes. ***</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00276">dynamic_partition.h:276</a></div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPartition_html_ab516c7e5e0e64a4fca27ab1790d459e5"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPartition.html#ab516c7e5e0e64a4fca27ab1790d459e5">operations_research::DynamicPartition::ElementsInHierarchicalOrder</a></div><divclass="ttdeci">const std::vector< int >& ElementsInHierarchicalOrder() const</div><divclass="ttdoc">ADVANCED USAGE: All elements (0..n-1) of the partition, sorted in a way that's compatible with the hi...</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00136">dynamic_partition.h:136</a></div></div>
<divclass="ttc"id="classoperations__research_1_1MergingPartition_html_a09305f65b966f5d00cdb7c5e3fcec43a"><divclass="ttname"><ahref="classoperations__research_1_1MergingPartition.html#a09305f65b966f5d00cdb7c5e3fcec43a">operations_research::MergingPartition::KeepOnlyOneNodePerPart</a></div><divclass="ttdeci">void KeepOnlyOneNodePerPart(std::vector< int > *nodes)</div><divclass="ttdoc">Specialized reader API: prunes "nodes" to only keep at most one node per part: any node which is in t...</div></div>
<divclass="ttc"id="classoperations__research_1_1MergingPartition_html_ab5aff2ca8ee76377b90e75f369a06965"><divclass="ttname"><ahref="classoperations__research_1_1MergingPartition.html#ab5aff2ca8ee76377b90e75f369a06965">operations_research::MergingPartition::GetRootAndCompressPath</a></div><divclass="ttdeci">int GetRootAndCompressPath(int node)</div><divclass="ttdoc">Get the representative of "node" (a node in the same equivalence class, which will also be returned f...</div></div>
<divclass="ttc"id="structoperations__research_1_1DynamicPartition_1_1IterablePart_html_a449c15b1c8a64ef6572463e2f21ae174"><divclass="ttname"><ahref="structoperations__research_1_1DynamicPartition_1_1IterablePart.html#a449c15b1c8a64ef6572463e2f21ae174">operations_research::DynamicPartition::IterablePart::const_iterator</a></div><divclass="ttdeci">std::vector< int >::const_iterator const_iterator</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00198">dynamic_partition.h:198</a></div></div>
<divclass="ttc"id="structoperations__research_1_1DynamicPartition_1_1IterablePart_html_ab1abe2eb3716aa80bd29b1e7260484a2"><divclass="ttname"><ahref="structoperations__research_1_1DynamicPartition_1_1IterablePart.html#ab1abe2eb3716aa80bd29b1e7260484a2">operations_research::DynamicPartition::IterablePart::begin</a></div><divclass="ttdeci">std::vector< int >::const_iterator begin() const</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00184">dynamic_partition.h:184</a></div></div>
<divclass="ttc"id="classoperations__research_1_1MergingPartition_html_a561892525aa4b6891d5f7636f62cd749"><divclass="ttname"><ahref="classoperations__research_1_1MergingPartition.html#a561892525aa4b6891d5f7636f62cd749">operations_research::MergingPartition::MergingPartition</a></div><divclass="ttdeci">MergingPartition()</div><divclass="ttdoc">At first, all nodes are in their own singleton part.</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00206">dynamic_partition.h:206</a></div></div>
<divclass="ttc"id="structoperations__research_1_1DynamicPartition_1_1IterablePart_html_ae05724f38a9dbde27efff486cfde1e81"><divclass="ttname"><ahref="structoperations__research_1_1DynamicPartition_1_1IterablePart.html#ae05724f38a9dbde27efff486cfde1e81">operations_research::DynamicPartition::IterablePart::IterablePart</a></div><divclass="ttdeci">IterablePart(const std::vector< int >::const_iterator &b, const std::vector< int >::const_iterator &e)</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00192">dynamic_partition.h:192</a></div></div>
<divclass="ttc"id="structoperations__research_1_1DynamicPartition_1_1IterablePart_html_a811d152ac3bcfa8132b5dc1e5c0e5818"><divclass="ttname"><ahref="structoperations__research_1_1DynamicPartition_1_1IterablePart.html#a811d152ac3bcfa8132b5dc1e5c0e5818">operations_research::DynamicPartition::IterablePart::end_</a></div><divclass="ttdeci">std::vector< int >::const_iterator end_</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00187">dynamic_partition.h:187</a></div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPartition_html_a67b2a5be57842485dcb3c3db93bc2e1aa5edad0b79a2c83ec1b1560960504c161"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPartition.html#a67b2a5be57842485dcb3c3db93bc2e1aa5edad0b79a2c83ec1b1560960504c161">operations_research::DynamicPartition::SORT_BY_PART</a></div><divclass="ttdoc">Elements are sorted within parts, and parts are kept in order.</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00122">dynamic_partition.h:122</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html"><divclass="ttname"><ahref="namespaceoperations__research.html">operations_research</a></div><divclass="ttdoc">Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in c...</div><divclass="ttdef"><b>Definition:</b><ahref="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
<divclass="ttc"id="classoperations__research_1_1MergingPartition_html_a57d8288fbe286978c65abf82bd051000"><divclass="ttname"><ahref="classoperations__research_1_1MergingPartition.html#a57d8288fbe286978c65abf82bd051000">operations_research::MergingPartition::GetRoot</a></div><divclass="ttdeci">int GetRoot(int node) const</div><divclass="ttdoc">FOR DEBUGGING OR SPECIAL "CONST" ACCESS ONLY: Find the root of the union-find tree with leaf 'node',...</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00314">dynamic_partition.h:314</a></div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPartition_html_a968140cdf9d2766625e1d476a7a71590"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPartition.html#a968140cdf9d2766625e1d476a7a71590">operations_research::DynamicPartition::UndoRefineUntilNumPartsEqual</a></div><divclass="ttdeci">void UndoRefineUntilNumPartsEqual(int original_num_parts)</div><divclass="ttdoc">Undo one or several Refine() operations, until the number of parts becomes equal to "original_num_par...</div></div>
<divclass="ttc"id="classoperations__research_1_1MergingPartition_html_a450228c4fe64624a5c075a462ff91290"><divclass="ttname"><ahref="classoperations__research_1_1MergingPartition.html#a450228c4fe64624a5c075a462ff91290">operations_research::MergingPartition::FillEquivalenceClasses</a></div><divclass="ttdeci">int FillEquivalenceClasses(std::vector< int > *node_equivalence_classes)</div><divclass="ttdoc">Output the whole partition as node equivalence classes: if there are K parts and N nodes,...</div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPartition_html_a16fce09dd4c359a6acfd0a864e0a5ebd"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPartition.html#a16fce09dd4c359a6acfd0a864e0a5ebd">operations_research::DynamicPartition::Refine</a></div><divclass="ttdeci">void Refine(const std::vector< int >&distinguished_subset)</div><divclass="ttdoc">Refines the partition such that elements that are in distinguished_subset never share the same part a...</div></div>
<divclass="ttc"id="classoperations__research_1_1DynamicPartition_html_a4e68b8de69272cf549b346595d332198"><divclass="ttname"><ahref="classoperations__research_1_1DynamicPartition.html#a4e68b8de69272cf549b346595d332198">operations_research::DynamicPartition::FprintOfPart</a></div><divclass="ttdeci">uint64 FprintOfPart(int part) const</div><divclass="ttdoc">Returns a fingerprint of the given part.</div><divclass="ttdef"><b>Definition:</b><ahref="dynamic__partition_8h_source.html#l00308">dynamic_partition.h:308</a></div></div>
<divclass="ttc"id="classoperations__research_1_1MergingPartition_html_a189669a00c0a94f224db9005c8925310"><divclass="ttname"><ahref="classoperations__research_1_1MergingPartition.html#a189669a00c0a94f224db9005c8925310">operations_research::MergingPartition::MergePartsOf</a></div><divclass="ttdeci">int MergePartsOf(int node1, int node2)</div><divclass="ttdoc">Complexity: amortized O(Ackermann⁻¹(N)) – which is essentially O(1) – where N is the number of nodes.</div></div>
