<ahref="minimum__spanning__tree_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="preprocessor">#ifndef OR_TOOLS_GRAPH_MINIMUM_SPANNING_TREE_H_</span></div><divclass="line"><aname="l00015"></a><spanclass="lineno"> 15</span> <spanclass="preprocessor">#define OR_TOOLS_GRAPH_MINIMUM_SPANNING_TREE_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 <queue></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/adjustable_priority_queue-inl.h"</span></div><divclass="line"><aname="l00021"></a><spanclass="lineno"> 21</span> <spanclass="preprocessor">#include "ortools/base/adjustable_priority_queue.h"</span></div><divclass="line"><aname="l00022"></a><spanclass="lineno"> 22</span> <spanclass="preprocessor">#include "ortools/base/integral_types.h"</span></div><divclass="line"><aname="l00023"></a><spanclass="lineno"> 23</span> <spanclass="preprocessor">#include "<aclass="code"href="connectivity_8h.html">ortools/graph/connectivity.h</a>"</span></div><divclass="line"><aname="l00024"></a><spanclass="lineno"> 24</span> <spanclass="preprocessor">#include "ortools/util/vector_or_function.h"</span></div><divclass="line"><aname="l00025"></a><spanclass="lineno"> 25</span> </div><divclass="line"><aname="l00026"></a><spanclass="lineno"> 26</span> <spanclass="keyword">namespace </span><aclass="code"href="namespaceoperations__research.html
<divclass="ttc"id="namespaceoperations__research_html_a00ab79ee21ffd8dece0996e37f9faa7a"><divclass="ttname"><ahref="namespaceoperations__research.html#a00ab79ee21ffd8dece0996e37f9faa7a">operations_research::BuildKruskalMinimumSpanningTreeFromSortedArcs</a></div><divclass="ttdeci">std::vector< typename Graph::ArcIndex > BuildKruskalMinimumSpanningTreeFromSortedArcs(const Graph &graph, const std::vector< typename Graph::ArcIndex >&sorted_arcs)</div><divclass="ttdoc">Implementation of Kruskal's mininumum spanning tree algorithm (c.f.</div><divclass="ttdef"><b>Definition:</b><ahref="minimum__spanning__tree_8h_source.html#l00050">minimum_spanning_tree.h:50</a></div></div>
<divclass="ttc"id="namespaceutil_html_ae76339cb2dcd3bc05ad762146f91fdda"><divclass="ttname"><ahref="namespaceutil.html#ae76339cb2dcd3bc05ad762146f91fdda">util::Graph</a></div><divclass="ttdeci">ListGraph Graph</div><divclass="ttdoc">Defining the simplest Graph interface as Graph for convenience.</div><divclass="ttdef"><b>Definition:</b><ahref="graph_8h_source.html#l02358">graph.h:2358</a></div></div>
<divclass="ttc"id="classoperations__research_1_1ConnectedComponents_html_a8de720dd960dc6e2e831bb27c3500466"><divclass="ttname"><ahref="classoperations__research_1_1ConnectedComponents.html#a8de720dd960dc6e2e831bb27c3500466">operations_research::ConnectedComponents::MergeClasses</a></div><divclass="ttdeci">void MergeClasses(NodeIndex node1, NodeIndex node2)</div><divclass="ttdoc">Merges the equivalence classes of node1 and node2.</div><divclass="ttdef"><b>Definition:</b><ahref="connectivity_8h_source.html#l00138">connectivity.h:138</a></div></div>
<divclass="ttc"id="classoperations__research_1_1ConnectedComponents_html_aa3cdc15d5fad9ed6672bd4e436d987dd"><divclass="ttname"><ahref="classoperations__research_1_1ConnectedComponents.html#aa3cdc15d5fad9ed6672bd4e436d987dd">operations_research::ConnectedComponents::GetClassRepresentative</a></div><divclass="ttdeci">NodeIndex GetClassRepresentative(NodeIndex node)</div><divclass="ttdoc">Returns the equivalence class representative for node.</div><divclass="ttdef"><b>Definition:</b><ahref="connectivity_8h_source.html#l00123">connectivity.h:123</a></div></div>
<divclass="ttc"id="classoperations__research_1_1ConnectedComponents_html"><divclass="ttname"><ahref="classoperations__research_1_1ConnectedComponents.html">operations_research::ConnectedComponents</a></div><divclass="ttdoc">Template class implementing a Union-Find algorithm with path compression for maintaining the connecte...</div><divclass="ttdef"><b>Definition:</b><ahref="connectivity_8h_source.html#l00067">connectivity.h:67</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="christofides_8h_source.html#l00033">christofides.h:33</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_a33a2f4c26fd60cd0fa98257b571c974f"><divclass="ttname"><ahref="namespaceoperations__research.html#a33a2f4c26fd60cd0fa98257b571c974f">operations_research::BuildPrimMinimumSpanningTree</a></div><divclass="ttdeci">std::vector< typename Graph::ArcIndex > BuildPrimMinimumSpanningTree(const Graph &graph, const ArcValue &arc_value)</div><divclass="ttdoc">Implementation of Prim's mininumum spanning tree algorithm (c.f.</div><divclass="ttdef"><b>Definition:</b><ahref="minimum__spanning__tree_8h_source.html#l00117">minimum_spanning_tree.h:117</a></div></div>
<divclass="ttc"id="classoperations__research_1_1ConnectedComponents_html_a2d8283743a52c2e331309c33c798b23c"><divclass="ttname"><ahref="classoperations__research_1_1ConnectedComponents.html#a2d8283743a52c2e331309c33c798b23c">operations_research::ConnectedComponents::Init</a></div><divclass="ttdeci">void Init(NodeIndex num_nodes)</div><divclass="ttdoc">Reserves memory for num_nodes and resets the data structures.</div><divclass="ttdef"><b>Definition:</b><ahref="connectivity_8h_source.html#l00072">connectivity.h:72</a></div></div>
<divclass="ttc"id="namespaceoperations__research_html_a0e629e35bfa311b31dd7f5065eb834bb"><divclass="ttname"><ahref="namespaceoperations__research.html#a0e629e35bfa311b31dd7f5065eb834bb">operations_research::NodeIndex</a></div><divclass="ttdeci">int32 NodeIndex</div><divclass="ttdoc">Standard instantiation of ForwardEbertGraph (named 'ForwardStarGraph') of EbertGraph (named 'StarGrap...</div><divclass="ttdef"><b>Definition:</b><ahref="ebert__graph_8h_source.html#l00192">ebert_graph.h:192</a></div></div>
