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

Documentation for af6e2c8991

Browse Source
This commit is contained in:
realstealthninja
2026-09-21 04:13:18 +00:00
parent fa852a6801
commit cc04e74d11
2789 changed files with 66741 additions and 46802 deletions
Download Patch File Download Diff File Expand all files Collapse all files

85
da/d4b/depth__first__search__with__stack_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.14.0"/>
<meta name="generator" content="Doxygen 1.18.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: graph/depth_first_search_with_stack.cpp File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -59,22 +59,47 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.14.0 -->
<!-- Generated by Doxygen 1.18.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
let searchBox = new SearchBox("searchBox", "../../search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
document.addEventListener('DOMContentLoaded', codefold.init);
</script>
<script type="application/json" id="doxygen-config">
{
"relPath": "../../",
"generateTreeView": true,
"searchEngine": true,
"serverBasedSearch": false,
"disableIndex": false,
"dynamicMenus": true,
"fullSidebar": false
}
</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 id="main-nav-mobile">
<div class="sm sm-dox"><input id="main-menu-state" type="checkbox"/>
<label class="main-menu-btn" for="main-menu-state">
<span class="main-menu-btn-icon"></span> Toggle main menu visibility</label>
<span id="searchBoxPos1"></span>
</div>
</div><!-- main-nav-mobile -->
<div id="main-nav">
<ul class="sm sm-dox" id="main-menu">
<li id="searchBoxPos2">
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<span id="MSearchSelect" class="search-icon"><span class="search-icon-dropdown"></span></span>
<input type="text" id="MSearchField" value="" placeholder="Search" accesskey="S"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><div id="MSearchCloseImg" class="close-icon"></div></a>
</span>
</div>
</li>
</ul>
</div><!-- main-nav -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
@@ -82,20 +107,16 @@ $(function() {
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
<div id="splitbar" class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(function(){initNavTree('da/d4b/depth__first__search__with__stack_8cpp.html','../../',''); });
document.addEventListener('DOMContentLoaded',() => { initNavTree('da/d4b/depth__first__search__with__stack_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 id="MSearchSelectWindow">
</div>
<!-- iframe showing the search results (closed by default) -->
@@ -134,29 +155,29 @@ Include dependency graph for depth_first_search_with_stack.cpp:</div>
<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:graph" id="r_graph"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></td></tr>
<tr class="memitem:graph" id="r_graph"><td class="memItemLeft">namespace &#160;</td><td class="memItemRight"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></td></tr>
<tr class="memdesc:df/dce/namespacegraph"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms. <br /></td></tr>
<tr class="memitem:depth_5Ffirst_5Fsearch" id="r_depth_5Ffirst_5Fsearch"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/da7/namespacedepth__first__search.html">depth_first_search</a></td></tr>
<tr class="memitem:depth_5Ffirst_5Fsearch" id="r_depth_5Ffirst_5Fsearch"><td class="memItemLeft">namespace &#160;</td><td class="memItemRight"><a class="el" href="../../d8/da7/namespacedepth__first__search.html">depth_first_search</a></td></tr>
<tr class="memdesc:d8/da7/namespacedepth__first__search"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Depth-first_search" target="_blank">Depth First Search</a> algorithm. <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:aadebe9c855821d6515ca5b171222ef7b" id="r_aadebe9c855821d6515ca5b171222ef7b"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a> (std::vector&lt; std::vector&lt; size_t &gt; &gt; *adj, size_t u, size_t v)</td></tr>
<tr class="memitem:aadebe9c855821d6515ca5b171222ef7b" id="r_aadebe9c855821d6515ca5b171222ef7b"><td class="memItemLeft">void&#160;</td><td class="memItemRight"><a class="el" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a> (std::vector&lt; std::vector&lt; size_t &gt; &gt; *adj, size_t u, size_t v)</td></tr>
<tr class="memdesc:aadebe9c855821d6515ca5b171222ef7b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Adds and edge between two vertices of graph say u and v in this case. <br /></td></tr>
<tr class="memitem:a5738da9f508f6a9e87f123c9fb6f2ea9" id="r_a5738da9f508f6a9e87f123c9fb6f2ea9"><td class="memItemLeft" align="right" valign="top">std::vector&lt; size_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5738da9f508f6a9e87f123c9fb6f2ea9">graph::depth_first_search::dfs</a> (const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;graph, size_t start)</td></tr>
<tr class="memitem:a5738da9f508f6a9e87f123c9fb6f2ea9" id="r_a5738da9f508f6a9e87f123c9fb6f2ea9"><td class="memItemLeft">std::vector&lt; size_t &gt;&#160;</td><td class="memItemRight"><a class="el" href="#a5738da9f508f6a9e87f123c9fb6f2ea9">graph::depth_first_search::dfs</a> (const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;graph, size_t start)</td></tr>
<tr class="memdesc:a5738da9f508f6a9e87f123c9fb6f2ea9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Explores the given vertex, exploring a vertex means traversing over all the vertices which are connected to the vertex that is currently being explored and push it onto the stack. <br /></td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft">static void&#160;</td><td class="memItemRight"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft">int&#160;</td><td class="memItemRight"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-var-members" class="groupheader"><a id="var-members" name="var-members"></a>
Variables</h2></td></tr>
<tr class="memitem:afb80b42b42381658a12a57a975ecd0c7" id="r_afb80b42b42381658a12a57a975ecd0c7"><td class="memItemLeft" align="right" valign="top">constexpr int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afb80b42b42381658a12a57a975ecd0c7">WHITE</a> = 0</td></tr>
<tr class="memitem:a43e30173f12330e85cce6239a277527e" id="r_a43e30173f12330e85cce6239a277527e"><td class="memItemLeft" align="right" valign="top">constexpr int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a43e30173f12330e85cce6239a277527e">GREY</a> = 1</td></tr>
<tr class="memitem:afb80b42b42381658a12a57a975ecd0c7" id="r_afb80b42b42381658a12a57a975ecd0c7"><td class="memItemLeft">constexpr int&#160;</td><td class="memItemRight"><a class="el" href="#afb80b42b42381658a12a57a975ecd0c7">WHITE</a> = 0</td></tr>
<tr class="memitem:a43e30173f12330e85cce6239a277527e" id="r_a43e30173f12330e85cce6239a277527e"><td class="memItemLeft">constexpr int&#160;</td><td class="memItemRight"><a class="el" href="#a43e30173f12330e85cce6239a277527e">GREY</a> = 1</td></tr>
<tr class="memdesc:a43e30173f12330e85cce6239a277527e"><td class="mdescLeft">&#160;</td><td class="mdescRight">indicates the node hasn't been explored <br /></td></tr>
<tr class="memitem:a7f1cd94cf4da32933e8551cb3577e18b" id="r_a7f1cd94cf4da32933e8551cb3577e18b"><td class="memItemLeft" align="right" valign="top">constexpr int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7f1cd94cf4da32933e8551cb3577e18b">BLACK</a> = 2</td></tr>
<tr class="memitem:a7f1cd94cf4da32933e8551cb3577e18b" id="r_a7f1cd94cf4da32933e8551cb3577e18b"><td class="memItemLeft">constexpr int&#160;</td><td class="memItemRight"><a class="el" href="#a7f1cd94cf4da32933e8551cb3577e18b">BLACK</a> = 2</td></tr>
<tr class="memdesc:a7f1cd94cf4da32933e8551cb3577e18b"><td class="mdescLeft">&#160;</td><td class="mdescRight">indicates node is in stack waiting to be explored <br /></td></tr>
<tr class="memitem:a330a2b0a904f01802ada1f8f3b28e76c" id="r_a330a2b0a904f01802ada1f8f3b28e76c"><td class="memItemLeft" align="right" valign="top">constexpr int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a330a2b0a904f01802ada1f8f3b28e76c">INF</a> = std::numeric_limits&lt;int16_t&gt;::max()</td></tr>
<tr class="memitem:a330a2b0a904f01802ada1f8f3b28e76c" id="r_a330a2b0a904f01802ada1f8f3b28e76c"><td class="memItemLeft">constexpr int64_t&#160;</td><td class="memItemRight"><a class="el" href="#a330a2b0a904f01802ada1f8f3b28e76c">INF</a> = std::numeric_limits&lt;int16_t&gt;::max()</td></tr>
<tr class="memdesc:a330a2b0a904f01802ada1f8f3b28e76c"><td class="mdescLeft">&#160;</td><td class="mdescRight">indicates node has already been explored <br /></td></tr>
</table>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
@@ -328,7 +349,7 @@ Variables</h2></td></tr>
<p class="definition">Definition at line <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00173">173</a> of file <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html">depth_first_search_with_stack.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 173</span> {</div>
<div class="line"><span class="lineno"> 174</span> <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// execute the tests</span></div>
<div class="line"><span class="lineno"> 174</span> <a class="code hl_namespace" href="../../d9/df4/namespacetests.html">tests</a>(); <span class="comment">// execute the tests</span></div>
<div class="line"><span class="lineno"> 175</span> </div>
<div class="line"><span class="lineno"> 176</span> <span class="keywordtype">size_t</span> vertices = 0, edges = 0, start_pos = 1;</div>
<div class="line"><span class="lineno"> 177</span> std::vector&lt;size_t&gt; traversal;</div>
@@ -358,9 +379,9 @@ Variables</h2></td></tr>
<div class="line"><span class="lineno"> 205</span> </div>
<div class="line"><span class="lineno"> 206</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 207</span>}</div>
<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition</b> <a href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00123">depth_first_search_with_stack.cpp:123</a></div></div>
<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a5738da9f508f6a9e87f123c9fb6f2ea9"><div class="ttname"><a href="#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="adepth__first__search__with__stack_8cpp_html_aadebe9c855821d6515ca5b171222ef7b"><div class="ttname"><a href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a></div><div class="ttdeci">void addEdge(std::vector&lt; std::vector&lt; size_t &gt; &gt; *adj, size_t u, size_t v)</div><div class="ttdoc">Adds and edge between two vertices of graph say u and v in this case.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00064">depth_first_search_with_stack.cpp:64</a></div></div>
<div class="ttc" id="anamespacetests_html"><div class="ttname"><a href="../../d9/df4/namespacetests.html">tests</a></div><div class="ttdoc">Testcases to check Union of Two Arrays.</div></div>
</div><!-- fragment -->
</div>
</div>
@@ -557,8 +578,8 @@ Variables</h2></td></tr>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a href="../../da/d4b/depth__first__search__with__stack_8cpp.html">depth_first_search_with_stack.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>
<li class="navelem"><b>graph</b></li><li class="navelem"><a href="../../da/d4b/depth__first__search__with__stack_8cpp.html">depth_first_search_with_stack.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.18.0 </li>
</ul>
</div>
</body>