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

Documentation for c26eea874d

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

19
d8/db9/topological__sort_8cpp.html
View File

@@ -4,7 +4,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="generator" content="Doxygen 1.13.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: graph/topological_sort.cpp File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -60,7 +60,7 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.12.0 -->
<!-- Generated by Doxygen 1.13.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -227,13 +227,13 @@ Functions</h2></td></tr>
<div class="line"><span class="lineno"> 81</span> visited[v] = 1;</div>
<div class="line"><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"><span class="lineno"> 83</span> <span class="keywordflow">if</span> (!visited[neighbour]) {</div>
<div class="line"><span class="lineno"> 84</span> <a class="code hl_function" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9">dfs</a>(neighbour, visited, <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, s);</div>
<div class="line"><span class="lineno"> 84</span> <a class="code hl_function" href="#abcbcaa2bb70af0a11d0c090ea1796aea">dfs</a>(neighbour, visited, <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, s);</div>
<div class="line"><span class="lineno"> 85</span> }</div>
<div class="line"><span class="lineno"> 86</span> }</div>
<div class="line"><span class="lineno"> 87</span> s.push(v);</div>
<div class="line"><span class="lineno"> 88</span>}</div>
<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a5738da9f508f6a9e87f123c9fb6f2ea9"><div class="ttname"><a href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9">graph::depth_first_search::dfs</a></div><div class="ttdeci">std::vector&lt; size_t &gt; dfs(const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;graph, size_t start)</div><div class="ttdoc">Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec...</div><div class="ttdef"><b>Definition</b> <a href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00087">depth_first_search_with_stack.cpp:87</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="atopological__sort_8cpp_html_abcbcaa2bb70af0a11d0c090ea1796aea"><div class="ttname"><a href="#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="../../d8/db9/topological__sort_8cpp_source.html#l00079">topological_sort.cpp:79</a></div></div>
</div><!-- fragment -->
</div>
</div>
@@ -282,7 +282,7 @@ Functions</h2></td></tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
@@ -377,14 +377,14 @@ Functions</h2></td></tr>
<p class="definition">Definition at line <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html#l00095">95</a> of file <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html">topological_sort.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 95</span> {</div>
<div class="line"><span class="lineno"> 96</span> <span class="keywordtype">int</span> n = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.getNumNodes();</div>
<div class="line"><span class="lineno"> 97</span> <span class="keyword">const</span> <span class="keyword">auto</span>&amp; adj = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.getAdjacencyList();</div>
<div class="line"><span class="lineno"> 96</span> <span class="keywordtype">int</span> n = g.getNumNodes();</div>
<div class="line"><span class="lineno"> 97</span> <span class="keyword">const</span> <span class="keyword">auto</span>&amp; adj = g.getAdjacencyList();</div>
<div class="line"><span class="lineno"> 98</span> std::vector&lt;int&gt; visited(n, 0);</div>
<div class="line"><span class="lineno"> 99</span> std::stack&lt;int&gt; s;</div>
<div class="line"><span class="lineno"> 100</span> </div>
<div class="line"><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"><span class="lineno"> 102</span> <span class="keywordflow">if</span> (!visited[i]) {</div>
<div class="line"><span class="lineno"> 103</span> <a class="code hl_function" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9">dfs</a>(i, visited, adj, s);</div>
<div class="line"><span class="lineno"> 103</span> <a class="code hl_function" href="#abcbcaa2bb70af0a11d0c090ea1796aea">dfs</a>(i, visited, adj, s);</div>
<div class="line"><span class="lineno"> 104</span> }</div>
<div class="line"><span class="lineno"> 105</span> }</div>
<div class="line"><span class="lineno"> 106</span> </div>
@@ -400,7 +400,6 @@ Functions</h2></td></tr>
<div class="line"><span class="lineno"> 116</span> }</div>
<div class="line"><span class="lineno"> 117</span> <span class="keywordflow">return</span> ans;</div>
<div class="line"><span class="lineno"> 118</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00115">composite_simpson_rule.cpp:115</a></div></div>
</div><!-- fragment -->
</div>
</div>
@@ -410,7 +409,7 @@ Functions</h2></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_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.12.0 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.13.2 </li>
</ul>
</div>
</body>