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 f1eddf4d65

Browse Source
This commit is contained in:
realstealthninja
2025-07-09 10:53:16 +00:00
parent e7edde96ab
commit b41207008f
2497 changed files with 31270 additions and 40283 deletions
Download Patch File Download Diff File Expand all files Collapse all files

56
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.13.2"/>
<meta name="generator" content="Doxygen 1.14.0"/>
<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" />
@@ -19,7 +19,6 @@
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
@@ -60,26 +59,20 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.13.2 -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
$(function() { codefold.init(); });
</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:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
@@ -94,10 +87,9 @@ $(function() {
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html','../../'); initResizable(true); });
/* @license-end */
$(function(){initNavTree('d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html','../../',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
@@ -121,9 +113,6 @@ $(function(){initNavTree('d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html','.
</div>
<div class="header">
<div class="summary">
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">boruvkas_minimum_spanning_tree.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
@@ -137,39 +126,32 @@ $(function(){initNavTree('d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html','.
</div><div class="textblock"><div class="dynheader">
Include dependency graph for boruvkas_minimum_spanning_tree.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d5d/boruvkas__minimum__spanning__tree_8cpp__incl.svg" width="335" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../dc/d5d/boruvkas__minimum__spanning__tree_8cpp__incl.svg" width="335" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
<p><a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
<tr class="heading"><td colspan="2"><h2 id="header-namespaces" class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></td></tr>
<tr class="memitem:greedy_5Falgorithms" id="r_greedy_5Falgorithms"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></td></tr>
<tr class="memdesc:d2/d90/namespacegreedy__algorithms"><td class="mdescLeft">&#160;</td><td class="mdescRight">for string class <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d64/namespaceboruvkas__minimum__spanning__tree.html">boruvkas_minimum_spanning_tree</a></td></tr>
<tr class="memitem:boruvkas_5Fminimum_5Fspanning_5Ftree" id="r_boruvkas_5Fminimum_5Fspanning_5Ftree"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d64/namespaceboruvkas__minimum__spanning__tree.html">boruvkas_minimum_spanning_tree</a></td></tr>
<tr class="memdesc:d8/d64/namespaceboruvkas__minimum__spanning__tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the [Borůvkas Algorithm](<a href="https://en.wikipedia.org/wiki/Borůvka's_algorithm">https://en.wikipedia.org/wiki/Borůvka's_algorithm</a>) implementation. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a95de0f5e70e83164dbd1b4c515565e84" id="r_a95de0f5e70e83164dbd1b4c515565e84"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a95de0f5e70e83164dbd1b4c515565e84">greedy_algorithms::boruvkas_minimum_spanning_tree::findParent</a> (std::vector&lt; std::pair&lt; int, int &gt; &gt; parent, const int v)</td></tr>
<tr class="memdesc:a95de0f5e70e83164dbd1b4c515565e84"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursively returns the vertex's parent at the root of the tree. <br /></td></tr>
<tr class="separator:a95de0f5e70e83164dbd1b4c515565e84"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a94c615fc66b72e0adbcbcb99aabb1a59" id="r_a94c615fc66b72e0adbcbcb99aabb1a59"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a94c615fc66b72e0adbcbcb99aabb1a59">greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</a> (std::vector&lt; std::vector&lt; int &gt; &gt; adj)</td></tr>
<tr class="memdesc:a94c615fc66b72e0adbcbcb99aabb1a59"><td class="mdescLeft">&#160;</td><td class="mdescRight">the implementation of boruvka's algorithm <br /></td></tr>
<tr class="separator:a94c615fc66b72e0adbcbcb99aabb1a59"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2311b22324cf09926726e4ce1309af8b" id="r_a2311b22324cf09926726e4ce1309af8b"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2311b22324cf09926726e4ce1309af8b">greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum</a> (std::vector&lt; std::vector&lt; int &gt; &gt; adj)</td></tr>
<tr class="memdesc:a2311b22324cf09926726e4ce1309af8b"><td class="mdescLeft">&#160;</td><td class="mdescRight">counts the sum of edges in the given tree <br /></td></tr>
<tr class="separator:a2311b22324cf09926726e4ce1309af8b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
<tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="separator:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
<div class="textblock"><p>[Borůvkas Algorithm](<a href="https://en.wikipedia.org/wiki/Borůvka's_algorithm">https://en.wikipedia.org/wiki/Borůvka's_algorithm</a>) to find the <a class="el" href="../../d4/d12/namespace_minimum.html" title="Implementation of Minimum Edit Distance algorithm.">Minimum</a> Spanning Tree </p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/JNardoni" target="_blank">Jason Nardoni</a></dd></dl>
<p>Boruvka's algorithm is a greepy algorithm to find the MST by starting with small trees, and combining them to build bigger ones.</p><ol type="1">
@@ -182,7 +164,7 @@ Functions</h2></td></tr>
<p>It assumes that the graph is connected. Non-connected edges can be represented using 0 or INT_MAX </p>
<p class="definition">Definition in file <a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html">boruvkas_minimum_spanning_tree.cpp</a>.</p>
</div><h2 class="groupheader">Function Documentation</h2>
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
<a id="a94c615fc66b72e0adbcbcb99aabb1a59" name="a94c615fc66b72e0adbcbcb99aabb1a59"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a94c615fc66b72e0adbcbcb99aabb1a59">&#9670;&#160;</a></span>boruvkas()</h2>
@@ -441,7 +423,7 @@ Functions</h2></td></tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void tests </td>
<td class="memname">void tests </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
@@ -489,11 +471,19 @@ Functions</h2></td></tr>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div id="page-nav" class="page-nav-panel">
<div id="page-nav-resize-handle"></div>
<div id="page-nav-tree">
<div id="page-nav-contents">
</div><!-- page-nav-contents -->
</div><!-- page-nav-tree -->
</div><!-- page-nav -->
</div><!-- container -->
<!-- start footer part -->
<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.13.2 </li>
<li class="navelem"><a href="../../dir_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><a 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.14.0 </li>
</ul>
</div>
</body>