mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 04:18:34 +08:00
288 lines
32 KiB
HTML
288 lines
32 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 Source File</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_source.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</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span> </div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include <array></span> </div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include <iostream></span> </div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include <limits></span> </div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include <cstdint></span> </div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a> {</div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="keyword">template</span> <<span class="keyword">typename</span> T, std::<span class="keywordtype">size_t</span> N, std::<span class="keywordtype">size_t</span> M></div>
|
|
<div class="foldopen" id="foldopen00038" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098"> 38</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">findMinimumEdge</a>(<span class="keyword">const</span> T &infinity,</div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="keyword">const</span> std::array<std::array<T, N>, M> &<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>) {</div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keywordflow">if</span> (N != M) {</div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> std::cout << <span class="stringliteral">"\nWrong input passed. Provided array has dimensions "</span> << N</div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> << <span class="stringliteral">"x"</span> << M << <span class="stringliteral">". Please provide a square matrix.\n"</span>;</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> }</div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size(); i++) {</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keywordtype">int</span> min = infinity;</div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="keywordtype">int</span> minIndex = 0;</div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size(); j++) {</div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keywordflow">if</span> (i != j && <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[i][j] != 0 && <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[i][j] < min) {</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> min = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[i][j];</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> minIndex = j;</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> }</div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> }</div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> std::cout << i << <span class="stringliteral">" - "</span> << minIndex << <span class="stringliteral">"\t"</span> << <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[i][minIndex]</div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> << <span class="stringliteral">"\n"</span>;</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> }</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span>} <span class="comment">// namespace greedy_algorithms</span></div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span></div>
|
|
<div class="foldopen" id="foldopen00064" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"> 64</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><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"><a id="l00072" name="l00072"></a><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"><a id="l00073" name="l00073"></a><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"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keyword">constexpr</span> uint32_t INFINITY_UINT32 = UINT32_MAX;</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> </div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="comment">// Test case with integer values</span></div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> std::cout << <span class="stringliteral">"\nTest Case 1 :\n"</span>;</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> std::array<std::array<int, 6>, 6> graph1{</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> 0, 4, 1, 4, INFINITY_INT, INFINITY_INT,</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> 4, 0, 3, 8, 3, INFINITY_INT,</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> 1, 3, 0, INFINITY_INT, 1, INFINITY_INT,</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> 4, 8, INFINITY_INT, 0, 5, 7,</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> INFINITY_INT, 3, 1, 5, 0, INFINITY_INT,</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> INFINITY_INT, INFINITY_INT, INFINITY_INT, 7, INFINITY_INT, 0};</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><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"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> </div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="comment">// Test case with floating values</span></div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> std::cout << <span class="stringliteral">"\nTest Case 2 :\n"</span>;</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> std::array<std::array<float, 3>, 3> graph2{</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> 0.0f, 2.5f, INFINITY_FLOAT,</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> 2.5f, 0.0f, 3.2f,</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> INFINITY_FLOAT, 3.2f, 0.0f};</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><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"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> </div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="comment">// Test case with double values</span></div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> std::cout << <span class="stringliteral">"\nTest Case 3 :\n"</span>;</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> std::array<std::array<double, 5>, 5> graph3{</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> 0.0, 10.5, INFINITY_DOUBLE, 6.7, 3.3,</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> 10.5, 0.0, 8.1, 15.4, INFINITY_DOUBLE,</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> INFINITY_DOUBLE, 8.1, 0.0, INFINITY_DOUBLE, 7.8,</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> 6.7, 15.4, INFINITY_DOUBLE, 0.0, 9.9,</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> 3.3, INFINITY_DOUBLE, 7.8, 9.9, 0.0};</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><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"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> </div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="comment">// Test Case with negative weights</span></div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> std::cout << <span class="stringliteral">"\nTest Case 4 :\n"</span>;</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> std::array<std::array<int, 3>, 3> graph_neg{</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> 0, -2, 4,</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> -2, 0, 3,</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> 4, 3, 0};</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><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"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> </div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="comment">// Test Case with Self-Loops</span></div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> std::cout << <span class="stringliteral">"\nTest Case 5 :\n"</span>;</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> std::array<std::array<int, 3>, 3> graph_self_loop{</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> 2, 1, INFINITY_INT,</div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> INFINITY_INT, 0, 4,</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> INFINITY_INT, 4, 0};</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><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"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> </div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="comment">// Test Case with no edges</span></div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> std::cout << <span class="stringliteral">"\nTest Case 6 :\n"</span>;</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> std::array<std::array<int, 4>, 4> no_edges{</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> 0, INFINITY_INT, INFINITY_INT, INFINITY_INT,</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> INFINITY_INT, 0, INFINITY_INT, INFINITY_INT,</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> INFINITY_INT, INFINITY_INT, 0, INFINITY_INT,</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> INFINITY_INT, INFINITY_INT, INFINITY_INT, 0};</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><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"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> </div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="comment">// Test Case with a non-connected graph</span></div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> std::cout << <span class="stringliteral">"\nTest Case 7:\n"</span>;</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> std::array<std::array<int, 4>, 4> partial_graph{</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> 0, 2, INFINITY_INT, 6,</div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> 2, 0, 3, INFINITY_INT,</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> INFINITY_INT, 3, 0, 4,</div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> 6, INFINITY_INT, 4, 0};</div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><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"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> </div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><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"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="comment">// optimal answer</span></div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> std::cout << <span class="stringliteral">"\nTest Case 8:\n"</span>;</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> std::array<std::array<int, 4>, 4> directed_graph{</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><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"><a id="l00144" name="l00144"></a><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"><a id="l00145" name="l00145"></a><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"><a id="l00146" name="l00146"></a><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"><a id="l00147" name="l00147"></a><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"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> </div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// Test case with wrong input passed</span></div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> std::cout << <span class="stringliteral">"\nTest Case 9:\n"</span>;</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> std::array<std::array<int, 4>, 3> graph9{</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> 0, 5, 5, 5,</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> 5, 0, 5, 5, </div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> 5, 5, 5, 5};</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><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"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> </div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// Test case with all the same values between every edge</span></div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> std::cout << <span class="stringliteral">"\nTest Case 10:\n"</span>;</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> std::array<std::array<int, 5>, 5> graph10{</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> 0, 5, 5, 5, 5,</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> 5, 0, 5, 5, 5,</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> 5, 5, 0, 5, 5,</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> 5, 5, 5, 0, 5,</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> 5, 5, 5, 5, 0};</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><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"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> </div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> <span class="comment">// Test Case with uint32_t values</span></div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> std::cout << <span class="stringliteral">"\nTest Case 11 :\n"</span>;</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> std::array<std::array<uint32_t, 4>, 4> graph_uint32{</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> 0, 5, INFINITY_UINT32, 9,</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> 5, 0, 2, INFINITY_UINT32,</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> INFINITY_UINT32, 2, 0, 6,</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> 9, INFINITY_UINT32, 6, 0};</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><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"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> </div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> std::cout << <span class="stringliteral">"\nAll tests have successfully passed!\n"</span>;</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span></div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> </div>
|
|
<div class="foldopen" id="foldopen00184" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"><a class="line" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 184</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <a class="code hl_function" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run Self-test implementation</span></div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> </div>
|
|
<div class="ttc" id="akruskals__minimum__spanning__tree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#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="#l00064">kruskals_minimum_spanning_tree.cpp:64</a></div></div>
|
|
<div class="ttc" id="akruskals__minimum__spanning__tree_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00184">kruskals_minimum_spanning_tree.cpp:184</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 class="ttc" id="anamespacegreedy__algorithms_html"><div class="ttname"><a href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></div><div class="ttdoc">for string class</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d1f/binary__addition_8cpp_source.html#l00027">binary_addition.cpp:27</a></div></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="#l00038">kruskals_minimum_spanning_tree.cpp:38</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</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>
|