backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-25 06:12:11 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for c26eea874d

Browse Source
This commit is contained in:
realstealthninja
2025-05-19 11:38:33 +00:00
parent c7a9a42397
commit 14583a2f33
2829 changed files with 30266 additions and 21669 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html
View File

@@ -4,7 +4,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="generator" content="Doxygen 1.13.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: greedy_algorithms/boruvkas_minimum_spanning_tree.cpp File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -60,7 +60,7 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.12.0 -->
<!-- Generated by Doxygen 1.13.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -317,7 +317,7 @@ Functions</h2></td></tr>
<div class="line"><span class="lineno"> 166</span> }</div>
<div class="line"><span class="lineno"> 167</span> <span class="keywordflow">return</span> MST;</div>
<div class="line"><span class="lineno"> 168</span>}</div>
<div class="ttc" id="aboruvkas__minimum__spanning__tree_8cpp_html_a95de0f5e70e83164dbd1b4c515565e84"><div class="ttname"><a href="#a95de0f5e70e83164dbd1b4c515565e84">greedy_algorithms::boruvkas_minimum_spanning_tree::findParent</a></div><div class="ttdeci">int findParent(std::vector&lt; std::pair&lt; int, int &gt; &gt; parent, const int v)</div><div class="ttdoc">Recursively returns the vertex's parent at the root of the tree.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html#l00047">boruvkas_minimum_spanning_tree.cpp:47</a></div></div>
<div class="ttc" id="aboruvkas__minimum__spanning__tree_8cpp_html_a95de0f5e70e83164dbd1b4c515565e84"><div class="ttname"><a href="#a95de0f5e70e83164dbd1b4c515565e84">greedy_algorithms::boruvkas_minimum_spanning_tree::findParent</a></div><div class="ttdeci">int findParent(std::vector&lt; std::pair&lt; int, int &gt; &gt; parent, const int v)</div><div class="ttdoc">Recursively returns the vertex&#39;s parent at the root of the tree.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html#l00047">boruvkas_minimum_spanning_tree.cpp:47</a></div></div>
</div><!-- fragment -->
</div>
</div>
@@ -415,13 +415,13 @@ Functions</h2></td></tr>
<p class="definition">Definition at line <a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html#l00175">175</a> of file <a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html">boruvkas_minimum_spanning_tree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 175</span> {</div>
<div class="line"><span class="lineno"> 176</span> <span class="keywordtype">size_t</span> size = adj.size();</div>
<div class="line"><span class="lineno"> 177</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> = 0;</div>
<div class="line"><span class="lineno"> 177</span> <span class="keywordtype">int</span> sum = 0;</div>
<div class="line"><span class="lineno"> 178</span> </div>
<div class="line"><span class="lineno"> 179</span> <span class="comment">// Moves through one side of the adj matrix, counting the sums of each edge</span></div>
<div class="line"><span class="lineno"> 180</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
<div class="line"><span class="lineno"> 181</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; size; j++) {</div>
<div class="line"><span class="lineno"> 182</span> <span class="keywordflow">if</span> (adj[i][j] &lt; INT_MAX) {</div>
<div class="line"><span class="lineno"> 183</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> += adj[i][j];</div>
<div class="line"><span class="lineno"> 183</span> sum += adj[i][j];</div>
<div class="line"><span class="lineno"> 184</span> }</div>
<div class="line"><span class="lineno"> 185</span> }</div>
<div class="line"><span class="lineno"> 186</span> }</div>
@@ -449,7 +449,7 @@ Functions</h2></td></tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
@@ -467,7 +467,7 @@ Functions</h2></td></tr>
<div class="line"><span class="lineno"> 202</span> };</div>
<div class="line"><span class="lineno"> 203</span> std::vector&lt;std::vector&lt;int&gt;&gt; MST =</div>
<div class="line"><span class="lineno"> 204</span> <a class="code hl_function" href="#a94c615fc66b72e0adbcbcb99aabb1a59">greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</a>(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>);</div>
<div class="line"><span class="lineno"> 205</span> assert(greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum(</div>
<div class="line"><span class="lineno"> 205</span> assert(<a class="code hl_function" href="#a2311b22324cf09926726e4ce1309af8b">greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum</a>(</div>
<div class="line"><span class="lineno"> 206</span> MST) == 13);</div>
<div class="line"><span class="lineno"> 207</span> std::cout &lt;&lt; <span class="stringliteral">&quot;1st test passed!&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 208</span> </div>
@@ -477,11 +477,12 @@ Functions</h2></td></tr>
<div class="line"><span class="lineno"> 212</span> {6, 8, 0, 0, 9},</div>
<div class="line"><span class="lineno"> 213</span> {0, 5, 7, 9, 0}};</div>
<div class="line"><span class="lineno"> 214</span> MST = <a class="code hl_function" href="#a94c615fc66b72e0adbcbcb99aabb1a59">greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</a>(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>);</div>
<div class="line"><span class="lineno"> 215</span> assert(greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum(</div>
<div class="line"><span class="lineno"> 215</span> assert(<a class="code hl_function" href="#a2311b22324cf09926726e4ce1309af8b">greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum</a>(</div>
<div class="line"><span class="lineno"> 216</span> MST) == 16);</div>
<div class="line"><span class="lineno"> 217</span> std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test passed!&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 218</span>}</div>
<div class="ttc" id="aboruvkas__minimum__spanning__tree_8cpp_html_a94c615fc66b72e0adbcbcb99aabb1a59"><div class="ttname"><a href="#a94c615fc66b72e0adbcbcb99aabb1a59">greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; boruvkas(std::vector&lt; std::vector&lt; int &gt; &gt; adj)</div><div class="ttdoc">the implementation of boruvka's algorithm</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html#l00060">boruvkas_minimum_spanning_tree.cpp:60</a></div></div>
<div class="ttc" id="aboruvkas__minimum__spanning__tree_8cpp_html_a2311b22324cf09926726e4ce1309af8b"><div class="ttname"><a href="#a2311b22324cf09926726e4ce1309af8b">greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum</a></div><div class="ttdeci">int test_findGraphSum(std::vector&lt; std::vector&lt; int &gt; &gt; adj)</div><div class="ttdoc">counts the sum of edges in the given tree</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html#l00175">boruvkas_minimum_spanning_tree.cpp:175</a></div></div>
<div class="ttc" id="aboruvkas__minimum__spanning__tree_8cpp_html_a94c615fc66b72e0adbcbcb99aabb1a59"><div class="ttname"><a href="#a94c615fc66b72e0adbcbcb99aabb1a59">greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; boruvkas(std::vector&lt; std::vector&lt; int &gt; &gt; adj)</div><div class="ttdoc">the implementation of boruvka&#39;s algorithm</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html#l00060">boruvkas_minimum_spanning_tree.cpp:60</a></div></div>
<div class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph Algorithms.</div></div>
</div><!-- fragment -->
</div>
@@ -492,7 +493,7 @@ Functions</h2></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html">boruvkas_minimum_spanning_tree.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.13.2 </li>
</ul>
</div>
</body>