backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 12:23:13 +08:00
Code Issues Projects Releases Wiki Activity
Files
14583a2f33720eba2e2786d75e8e2312b85fa667
C-Plus-Plus/d8/db9/topological__sort_8cpp_source.html
realstealthninja 14583a2f33 Documentation for c26eea874d
2025-05-19 11:38:33 +00:00

288 lines
33 KiB
HTML
Raw Blame History

<!-- 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.13.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: graph/topological_sort.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="../../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>
<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">&#160;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.13.2 -->
<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 */
</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 -->
<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">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('d8/db9/topological__sort_8cpp_source.html','../../'); initResizable(true); });
/* @license-end */
</script>
<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">topological_sort.cpp</div></div>
</div><!--header-->
<div class="contents">
<a href="../../d8/db9/topological__sort_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="l00014" name="l00014"></a><span class="lineno"> 14</span> </div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#include &lt;algorithm&gt;</span> <span class="comment">// For std::reverse</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include &lt;cassert&gt;</span> <span class="comment">// For assert</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include &lt;iostream&gt;</span> <span class="comment">// For IO operations</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include &lt;stack&gt;</span> <span class="comment">// For std::stack</span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include &lt;stdexcept&gt;</span> <span class="comment">// For std::invalid_argument</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include &lt;vector&gt;</span> <span class="comment">// For std::vector</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> {</div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span></div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d76/namespacetopological__sort.html">topological_sort</a> {</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="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html"> 38</a></span><span class="keyword">class </span><a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a75a849f80a66304e7da39b3ccd6129d6">Graph</a> {</div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="keyword">private</span>:</div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keywordtype">int</span> n; <span class="comment">// Number of nodes</span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> std::vector&lt;std::vector&lt;int&gt;&gt; adj; <span class="comment">// Adjacency list representation</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> </div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="keyword">public</span>:</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a75a849f80a66304e7da39b3ccd6129d6"> 48</a></span> <a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a75a849f80a66304e7da39b3ccd6129d6">Graph</a>(<span class="keywordtype">int</span> nodes) : n(nodes), adj(nodes) {}</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span></div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345"> 55</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(<span class="keywordtype">int</span> u, <span class="keywordtype">int</span> v) { adj[u].push_back(v); }</div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span></div>
<div class="foldopen" id="foldopen00061" data-start="{" data-end="}">
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"><a class="line" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a5e84b175ef768ff58eaeededd43e8368"> 61</a></span> <span class="keyword">const</span> std::vector&lt;std::vector&lt;int&gt;&gt;&amp; <a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a5e84b175ef768ff58eaeededd43e8368">getAdjacencyList</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">return</span> adj;</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> }</div>
</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span></div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#ad22018e4f4f80aecb0538044bb83d096"> 69</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#ad22018e4f4f80aecb0538044bb83d096">getNumNodes</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> n; }</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span>};</div>
</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span></div>
<div class="foldopen" id="foldopen00079" data-start="{" data-end="}">
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="../../d8/db9/topological__sort_8cpp.html#abcbcaa2bb70af0a11d0c090ea1796aea"> 79</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/db9/topological__sort_8cpp.html#abcbcaa2bb70af0a11d0c090ea1796aea">dfs</a>(<span class="keywordtype">int</span> v, std::vector&lt;int&gt;&amp; visited,</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keyword">const</span> std::vector&lt;std::vector&lt;int&gt;&gt;&amp; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, std::stack&lt;int&gt;&amp; s) {</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> visited[v] = 1;</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> neighbour : <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[v]) {</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keywordflow">if</span> (!visited[neighbour]) {</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <a class="code hl_function" href="../../d8/db9/topological__sort_8cpp.html#abcbcaa2bb70af0a11d0c090ea1796aea">dfs</a>(neighbour, visited, <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, s);</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> }</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> s.push(v);</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span>}</div>
</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span></div>
<div class="foldopen" id="foldopen00095" data-start="{" data-end="}">
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="../../d8/db9/topological__sort_8cpp.html#a54dc5d7914958dbd24dda2fd862dc41b"> 95</a></span>std::vector&lt;int&gt; <a class="code hl_function" href="../../d8/db9/topological__sort_8cpp.html#a54dc5d7914958dbd24dda2fd862dc41b">topologicalSort</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">Graph</a>&amp; g) {</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="keywordtype">int</span> n = g.getNumNodes();</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="keyword">const</span> <span class="keyword">auto</span>&amp; adj = g.getAdjacencyList();</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> std::vector&lt;int&gt; visited(n, 0);</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> std::stack&lt;int&gt; s;</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> </div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keywordflow">if</span> (!visited[i]) {</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <a class="code hl_function" href="../../d8/db9/topological__sort_8cpp.html#abcbcaa2bb70af0a11d0c090ea1796aea">dfs</a>(i, visited, adj, s);</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> }</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> </div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> std::vector&lt;int&gt; ans;</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keywordflow">while</span> (!s.empty()) {</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="keywordtype">int</span> elem = s.top();</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> s.pop();</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> ans.push_back(elem);</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> </div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="keywordflow">if</span> (ans.size() &lt; n) { <span class="comment">// Cycle detected</span></div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;cycle detected in graph&quot;</span>);</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> }</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keywordflow">return</span> ans;</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span>}</div>
</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span>} <span class="comment">// namespace topological_sort</span></div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span>} <span class="comment">// namespace graph</span></div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span></div>
<div class="foldopen" id="foldopen00126" data-start="{" data-end="}">
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"><a class="line" href="../../d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"> 126</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="comment">// Test 1</span></div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Testing for graph 1\n&quot;</span>;</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="keywordtype">int</span> n_1 = 6;</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <a class="code hl_class" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">graph::topological_sort::Graph</a> graph1(n_1);</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> graph1.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(4, 0);</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> graph1.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(5, 0);</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> graph1.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(5, 2);</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> graph1.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(2, 3);</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> graph1.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(3, 1);</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> graph1.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(4, 1);</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> std::vector&lt;int&gt; ans_1 = <a class="code hl_function" href="../../d8/db9/topological__sort_8cpp.html#a54dc5d7914958dbd24dda2fd862dc41b">graph::topological_sort::topologicalSort</a>(graph1);</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> std::vector&lt;int&gt; expected_1 = {5, 4, 2, 3, 1, 0};</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Topological Sorting Order: &quot;</span>;</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : ans_1) {</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> }</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> assert(ans_1 == expected_1);</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test Passed\n\n&quot;</span>;</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> </div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="comment">// Test 2</span></div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Testing for graph 2\n&quot;</span>;</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="keywordtype">int</span> n_2 = 5;</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <a class="code hl_class" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">graph::topological_sort::Graph</a> graph2(n_2);</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> graph2.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(0, 1);</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> graph2.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(0, 2);</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> graph2.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(1, 2);</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> graph2.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(2, 3);</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> graph2.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(1, 3);</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> graph2.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(2, 4);</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> std::vector&lt;int&gt; ans_2 = <a class="code hl_function" href="../../d8/db9/topological__sort_8cpp.html#a54dc5d7914958dbd24dda2fd862dc41b">graph::topological_sort::topologicalSort</a>(graph2);</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> std::vector&lt;int&gt; expected_2 = {0, 1, 2, 4, 3};</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Topological Sorting Order: &quot;</span>;</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : ans_2) {</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> }</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> assert(ans_2 == expected_2);</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test Passed\n\n&quot;</span>;</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 3 - Graph with cycle</span></div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Testing for graph 3\n&quot;</span>;</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="keywordtype">int</span> n_3 = 3;</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <a class="code hl_class" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">graph::topological_sort::Graph</a> graph3(n_3);</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> graph3.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(0, 1);</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> graph3.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(1, 2);</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> graph3.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(2, 0);</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="keywordflow">try</span> {</div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <a class="code hl_function" href="../../d8/db9/topological__sort_8cpp.html#a54dc5d7914958dbd24dda2fd862dc41b">graph::topological_sort::topologicalSort</a>(graph3);</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> } <span class="keywordflow">catch</span> (std::invalid_argument&amp; err) {</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> assert(std::string(err.what()) == <span class="stringliteral">&quot;cycle detected in graph&quot;</span>);</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> }</div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test Passed\n&quot;</span>;</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span>}</div>
</div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span></div>
<div class="foldopen" id="foldopen00186" data-start="{" data-end="}">
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"><a class="line" href="../../d8/db9/topological__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 186</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/db9/topological__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <a class="code hl_function" href="../../d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self test implementations</span></div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span>}</div>
</div>
<div class="ttc" id="aclassgraph_1_1topological__sort_1_1_graph_html"><div class="ttname"><a href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">graph::topological_sort::Graph</a></div><div class="ttdoc">Class that represents a directed graph and provides methods for manipulating the graph.</div><div class="ttdef"><b>Definition</b> <a href="#l00038">topological_sort.cpp:38</a></div></div>
<div class="ttc" id="aclassgraph_1_1topological__sort_1_1_graph_html_a57036210706a45b9363563252393a345"><div class="ttname"><a href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">graph::topological_sort::Graph::addEdge</a></div><div class="ttdeci">void addEdge(int u, int v)</div><div class="ttdoc">Function that adds an edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition</b> <a href="#l00055">topological_sort.cpp:55</a></div></div>
<div class="ttc" id="aclassgraph_1_1topological__sort_1_1_graph_html_a5e84b175ef768ff58eaeededd43e8368"><div class="ttname"><a href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a5e84b175ef768ff58eaeededd43e8368">graph::topological_sort::Graph::getAdjacencyList</a></div><div class="ttdeci">const std::vector&lt; std::vector&lt; int &gt; &gt; &amp; getAdjacencyList() const</div><div class="ttdoc">Get the adjacency list of the graph.</div><div class="ttdef"><b>Definition</b> <a href="#l00061">topological_sort.cpp:61</a></div></div>
<div class="ttc" id="aclassgraph_1_1topological__sort_1_1_graph_html_a75a849f80a66304e7da39b3ccd6129d6"><div class="ttname"><a href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a75a849f80a66304e7da39b3ccd6129d6">graph::topological_sort::Graph::Graph</a></div><div class="ttdeci">Graph(int nodes)</div><div class="ttdoc">Constructor for the Graph class.</div><div class="ttdef"><b>Definition</b> <a href="#l00048">topological_sort.cpp:48</a></div></div>
<div class="ttc" id="aclassgraph_1_1topological__sort_1_1_graph_html_ad22018e4f4f80aecb0538044bb83d096"><div class="ttname"><a href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#ad22018e4f4f80aecb0538044bb83d096">graph::topological_sort::Graph::getNumNodes</a></div><div class="ttdeci">int getNumNodes() const</div><div class="ttdoc">Get the number of nodes in the graph.</div><div class="ttdef"><b>Definition</b> <a href="#l00069">topological_sort.cpp:69</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="anamespacetopological__sort_html"><div class="ttname"><a href="../../d8/d76/namespacetopological__sort.html">topological_sort</a></div><div class="ttdoc">Topological Sort Algorithm.</div></div>
<div class="ttc" id="atopological__sort_8cpp_html_a54dc5d7914958dbd24dda2fd862dc41b"><div class="ttname"><a href="../../d8/db9/topological__sort_8cpp.html#a54dc5d7914958dbd24dda2fd862dc41b">graph::topological_sort::topologicalSort</a></div><div class="ttdeci">std::vector&lt; int &gt; topologicalSort(const Graph &amp;g)</div><div class="ttdoc">Function to get the topological sort of the graph.</div><div class="ttdef"><b>Definition</b> <a href="#l00095">topological_sort.cpp:95</a></div></div>
<div class="ttc" id="atopological__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> <a href="#l00126">topological_sort.cpp:126</a></div></div>
<div class="ttc" id="atopological__sort_8cpp_html_abcbcaa2bb70af0a11d0c090ea1796aea"><div class="ttname"><a href="../../d8/db9/topological__sort_8cpp.html#abcbcaa2bb70af0a11d0c090ea1796aea">graph::topological_sort::dfs</a></div><div class="ttdeci">void dfs(int v, std::vector&lt; int &gt; &amp;visited, const std::vector&lt; std::vector&lt; int &gt; &gt; &amp;graph, std::stack&lt; int &gt; &amp;s)</div><div class="ttdoc">Function to perform Depth First Search on the graph.</div><div class="ttdef"><b>Definition</b> <a href="#l00079">topological_sort.cpp:79</a></div></div>
<div class="ttc" id="atopological__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/db9/topological__sort_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="#l00186">topological_sort.cpp:186</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a class="el" href="../../d8/db9/topological__sort_8cpp.html">topological_sort.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>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink