Files
ortools-clone/docs/cpp_algorithms/dynamic__partition_8h_source.html

137 lines
84 KiB
HTML
Raw Normal View History

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<title>OR-Tools</title>
<meta http-equiv="Content-Type" content="text/html;"/>
<meta charset="utf-8"/>
<!--<link rel='stylesheet' type='text/css' href="https://fonts.googleapis.com/css?family=Ubuntu:400,700,400italic"/>-->
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
2020-09-01 16:00:33 +02:00
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="banner-container">
<div id="banner">
2021-09-20 15:57:27 +02:00
<span id="sfml">Google OR-Tools 9.1</span>
</div>
</div>
2019-08-07 18:01:08 -07:00
<div id="content" style="width: 100%; overflow: hidden;">
<div style="margin-left: 15px; margin-top: 5px; float: left; color: #145A32;">
2019-08-12 09:16:03 -07:00
<h2>C++ Reference</h2>
2019-08-07 18:01:08 -07:00
<ul>
<li><a href="../cpp_algorithms/annotated.html">Algorithms</a></li>
2019-08-12 09:16:03 -07:00
<li><a href="../cpp_sat/annotated.html">CP-SAT</a></li>
2019-08-07 18:01:08 -07:00
<li><a href="../cpp_graph/annotated.html">Graph</a></li>
<li><a href="../cpp_routing/annotated.html">Routing</a></li>
<li><a href="../cpp_linear/annotated.html">Linear solver</a></li>
</ul>
</div>
<div id="content">
2019-08-07 18:01:08 -07:00
<div align="center">
<h1 style="color: #145A32;">C++ Reference: Algorithms</h1>
</div>
2021-09-20 15:57:27 +02:00
<!-- Generated by Doxygen 1.8.15 -->
2020-09-01 16:00:33 +02:00
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
2021-09-20 15:57:27 +02:00
var searchBox = new SearchBox("searchBox", "search",false,'Search');
2020-09-01 16:00:33 +02:00
/* @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>
2019-07-12 11:43:12 -07:00
</div>
2020-09-01 16:00:33 +02:00
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
2021-09-20 15:57:27 +02:00
$(document).ready(function(){initNavTree('dynamic__partition_8h_source.html','');});
2020-09-01 16:00:33 +02:00
/* @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">dynamic_partition.h</div> </div>
</div><!--header-->
<div class="contents">
2021-09-20 15:57:27 +02:00
<a href="dynamic__partition_8h.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-2021 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="comment">// TODO(user): refine this toplevel comment when this file settles.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;<span class="comment">// Two dynamic partition classes: one that incrementally splits a partition</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="comment">// into more and more parts; one that incrementally merges a partition into less</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="comment">// and less parts.</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="comment">// GLOSSARY:</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="comment">// The partition classes maintain a partition of N integers 0..N-1</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;<span class="comment">// (aka &quot;elements&quot;) into disjoint equivalence classes (aka &quot;parts&quot;).</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;<span class="comment">// SAFETY:</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160;<span class="comment">// Like vector&lt;int&gt; crashes when used improperly, these classes are not &quot;safe&quot;:</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160;<span c
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_a5d89f8571b04ded41d29edffdb479199a6f2cdeb376ad23fd9f0d1164c25a0306"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a5d89f8571b04ded41d29edffdb479199a6f2cdeb376ad23fd9f0d1164c25a0306">operations_research::DynamicPartition::SORT_BY_PART</a></div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00123">dynamic_partition.h:123</a></div></div>
<div class="ttc" id="structoperations__research_1_1_dynamic_partition_1_1_iterable_part_html_ab94e3d7f669e4c1b2c8e6d73e5cf154d"><div class="ttname"><a href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#ab94e3d7f669e4c1b2c8e6d73e5cf154d">operations_research::DynamicPartition::IterablePart::IterablePart</a></div><div class="ttdeci">IterablePart(const std::vector&lt; int &gt;::const_iterator &amp;b, const std::vector&lt; int &gt;::const_iterator &amp;e)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00193">dynamic_partition.h:193</a></div></div>
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_a4aae0995dc07af7b81fb97104921328d"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a4aae0995dc07af7b81fb97104921328d">operations_research::MergingPartition::MergingPartition</a></div><div class="ttdeci">MergingPartition()</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00207">dynamic_partition.h:207</a></div></div>
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_a32f3aa9643111b05108d1120e48c1e13"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a32f3aa9643111b05108d1120e48c1e13">operations_research::DynamicPartition::Refine</a></div><div class="ttdeci">void Refine(const std::vector&lt; int &gt; &amp;distinguished_subset)</div></div>
<div class="ttc" id="structoperations__research_1_1_dynamic_partition_1_1_iterable_part_html_a1183625e61d46f8e98a980720c684146"><div class="ttname"><a href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#a1183625e61d46f8e98a980720c684146">operations_research::DynamicPartition::IterablePart::value_type</a></div><div class="ttdeci">int value_type</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00198">dynamic_partition.h:198</a></div></div>
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_a5d89f8571b04ded41d29edffdb479199"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a5d89f8571b04ded41d29edffdb479199">operations_research::DynamicPartition::DebugStringSorting</a></div><div class="ttdeci">DebugStringSorting</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00118">dynamic_partition.h:118</a></div></div>
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_ae91b7d9b6c4f0675b9ad3f38e5761853"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#ae91b7d9b6c4f0675b9ad3f38e5761853">operations_research::DynamicPartition::NumParts</a></div><div class="ttdeci">const int NumParts() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00062">dynamic_partition.h:62</a></div></div>
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_a53166e5f309a55b2753a60b958406340"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a53166e5f309a55b2753a60b958406340">operations_research::DynamicPartition::ElementsInHierarchicalOrder</a></div><div class="ttdeci">const std::vector&lt; int &gt; &amp; ElementsInHierarchicalOrder() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00137">dynamic_partition.h:137</a></div></div>
<div class="ttc" id="structoperations__research_1_1_dynamic_partition_1_1_iterable_part_html_ac32d6a4490f60f95983b0844091fcbac"><div class="ttname"><a href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#ac32d6a4490f60f95983b0844091fcbac">operations_research::DynamicPartition::IterablePart::IterablePart</a></div><div class="ttdeci">IterablePart()</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00192">dynamic_partition.h:192</a></div></div>
<div class="ttc" id="structoperations__research_1_1_dynamic_partition_1_1_iterable_part_html_af9593d4a5ff4274efaf429cb4f9e57cc"><div class="ttname"><a href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#af9593d4a5ff4274efaf429cb4f9e57cc">operations_research::DynamicPartition::IterablePart::size</a></div><div class="ttdeci">int size() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00190">dynamic_partition.h:190</a></div></div>
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_ac64dbed5d9196b941f3f53862f77309d"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#ac64dbed5d9196b941f3f53862f77309d">operations_research::MergingPartition::GetRootAndCompressPath</a></div><div class="ttdeci">int GetRootAndCompressPath(int node)</div></div>
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_a50eca19efa71a0b70de25f9ad4a2a6f8"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a50eca19efa71a0b70de25f9ad4a2a6f8">operations_research::MergingPartition::Reset</a></div><div class="ttdeci">void Reset(int num_nodes)</div></div>
<div class="ttc" id="structoperations__research_1_1_dynamic_partition_1_1_iterable_part_html"><div class="ttname"><a href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html">operations_research::DynamicPartition::IterablePart</a></div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00184">dynamic_partition.h:184</a></div></div>
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_af7b62ca470d8de1c1dde577b04671fa7"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#af7b62ca470d8de1c1dde577b04671fa7">operations_research::MergingPartition::NumNodes</a></div><div class="ttdeci">int NumNodes() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00211">dynamic_partition.h:211</a></div></div>
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_ab22d95d31ef6edfd5a6770ff6d8c4f04"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#ab22d95d31ef6edfd5a6770ff6d8c4f04">operations_research::DynamicPartition::PartOf</a></div><div class="ttdeci">int PartOf(int element) const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00285">dynamic_partition.h:285</a></div></div>
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_ae3df79e84e453454062c2c3789b7828e"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#ae3df79e84e453454062c2c3789b7828e">operations_research::MergingPartition::GetRoot</a></div><div class="ttdeci">int GetRoot(int node) const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00315">dynamic_partition.h:315</a></div></div>
<div class="ttc" id="structoperations__research_1_1_dynamic_partition_1_1_iterable_part_html_a8497b34029ee966694083aa34c9022b5"><div class="ttname"><a href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#a8497b34029ee966694083aa34c9022b5">operations_research::DynamicPartition::IterablePart::begin</a></div><div class="ttdeci">std::vector&lt; int &gt;::const_iterator begin() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00185">dynamic_partition.h:185</a></div></div>
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_a5d89f8571b04ded41d29edffdb479199aa3c9e40c9ce46fe6b0a9352db7240b6f"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a5d89f8571b04ded41d29edffdb479199aa3c9e40c9ce46fe6b0a9352db7240b6f">operations_research::DynamicPartition::SORT_LEXICOGRAPHICALLY</a></div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00121">dynamic_partition.h:121</a></div></div>
<div class="ttc" id="structoperations__research_1_1_dynamic_partition_1_1_iterable_part_html_a152bd708ae8b28ef466f2a3fc7540ae9"><div class="ttname"><a href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#a152bd708ae8b28ef466f2a3fc7540ae9">operations_research::DynamicPartition::IterablePart::end</a></div><div class="ttdeci">std::vector&lt; int &gt;::const_iterator end() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00186">dynamic_partition.h:186</a></div></div>
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_a11ea4d0620bbdca30b7d9b8a23f8cdd8"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a11ea4d0620bbdca30b7d9b8a23f8cdd8">operations_research::DynamicPartition::ElementsInPart</a></div><div class="ttdeci">IterablePart ElementsInPart(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00277">dynamic_partition.h:277</a></div></div>
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_a4368033ed0d5b2fc75727265e0c8f2d7"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a4368033ed0d5b2fc75727265e0c8f2d7">operations_research::MergingPartition::ResetNode</a></div><div class="ttdeci">void ResetNode(int node)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00340">dynamic_partition.h:340</a></div></div>
<div class="ttc" id="structoperations__research_1_1_dynamic_partition_1_1_iterable_part_html_a5da1f91bd5693e0c84132f6eec873cc1"><div class="ttname"><a href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#a5da1f91bd5693e0c84132f6eec873cc1">operations_research::DynamicPartition::IterablePart::begin_</a></div><div class="ttdeci">std::vector&lt; int &gt;::const_iterator begin_</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00187">dynamic_partition.h:187</a></div></div>
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_a5634a596b0aa63843c28e8ed69e653ca"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a5634a596b0aa63843c28e8ed69e653ca">operations_research::DynamicPartition::SizeOfPart</a></div><div class="ttdeci">int SizeOfPart(int part) const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00291">dynamic_partition.h:291</a></div></div>
<div class="ttc" id="classoperations__research_1_1_merging_partition_html"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html">operations_research::MergingPartition</a></div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00204">dynamic_partition.h:204</a></div></div>
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_a6097c48821f010becb9a6910f4c39288"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a6097c48821f010becb9a6910f4c39288">operations_research::MergingPartition::DebugString</a></div><div class="ttdeci">std::string DebugString()</div></div>
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_a59a35941a5a6eb3747faddb449a49e2a"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a59a35941a5a6eb3747faddb449a49e2a">operations_research::DynamicPartition::UndoRefineUntilNumPartsEqual</a></div><div class="ttdeci">void UndoRefineUntilNumPartsEqual(int original_num_parts)</div></div>
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_a897ee69dceefdd60a6a4e90ab8b18a25"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a897ee69dceefdd60a6a4e90ab8b18a25">operations_research::DynamicPartition::ElementsInSamePartAs</a></div><div class="ttdeci">IterablePart ElementsInSamePartAs(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00304">dynamic_partition.h:304</a></div></div>
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_ac86affffe0db21281ab1db3b23bbebc8"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#ac86affffe0db21281ab1db3b23bbebc8">operations_research::DynamicPartition::DynamicPartition</a></div><div class="ttdeci">DynamicPartition(int num_elements)</div></div>
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_ad07c56b1579801daaf3a9a750d26e792"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#ad07c56b1579801daaf3a9a750d26e792">operations_research::DynamicPartition::DebugString</a></div><div class="ttdeci">std::string DebugString(DebugStringSorting sorting) const</div></div>
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html">operations_research::DynamicPartition</a></div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00050">dynamic_partition.h:50</a></div></div>
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_a9b5c93a4cf6d2e548d76291fe7ba5b5d"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a9b5c93a4cf6d2e548d76291fe7ba5b5d">operations_research::DynamicPartition::FprintOfPart</a></div><div class="ttdeci">uint64_t FprintOfPart(int part) const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00309">dynamic_partition.h:309</a></div></div>
<div class="ttc" id="structoperations__research_1_1_dynamic_partition_1_1_iterable_part_html_a5a85aaf56880f04a078dc182410090df"><div class="ttname"><a href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#a5a85aaf56880f04a078dc182410090df">operations_research::DynamicPartition::IterablePart::const_iterator</a></div><div class="ttdeci">std::vector&lt; int &gt;::const_iterator const_iterator</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00199">dynamic_partition.h:199</a></div></div>
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_a62cb833403d7861c5badb4de3389e06e"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a62cb833403d7861c5badb4de3389e06e">operations_research::MergingPartition::FillEquivalenceClasses</a></div><div class="ttdeci">int FillEquivalenceClasses(std::vector&lt; int &gt; *node_equivalence_classes)</div></div>
<div class="ttc" id="structoperations__research_1_1_dynamic_partition_1_1_iterable_part_html_ac6a060188c6c10f9609b85fd6bc9f15d"><div class="ttname"><a href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#ac6a060188c6c10f9609b85fd6bc9f15d">operations_research::DynamicPartition::IterablePart::end_</a></div><div class="ttdeci">std::vector&lt; int &gt;::const_iterator end_</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00188">dynamic_partition.h:188</a></div></div>
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></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="classoperations__research_1_1_merging_partition_html_ac74287c1a8a25271ceeac05c740f6a12"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#ac74287c1a8a25271ceeac05c740f6a12">operations_research::MergingPartition::MergingPartition</a></div><div class="ttdeci">MergingPartition(int num_nodes)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00208">dynamic_partition.h:208</a></div></div>
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_a3d5f7b1e62f42b574085e671ae6dfb73"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a3d5f7b1e62f42b574085e671ae6dfb73">operations_research::MergingPartition::NumNodesInSamePartAs</a></div><div class="ttdeci">int NumNodesInSamePartAs(int node)</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00252">dynamic_partition.h:252</a></div></div>
<div class="ttc" id="classoperations__research_1_1_dynamic_partition_html_a84daba977c20d7a54c86ef77e8986267"><div class="ttname"><a href="classoperations__research_1_1_dynamic_partition.html#a84daba977c20d7a54c86ef77e8986267">operations_research::DynamicPartition::NumElements</a></div><div class="ttdeci">int NumElements() const</div><div class="ttdef"><b>Definition:</b> <a href="dynamic__partition_8h_source.html#l00061">dynamic_partition.h:61</a></div></div>
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_a80761f181b521aa284b7e687776b9fde"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a80761f181b521aa284b7e687776b9fde">operations_research::MergingPartition::KeepOnlyOneNodePerPart</a></div><div class="ttdeci">void KeepOnlyOneNodePerPart(std::vector&lt; int &gt; *nodes)</div></div>
<div class="ttc" id="classoperations__research_1_1_merging_partition_html_a612bd8d97219124a8d6fbac721bcdbc6"><div class="ttname"><a href="classoperations__research_1_1_merging_partition.html#a612bd8d97219124a8d6fbac721bcdbc6">operations_research::MergingPartition::MergePartsOf</a></div><div class="ttdeci">int MergePartsOf(int node1, int node2)</div></div>
2021-01-26 11:28:50 +01:00
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
2019-08-07 18:01:08 -07:00
</div>
</div>
<div id="footer-container">
<div id="footer">
</div>
</div>
</body>
</html>