always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
e1b32efb5af2fc6b486ca98528ef3f985f3e4b44
ortools-clone/docs/cpp_graph/minimum__spanning__tree_8h_source.html

72 lines
37 KiB
HTML
Raw Normal View History

add more C++ doc
2019-06-13 15:36:14 +02:00
<!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"/>-->
update doc; use nice css
2019-06-20 23:08:48 +02:00
<link rel="stylesheet" type="text/css" href="ortools.css" title="default" media="screen,print" />
add more C++ doc
2019-06-13 15:36:14 +02:00
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
</head>
<body>
<div id="banner-container">
<div id="banner">
update doc
2019-08-12 09:16:03 -07:00
<span id="sfml">Google OR-Tools 7.3</span>
add more C++ doc
2019-06-13 15:36:14 +02:00
</div>
</div>
revamp refman generation
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;">
update doc
2019-08-12 09:16:03 -07:00
<h2>C++ Reference</h2>
revamp refman generation
2019-08-07 18:01:08 -07:00
<ul>
<li><a href="../cpp_algorithms/annotated.html">Algorithms</a></li>
update doc
2019-08-12 09:16:03 -07:00
<li><a href="../cpp_sat/annotated.html">CP-SAT</a></li>
revamp refman generation
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>
add more C++ doc
2019-06-13 15:36:14 +02:00
<div id="content">
revamp refman generation
2019-08-07 18:01:08 -07:00
<div align="center">
<h1 style="color: #145A32;">C++ Reference: Graph</h1>
</div>
add more C++ doc
2019-06-13 15:36:14 +02:00
<!-- Generated by Doxygen 1.8.15 -->
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
more linear doc
2019-07-15 17:42:24 -07:00
<li class="current"><a href="files.html"><span>Files</span></a></li>
add more C++ doc
2019-06-13 15:36:14 +02:00
</ul>
</div>
revamp refman generation
2019-08-07 18:01:08 -07:00
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_725f3a5915051842f84e3ea508be2a62.html">graph</a></li> </ul>
polish cpp doc
2019-07-12 13:25:23 -07:00
</div>
revamp refman generation
2019-08-07 18:01:08 -07:00
</div><!-- top -->
add more C++ doc
2019-06-13 15:36:14 +02:00
<div class="header">
<div class="headertitle">
<div class="title">minimum_spanning_tree.h</div> </div>
</div><!--header-->
<div class="contents">
revamp refman generation
2019-08-07 18:01:08 -07:00
<a href="minimum__spanning__tree_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-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">#ifndef OR_TOOLS_GRAPH_MINIMUM_SPANNING_TREE_H_</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="preprocessor">#define OR_TOOLS_GRAPH_MINIMUM_SPANNING_TREE_H_</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;</div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="preprocessor">#include &lt;queue&gt;</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="preprocessor">#include &lt;vector&gt;</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;</div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="preprocessor">#include &quot;ortools/base/adjustable_priority_queue-inl.h&quot;</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="preprocessor">#include &quot;ortools/base/adjustable_priority_queue.h&quot;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;<span class="preprocessor">#include &quot;ortools/base/integral_types.h&quot;</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="connectivity_8h.html">ortools/graph/connectivity.h</a>&quot;</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;<span class="preprocessor">#include &quot;ortools/util/vector_or_function.h&quot;</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160;</div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html
<div class="ttc" id="namespaceoperations__research_html_a00ab79ee21ffd8dece0996e37f9faa7a"><div class="ttname"><a href="namespaceoperations__research.html#a00ab79ee21ffd8dece0996e37f9faa7a">operations_research::BuildKruskalMinimumSpanningTreeFromSortedArcs</a></div><div class="ttdeci">std::vector&lt; typename Graph::ArcIndex &gt; BuildKruskalMinimumSpanningTreeFromSortedArcs(const Graph &amp;graph, const std::vector&lt; typename Graph::ArcIndex &gt; &amp;sorted_arcs)</div><div class="ttdef"><b>Definition:</b> <a href="minimum__spanning__tree_8h_source.html#l00050">minimum_spanning_tree.h:50</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_ad90a9fc7d16bb2c98a088a4162bbbc9d"><div class="ttname"><a href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">operations_research::ArcIndex</a></div><div class="ttdeci">int32 ArcIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00201">ebert_graph.h:201</a></div></div>
<div class="ttc" id="classoperations__research_1_1ConnectedComponents_html_a047f863116aabfa88d8eeeebda5de760"><div class="ttname"><a href="classoperations__research_1_1ConnectedComponents.html#a047f863116aabfa88d8eeeebda5de760">operations_research::ConnectedComponents::MergeClasses</a></div><div class="ttdeci">void MergeClasses(NodeIndex node1, NodeIndex node2)</div><div class="ttdef"><b>Definition:</b> <a href="connectivity_8h_source.html#l00138">connectivity.h:138</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_a272bcc4d6ee0e87a7fc430a5cb13c582"><div class="ttname"><a href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">operations_research::NodeIndex</a></div><div class="ttdeci">int32 NodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00192">ebert_graph.h:192</a></div></div>
<div class="ttc" id="classoperations__research_1_1ConnectedComponents_html_a874a54f45623ba735a5634b1ea9289ea"><div class="ttname"><a href="classoperations__research_1_1ConnectedComponents.html#a874a54f45623ba735a5634b1ea9289ea">operations_research::ConnectedComponents::GetClassRepresentative</a></div><div class="ttdeci">NodeIndex GetClassRepresentative(NodeIndex node)</div><div class="ttdef"><b>Definition:</b> <a href="connectivity_8h_source.html#l00123">connectivity.h:123</a></div></div>
add more C++ doc
2019-06-13 15:36:14 +02:00
<div class="ttc" id="connectivity_8h_html"><div class="ttname"><a href="connectivity_8h.html">connectivity.h</a></div></div>
revamp refman generation
2019-08-07 18:01:08 -07:00
<div class="ttc" id="namespaceutil_html_a2f76166dbe0c4055a1f256235ad00478"><div class="ttname"><a href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">util::Graph</a></div><div class="ttdeci">ListGraph Graph</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02356">graph.h:2356</a></div></div>
<div class="ttc" id="classoperations__research_1_1ConnectedComponents_html"><div class="ttname"><a href="classoperations__research_1_1ConnectedComponents.html">operations_research::ConnectedComponents</a></div><div class="ttdef"><b>Definition:</b> <a href="connectivity_8h_source.html#l00067">connectivity.h:67</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="christofides_8h_source.html#l00033">christofides.h:33</a></div></div>
<div class="ttc" id="classoperations__research_1_1ConnectedComponents_html_a8247e505912b0c7d2309f3f9eaa74080"><div class="ttname"><a href="classoperations__research_1_1ConnectedComponents.html#a8247e505912b0c7d2309f3f9eaa74080">operations_research::ConnectedComponents::Init</a></div><div class="ttdeci">void Init(NodeIndex num_nodes)</div><div class="ttdef"><b>Definition:</b> <a href="connectivity_8h_source.html#l00072">connectivity.h:72</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_a33a2f4c26fd60cd0fa98257b571c974f"><div class="ttname"><a href="namespaceoperations__research.html#a33a2f4c26fd60cd0fa98257b571c974f">operations_research::BuildPrimMinimumSpanningTree</a></div><div class="ttdeci">std::vector&lt; typename Graph::ArcIndex &gt; BuildPrimMinimumSpanningTree(const Graph &amp;graph, const ArcValue &amp;arc_value)</div><div class="ttdef"><b>Definition:</b> <a href="minimum__spanning__tree_8h_source.html#l00117">minimum_spanning_tree.h:117</a></div></div>
add more C++ doc
2019-06-13 15:36:14 +02:00
</div><!-- fragment --></div><!-- contents -->
revamp refman generation
2019-08-07 18:01:08 -07:00
</div>
add more C++ doc
2019-06-13 15:36:14 +02:00
</div>
<div id="footer-container">
<div id="footer">
</div>
</div>
</body>
</html>
Reference in New Issue Copy Permalink