mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 04:18:34 +08:00
343 lines
28 KiB
HTML
343 lines
28 KiB
HTML
<!-- HTML header for doxygen 1.12.0-->
|
||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
||
<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.14.0"/>
|
||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||
<title>TheAlgorithms/C++: greedy_algorithms/kruskals_minimum_spanning_tree.cpp File Reference</title>
|
||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||
<script type="text/javascript" src="../../jquery.js"></script>
|
||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
||
<script type="text/javascript">
|
||
DoxygenAwesomeDarkModeToggle.init()
|
||
</script>
|
||
<script type="text/javascript" src="../../clipboard.js"></script>
|
||
<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="../../cookie.js"></script>
|
||
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||
<script type="text/javascript" src="../../search/search.js"></script>
|
||
<script type="text/javascript">
|
||
window.MathJax = {
|
||
options: {
|
||
ignoreHtmlClass: 'tex2jax_ignore',
|
||
processHtmlClass: 'tex2jax_process'
|
||
},
|
||
loader: {
|
||
load: ['[tex]/ams']
|
||
},
|
||
tex: {
|
||
macros: {},
|
||
packages: ['base','configmacros','ams']
|
||
}
|
||
};
|
||
</script>
|
||
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
|
||
</head>
|
||
<body>
|
||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||
<div id="titlearea">
|
||
<table cellspacing="0" cellpadding="0">
|
||
<tbody>
|
||
<tr id="projectrow">
|
||
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
||
<td id="projectalign">
|
||
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
||
</div>
|
||
<div id="projectbrief">All the algorithms implemented in C++</div>
|
||
</td>
|
||
</tr>
|
||
</tbody>
|
||
</table>
|
||
</div>
|
||
<!-- end header part -->
|
||
<!-- Generated by Doxygen 1.14.0 -->
|
||
<script type="text/javascript">
|
||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||
</script>
|
||
<script type="text/javascript">
|
||
$(function() { codefold.init(); });
|
||
</script>
|
||
<script type="text/javascript" src="../../menudata.js"></script>
|
||
<script type="text/javascript" src="../../menu.js"></script>
|
||
<script type="text/javascript">
|
||
$(function() {
|
||
initMenu('../../',true,false,'search.php','Search',true);
|
||
$(function() { init_search(); });
|
||
});
|
||
</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>
|
||
</div>
|
||
<script type="text/javascript">
|
||
$(function(){initNavTree('d8/d7d/kruskals__minimum__spanning__tree_8cpp.html','../../',''); });
|
||
</script>
|
||
<div id="container">
|
||
<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">
|
||
<div id="MSearchResults">
|
||
<div class="SRPage">
|
||
<div id="SRIndex">
|
||
<div id="SRResults"></div>
|
||
<div class="SRStatus" id="Loading">Loading...</div>
|
||
<div class="SRStatus" id="Searching">Searching...</div>
|
||
<div class="SRStatus" id="NoMatches">No Matches</div>
|
||
</div>
|
||
</div>
|
||
</div>
|
||
</div>
|
||
|
||
<div class="header">
|
||
<div class="headertitle"><div class="title">kruskals_minimum_spanning_tree.cpp File Reference</div></div>
|
||
</div><!--header-->
|
||
<div class="contents">
|
||
|
||
<p><a href="https://www.simplilearn.com/tutorials/data-structure-tutorial/kruskal-algorithm" target="_blank">Kruskals Minimum Spanning Tree</a> implementation
|
||
<a href="#details">More...</a></p>
|
||
<div class="textblock"><code>#include <array></code><br />
|
||
<code>#include <iostream></code><br />
|
||
<code>#include <limits></code><br />
|
||
<code>#include <cstdint></code><br />
|
||
</div><div class="textblock"><div class="dynheader">
|
||
Include dependency graph for kruskals_minimum_spanning_tree.cpp:</div>
|
||
<div class="dyncontent">
|
||
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.svg" width="318" 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="../../d8/d7d/kruskals__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 id="header-namespaces" class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||
Namespaces</h2></td></tr>
|
||
<tr class="memitem:greedy_5Falgorithms" id="r_greedy_5Falgorithms"><td class="memItemLeft" align="right" valign="top">namespace  </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"> </td><td class="mdescRight">for string class <br /></td></tr>
|
||
</table><table class="memberdecls">
|
||
<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:a349e4ab9a97532c3931a2bd2a19c0098" id="r_a349e4ab9a97532c3931a2bd2a19c0098"><td class="memTemplParams" colspan="2">template<typename T, std::size_t N, std::size_t M> </td></tr>
|
||
<tr class="memitem:a349e4ab9a97532c3931a2bd2a19c0098 template"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a> (const T &infinity, const std::array< std::array< T, N >, M > &graph)</td></tr>
|
||
<tr class="memdesc:a349e4ab9a97532c3931a2bd2a19c0098"><td class="mdescLeft"> </td><td class="mdescRight">Finds the minimum edge of the given graph. <br /></td></tr>
|
||
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
|
||
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft"> </td><td class="mdescRight">Self-test implementations. <br /></td></tr>
|
||
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
||
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <br /></td></tr>
|
||
</table>
|
||
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
|
||
<div class="textblock"><p><a href="https://www.simplilearn.com/tutorials/data-structure-tutorial/kruskal-algorithm" target="_blank">Kruskals Minimum Spanning Tree</a> implementation </p>
|
||
<p><em>Quoted from <a href="https://www.simplilearn.com/tutorials/data-structure-tutorial/kruskal-algorithm" target="_blank">Simplilearn</a>.</em></p>
|
||
<p>Kruskal’s algorithm is the concept that is introduced in the graph theory of discrete mathematics. It is used to discover the shortest path between two points in a connected weighted graph. This algorithm converts a given graph into the forest, considering each node as a separate tree. These trees can only link to each other if the edge connecting them has a low value and doesn’t generate a cycle in MST structure.</p>
|
||
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/coleman2246" target="_blank">coleman2246</a> </dd></dl>
|
||
|
||
<p class="definition">Definition in file <a class="el" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html">kruskals_minimum_spanning_tree.cpp</a>.</p>
|
||
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
|
||
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
||
|
||
<div class="memitem">
|
||
<div class="memproto">
|
||
<table class="memname">
|
||
<tr>
|
||
<td class="memname">int main </td>
|
||
<td>(</td>
|
||
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
|
||
<td></td>
|
||
</tr>
|
||
</table>
|
||
</div><div class="memdoc">
|
||
|
||
<p>Main function. </p>
|
||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||
|
||
<p class="definition">Definition at line <a class="el" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html#l00184">184</a> of file <a class="el" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html">kruskals_minimum_spanning_tree.cpp</a>.</p>
|
||
<div class="fragment"><div class="line"><span class="lineno"> 184</span> {</div>
|
||
<div class="line"><span class="lineno"> 185</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run Self-test implementation</span></div>
|
||
<div class="line"><span class="lineno"> 186</span> <span class="keywordflow">return</span> 0;</div>
|
||
<div class="line"><span class="lineno"> 187</span>}</div>
|
||
<div class="ttc" id="akruskals__minimum__spanning__tree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html#l00064">kruskals_minimum_spanning_tree.cpp:64</a></div></div>
|
||
</div><!-- fragment -->
|
||
</div>
|
||
</div>
|
||
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
|
||
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">◆ </a></span>test()</h2>
|
||
|
||
<div class="memitem">
|
||
<div class="memproto">
|
||
<table class="mlabels">
|
||
<tr>
|
||
<td class="mlabels-left">
|
||
<table class="memname">
|
||
<tr>
|
||
<td class="memname">void test </td>
|
||
<td>(</td>
|
||
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
|
||
<td></td>
|
||
</tr>
|
||
</table>
|
||
</td>
|
||
<td class="mlabels-right">
|
||
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
|
||
</tr>
|
||
</table>
|
||
</div><div class="memdoc">
|
||
|
||
<p>Self-test implementations. </p>
|
||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||
<p>define a large value for int define a large value for float define a large value for double define a large value for uint32_t</p>
|
||
|
||
<p class="definition">Definition at line <a class="el" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html">kruskals_minimum_spanning_tree.cpp</a>.</p>
|
||
<div class="fragment"><div class="line"><span class="lineno"> 64</span> {</div>
|
||
<div class="line"><span class="lineno"> 71</span> <span class="keyword">constexpr</span> <span class="keywordtype">int</span> INFINITY_INT = std::numeric_limits<int>::max();</div>
|
||
<div class="line"><span class="lineno"> 72</span> <span class="keyword">constexpr</span> <span class="keywordtype">float</span> INFINITY_FLOAT = std::numeric_limits<float>::max();</div>
|
||
<div class="line"><span class="lineno"> 73</span> <span class="keyword">constexpr</span> <span class="keywordtype">double</span> INFINITY_DOUBLE = std::numeric_limits<double>::max();</div>
|
||
<div class="line"><span class="lineno"> 74</span> <span class="keyword">constexpr</span> uint32_t INFINITY_UINT32 = UINT32_MAX;</div>
|
||
<div class="line"><span class="lineno"> 75</span> </div>
|
||
<div class="line"><span class="lineno"> 76</span> <span class="comment">// Test case with integer values</span></div>
|
||
<div class="line"><span class="lineno"> 77</span> std::cout << <span class="stringliteral">"\nTest Case 1 :\n"</span>;</div>
|
||
<div class="line"><span class="lineno"> 78</span> std::array<std::array<int, 6>, 6> graph1{</div>
|
||
<div class="line"><span class="lineno"> 79</span> 0, 4, 1, 4, INFINITY_INT, INFINITY_INT,</div>
|
||
<div class="line"><span class="lineno"> 80</span> 4, 0, 3, 8, 3, INFINITY_INT,</div>
|
||
<div class="line"><span class="lineno"> 81</span> 1, 3, 0, INFINITY_INT, 1, INFINITY_INT,</div>
|
||
<div class="line"><span class="lineno"> 82</span> 4, 8, INFINITY_INT, 0, 5, 7,</div>
|
||
<div class="line"><span class="lineno"> 83</span> INFINITY_INT, 3, 1, 5, 0, INFINITY_INT,</div>
|
||
<div class="line"><span class="lineno"> 84</span> INFINITY_INT, INFINITY_INT, INFINITY_INT, 7, INFINITY_INT, 0};</div>
|
||
<div class="line"><span class="lineno"> 85</span> <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, graph1);</div>
|
||
<div class="line"><span class="lineno"> 86</span> </div>
|
||
<div class="line"><span class="lineno"> 87</span> <span class="comment">// Test case with floating values</span></div>
|
||
<div class="line"><span class="lineno"> 88</span> std::cout << <span class="stringliteral">"\nTest Case 2 :\n"</span>;</div>
|
||
<div class="line"><span class="lineno"> 89</span> std::array<std::array<float, 3>, 3> graph2{</div>
|
||
<div class="line"><span class="lineno"> 90</span> 0.0f, 2.5f, INFINITY_FLOAT,</div>
|
||
<div class="line"><span class="lineno"> 91</span> 2.5f, 0.0f, 3.2f,</div>
|
||
<div class="line"><span class="lineno"> 92</span> INFINITY_FLOAT, 3.2f, 0.0f};</div>
|
||
<div class="line"><span class="lineno"> 93</span> <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_FLOAT, graph2);</div>
|
||
<div class="line"><span class="lineno"> 94</span> </div>
|
||
<div class="line"><span class="lineno"> 95</span> <span class="comment">// Test case with double values</span></div>
|
||
<div class="line"><span class="lineno"> 96</span> std::cout << <span class="stringliteral">"\nTest Case 3 :\n"</span>;</div>
|
||
<div class="line"><span class="lineno"> 97</span> std::array<std::array<double, 5>, 5> graph3{</div>
|
||
<div class="line"><span class="lineno"> 98</span> 0.0, 10.5, INFINITY_DOUBLE, 6.7, 3.3,</div>
|
||
<div class="line"><span class="lineno"> 99</span> 10.5, 0.0, 8.1, 15.4, INFINITY_DOUBLE,</div>
|
||
<div class="line"><span class="lineno"> 100</span> INFINITY_DOUBLE, 8.1, 0.0, INFINITY_DOUBLE, 7.8,</div>
|
||
<div class="line"><span class="lineno"> 101</span> 6.7, 15.4, INFINITY_DOUBLE, 0.0, 9.9,</div>
|
||
<div class="line"><span class="lineno"> 102</span> 3.3, INFINITY_DOUBLE, 7.8, 9.9, 0.0};</div>
|
||
<div class="line"><span class="lineno"> 103</span> <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_DOUBLE, graph3);</div>
|
||
<div class="line"><span class="lineno"> 104</span> </div>
|
||
<div class="line"><span class="lineno"> 105</span> <span class="comment">// Test Case with negative weights</span></div>
|
||
<div class="line"><span class="lineno"> 106</span> std::cout << <span class="stringliteral">"\nTest Case 4 :\n"</span>;</div>
|
||
<div class="line"><span class="lineno"> 107</span> std::array<std::array<int, 3>, 3> graph_neg{</div>
|
||
<div class="line"><span class="lineno"> 108</span> 0, -2, 4,</div>
|
||
<div class="line"><span class="lineno"> 109</span> -2, 0, 3,</div>
|
||
<div class="line"><span class="lineno"> 110</span> 4, 3, 0};</div>
|
||
<div class="line"><span class="lineno"> 111</span> <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, graph_neg);</div>
|
||
<div class="line"><span class="lineno"> 112</span> </div>
|
||
<div class="line"><span class="lineno"> 113</span> <span class="comment">// Test Case with Self-Loops</span></div>
|
||
<div class="line"><span class="lineno"> 114</span> std::cout << <span class="stringliteral">"\nTest Case 5 :\n"</span>;</div>
|
||
<div class="line"><span class="lineno"> 115</span> std::array<std::array<int, 3>, 3> graph_self_loop{</div>
|
||
<div class="line"><span class="lineno"> 116</span> 2, 1, INFINITY_INT,</div>
|
||
<div class="line"><span class="lineno"> 117</span> INFINITY_INT, 0, 4,</div>
|
||
<div class="line"><span class="lineno"> 118</span> INFINITY_INT, 4, 0};</div>
|
||
<div class="line"><span class="lineno"> 119</span> <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, graph_self_loop);</div>
|
||
<div class="line"><span class="lineno"> 120</span> </div>
|
||
<div class="line"><span class="lineno"> 121</span> <span class="comment">// Test Case with no edges</span></div>
|
||
<div class="line"><span class="lineno"> 122</span> std::cout << <span class="stringliteral">"\nTest Case 6 :\n"</span>;</div>
|
||
<div class="line"><span class="lineno"> 123</span> std::array<std::array<int, 4>, 4> no_edges{</div>
|
||
<div class="line"><span class="lineno"> 124</span> 0, INFINITY_INT, INFINITY_INT, INFINITY_INT,</div>
|
||
<div class="line"><span class="lineno"> 125</span> INFINITY_INT, 0, INFINITY_INT, INFINITY_INT,</div>
|
||
<div class="line"><span class="lineno"> 126</span> INFINITY_INT, INFINITY_INT, 0, INFINITY_INT,</div>
|
||
<div class="line"><span class="lineno"> 127</span> INFINITY_INT, INFINITY_INT, INFINITY_INT, 0};</div>
|
||
<div class="line"><span class="lineno"> 128</span> <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, no_edges);</div>
|
||
<div class="line"><span class="lineno"> 129</span> </div>
|
||
<div class="line"><span class="lineno"> 130</span> <span class="comment">// Test Case with a non-connected graph</span></div>
|
||
<div class="line"><span class="lineno"> 131</span> std::cout << <span class="stringliteral">"\nTest Case 7:\n"</span>;</div>
|
||
<div class="line"><span class="lineno"> 132</span> std::array<std::array<int, 4>, 4> partial_graph{</div>
|
||
<div class="line"><span class="lineno"> 133</span> 0, 2, INFINITY_INT, 6,</div>
|
||
<div class="line"><span class="lineno"> 134</span> 2, 0, 3, INFINITY_INT,</div>
|
||
<div class="line"><span class="lineno"> 135</span> INFINITY_INT, 3, 0, 4,</div>
|
||
<div class="line"><span class="lineno"> 136</span> 6, INFINITY_INT, 4, 0};</div>
|
||
<div class="line"><span class="lineno"> 137</span> <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, partial_graph);</div>
|
||
<div class="line"><span class="lineno"> 138</span> </div>
|
||
<div class="line"><span class="lineno"> 139</span> <span class="comment">// Test Case with Directed weighted graph. The Krushkal algorithm does not give</span></div>
|
||
<div class="line"><span class="lineno"> 140</span> <span class="comment">// optimal answer</span></div>
|
||
<div class="line"><span class="lineno"> 141</span> std::cout << <span class="stringliteral">"\nTest Case 8:\n"</span>;</div>
|
||
<div class="line"><span class="lineno"> 142</span> std::array<std::array<int, 4>, 4> directed_graph{</div>
|
||
<div class="line"><span class="lineno"> 143</span> 0, 3, 7, INFINITY_INT, <span class="comment">// Vertex 0 has edges to Vertex 1 and Vertex 2</span></div>
|
||
<div class="line"><span class="lineno"> 144</span> INFINITY_INT, 0, 2, 5, <span class="comment">// Vertex 1 has edges to Vertex 2 and Vertex 3</span></div>
|
||
<div class="line"><span class="lineno"> 145</span> INFINITY_INT, INFINITY_INT, 0, 1, <span class="comment">// Vertex 2 has an edge to Vertex 3</span></div>
|
||
<div class="line"><span class="lineno"> 146</span> INFINITY_INT, INFINITY_INT, INFINITY_INT, 0}; <span class="comment">// Vertex 3 has no outgoing edges</span></div>
|
||
<div class="line"><span class="lineno"> 147</span> <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, directed_graph);</div>
|
||
<div class="line"><span class="lineno"> 148</span> </div>
|
||
<div class="line"><span class="lineno"> 149</span> <span class="comment">// Test case with wrong input passed</span></div>
|
||
<div class="line"><span class="lineno"> 150</span> std::cout << <span class="stringliteral">"\nTest Case 9:\n"</span>;</div>
|
||
<div class="line"><span class="lineno"> 151</span> std::array<std::array<int, 4>, 3> graph9{</div>
|
||
<div class="line"><span class="lineno"> 152</span> 0, 5, 5, 5,</div>
|
||
<div class="line"><span class="lineno"> 153</span> 5, 0, 5, 5, </div>
|
||
<div class="line"><span class="lineno"> 154</span> 5, 5, 5, 5};</div>
|
||
<div class="line"><span class="lineno"> 155</span> <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, graph9);</div>
|
||
<div class="line"><span class="lineno"> 156</span> </div>
|
||
<div class="line"><span class="lineno"> 157</span> <span class="comment">// Test case with all the same values between every edge</span></div>
|
||
<div class="line"><span class="lineno"> 158</span> std::cout << <span class="stringliteral">"\nTest Case 10:\n"</span>;</div>
|
||
<div class="line"><span class="lineno"> 159</span> std::array<std::array<int, 5>, 5> graph10{</div>
|
||
<div class="line"><span class="lineno"> 160</span> 0, 5, 5, 5, 5,</div>
|
||
<div class="line"><span class="lineno"> 161</span> 5, 0, 5, 5, 5,</div>
|
||
<div class="line"><span class="lineno"> 162</span> 5, 5, 0, 5, 5,</div>
|
||
<div class="line"><span class="lineno"> 163</span> 5, 5, 5, 0, 5,</div>
|
||
<div class="line"><span class="lineno"> 164</span> 5, 5, 5, 5, 0};</div>
|
||
<div class="line"><span class="lineno"> 165</span> <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, graph10);</div>
|
||
<div class="line"><span class="lineno"> 166</span> </div>
|
||
<div class="line"><span class="lineno"> 167</span> <span class="comment">// Test Case with uint32_t values</span></div>
|
||
<div class="line"><span class="lineno"> 168</span> std::cout << <span class="stringliteral">"\nTest Case 11 :\n"</span>;</div>
|
||
<div class="line"><span class="lineno"> 169</span> std::array<std::array<uint32_t, 4>, 4> graph_uint32{</div>
|
||
<div class="line"><span class="lineno"> 170</span> 0, 5, INFINITY_UINT32, 9,</div>
|
||
<div class="line"><span class="lineno"> 171</span> 5, 0, 2, INFINITY_UINT32,</div>
|
||
<div class="line"><span class="lineno"> 172</span> INFINITY_UINT32, 2, 0, 6,</div>
|
||
<div class="line"><span class="lineno"> 173</span> 9, INFINITY_UINT32, 6, 0};</div>
|
||
<div class="line"><span class="lineno"> 174</span> <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_UINT32, graph_uint32);</div>
|
||
<div class="line"><span class="lineno"> 175</span> </div>
|
||
<div class="line"><span class="lineno"> 176</span> std::cout << <span class="stringliteral">"\nAll tests have successfully passed!\n"</span>;</div>
|
||
<div class="line"><span class="lineno"> 177</span>}</div>
|
||
<div class="ttc" id="anamespacegreedy__algorithms_html_a349e4ab9a97532c3931a2bd2a19c0098"><div class="ttname"><a href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a></div><div class="ttdeci">void findMinimumEdge(const T &infinity, const std::array< std::array< T, N >, M > &graph)</div><div class="ttdoc">Finds the minimum edge of the given graph.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html#l00038">kruskals_minimum_spanning_tree.cpp:38</a></div></div>
|
||
</div><!-- fragment -->
|
||
</div>
|
||
</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 href="../../dir_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><a href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html">kruskals_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>
|
||
</html>
|