mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 20:31:43 +08:00
506 lines
46 KiB
HTML
506 lines
46 KiB
HTML
<!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.12.0"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>Algorithms_in_C++: graph/depth_first_search_with_stack.cpp File Reference</title>
|
|
<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="../../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/x-mathjax-config">
|
|
MathJax.Hub.Config({
|
|
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
|
jax: ["input/TeX","output/HTML-CSS"],
|
|
});
|
|
</script>
|
|
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
|
<link href="../../doxygen.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="projectalign">
|
|
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
|
</div>
|
|
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.12.0 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&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&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&dn=expat.txt MIT */
|
|
$(function(){initNavTree('da/d4b/depth__first__search__with__stack_8cpp.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="summary">
|
|
<a href="#namespaces">Namespaces</a> |
|
|
<a href="#func-members">Functions</a> |
|
|
<a href="#var-members">Variables</a> </div>
|
|
<div class="headertitle"><div class="title">depth_first_search_with_stack.cpp File Reference</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
|
|
<p><a href="https://en.wikipedia.org/wiki/Depth-first_search" target="_blank">Depth First Search Algorithm using Stack (Depth First Search Algorithm)</a>
|
|
<a href="#details">More...</a></p>
|
|
<div class="textblock"><code>#include <iostream></code><br />
|
|
<code>#include <stack></code><br />
|
|
<code>#include <vector></code><br />
|
|
<code>#include <cassert></code><br />
|
|
<code>#include <limits></code><br />
|
|
</div><div class="textblock"><div class="dynheader">
|
|
Include dependency graph for depth_first_search_with_stack.cpp:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/dfe/depth__first__search__with__stack_8cpp__incl.svg" width="407" 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><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
|
Namespaces</h2></td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></td></tr>
|
|
<tr class="memdesc:df/dce/namespacegraph"><td class="mdescLeft"> </td><td class="mdescRight"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><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"> </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>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 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 </td><td class="memItemRight" valign="bottom"><a class="el" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< size_t > > *adj, size_t u, size_t v)</td></tr>
|
|
<tr class="memdesc:aadebe9c855821d6515ca5b171222ef7b"><td class="mdescLeft"> </td><td class="mdescRight">Adds and edge between two vertices of graph say u and v in this case. <br /></td></tr>
|
|
<tr class="separator:aadebe9c855821d6515ca5b171222ef7b"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a5738da9f508f6a9e87f123c9fb6f2ea9" id="r_a5738da9f508f6a9e87f123c9fb6f2ea9"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< size_t > </td><td class="memItemRight" valign="bottom"><a class="el" href="#a5738da9f508f6a9e87f123c9fb6f2ea9">graph::depth_first_search::dfs</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< size_t > > &graph, size_t start)</td></tr>
|
|
<tr class="memdesc:a5738da9f508f6a9e87f123c9fb6f2ea9"><td class="mdescLeft"> </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="separator:a5738da9f508f6a9e87f123c9fb6f2ea9"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
|
|
<tr class="separator:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memSeparator" colspan="2"> </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>
|
|
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 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 </td><td class="memItemRight" valign="bottom"><a class="el" href="#afb80b42b42381658a12a57a975ecd0c7">WHITE</a> = 0</td></tr>
|
|
<tr class="separator:afb80b42b42381658a12a57a975ecd0c7"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a43e30173f12330e85cce6239a277527e" id="r_a43e30173f12330e85cce6239a277527e"><td class="memItemLeft" align="right" valign="top"><a id="a43e30173f12330e85cce6239a277527e" name="a43e30173f12330e85cce6239a277527e"></a>
|
|
constexpr int </td><td class="memItemRight" valign="bottom"><b>GREY</b> = 1</td></tr>
|
|
<tr class="memdesc:a43e30173f12330e85cce6239a277527e"><td class="mdescLeft"> </td><td class="mdescRight">indicates the node hasn't been explored <br /></td></tr>
|
|
<tr class="separator:a43e30173f12330e85cce6239a277527e"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a7f1cd94cf4da32933e8551cb3577e18b" id="r_a7f1cd94cf4da32933e8551cb3577e18b"><td class="memItemLeft" align="right" valign="top"><a id="a7f1cd94cf4da32933e8551cb3577e18b" name="a7f1cd94cf4da32933e8551cb3577e18b"></a>
|
|
constexpr int </td><td class="memItemRight" valign="bottom"><b>BLACK</b> = 2</td></tr>
|
|
<tr class="memdesc:a7f1cd94cf4da32933e8551cb3577e18b"><td class="mdescLeft"> </td><td class="mdescRight">indicates node is in stack waiting to be explored <br /></td></tr>
|
|
<tr class="separator:a7f1cd94cf4da32933e8551cb3577e18b"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a330a2b0a904f01802ada1f8f3b28e76c" id="r_a330a2b0a904f01802ada1f8f3b28e76c"><td class="memItemLeft" align="right" valign="top"><a id="a330a2b0a904f01802ada1f8f3b28e76c" name="a330a2b0a904f01802ada1f8f3b28e76c"></a>
|
|
constexpr int64_t </td><td class="memItemRight" valign="bottom"><b>INF</b> = <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits</a><int16_t>::max()</td></tr>
|
|
<tr class="memdesc:a330a2b0a904f01802ada1f8f3b28e76c"><td class="mdescLeft"> </td><td class="mdescRight">indicates node has already been explored <br /></td></tr>
|
|
<tr class="separator:a330a2b0a904f01802ada1f8f3b28e76c"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table>
|
|
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
|
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Depth-first_search" target="_blank">Depth First Search Algorithm using Stack (Depth First Search Algorithm)</a> </p>
|
|
<dl class="section author"><dt>Author</dt><dd><a href="http://github.com/ayaankhan98" target="_blank">Ayaan Khan</a> </dd>
|
|
<dd>
|
|
<a href="https://github.com/sauravUppoor" target="_blank">Saurav Uppoor</a></dd></dl>
|
|
<p>Depth First Search also quoted as DFS is a <a class="el" href="../../da/d9a/class_graph.html">Graph</a> Traversal Algorithm. Time Complexity O(|V| + |E|) where V is number of vertices and E is number of edges in graph.</p>
|
|
<p>Application of Depth First Search are</p>
|
|
<ol type="1">
|
|
<li>Finding connected components</li>
|
|
<li>Finding 2-(edge or vertex)-connected components.</li>
|
|
<li>Finding 3-(edge or vertex)-connected components.</li>
|
|
<li>Finding the bridges of a graph.</li>
|
|
<li>Generating words in order to plot the limit set of a group.</li>
|
|
<li>Finding strongly connected components.</li>
|
|
</ol>
|
|
<h4>Working</h4>
|
|
<ol type="1">
|
|
<li>Mark all vertices as unvisited (colour it WHITE).</li>
|
|
<li>Push starting vertex into the stack and colour it GREY.</li>
|
|
<li>Once a node is popped out of the stack and is coloured GREY, we colour it BLACK.</li>
|
|
<li>Push all its neighbours which are not coloured BLACK.</li>
|
|
<li>Repeat steps 4 and 5 until the stack is empty. </li>
|
|
</ol>
|
|
</div><h2 class="groupheader">Function Documentation</h2>
|
|
<a id="aadebe9c855821d6515ca5b171222ef7b" name="aadebe9c855821d6515ca5b171222ef7b"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aadebe9c855821d6515ca5b171222ef7b">◆ </a></span>addEdge()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void graph::depth_first_search::addEdge </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< size_t > > *</td> <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>u</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>v</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Adds and edge between two vertices of graph say u and v in this case. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">adj</td><td>Adjacency list representation of graph </td></tr>
|
|
<tr><td class="paramname">u</td><td>first vertex </td></tr>
|
|
<tr><td class="paramname">v</td><td>second vertex </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 64</span> {</div>
|
|
<div class="line"><span class="lineno"> 65</span> <span class="comment">/*</span></div>
|
|
<div class="line"><span class="lineno"> 66</span><span class="comment"> *</span></div>
|
|
<div class="line"><span class="lineno"> 67</span><span class="comment"> * Here we are considering undirected graph that's the</span></div>
|
|
<div class="line"><span class="lineno"> 68</span><span class="comment"> * reason we are adding v to the adjacency list representation of u</span></div>
|
|
<div class="line"><span class="lineno"> 69</span><span class="comment"> * and also adding u to the adjacency list representation of v</span></div>
|
|
<div class="line"><span class="lineno"> 70</span><span class="comment"> *</span></div>
|
|
<div class="line"><span class="lineno"> 71</span><span class="comment"> */</span></div>
|
|
<div class="line"><span class="lineno"> 72</span> (*adj)[u - 1].push_back(v - 1);</div>
|
|
<div class="line"><span class="lineno"> 73</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a5738da9f508f6a9e87f123c9fb6f2ea9" name="a5738da9f508f6a9e87f123c9fb6f2ea9"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a5738da9f508f6a9e87f123c9fb6f2ea9">◆ </a></span>dfs()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< size_t > graph::depth_first_search::dfs </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< size_t > > &</td> <td class="paramname"><span class="paramname"><em>graph</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>start</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>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. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">adj</td><td>graph </td></tr>
|
|
<tr><td class="paramname">start</td><td>starting vertex for DFS </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>vector with nodes stored in the order of DFS traversal </dd></dl>
|
|
<p>checked[i] stores the status of each node</p>
|
|
<p>while stack is not empty we keep exploring the node on top of stack</p>
|
|
<p>push the node to the final result vector</p>
|
|
<p>exploring the neighbours of the current node</p>
|
|
<p><a class="el" href="../../db/d8b/struct_node.html">Node</a> has been explored</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 87</span> {<span class="comment"></span></div>
|
|
<div class="line"><span class="lineno"> 88</span><span class="comment"> /// checked[i] stores the status of each node</span></div>
|
|
<div class="line"><span class="lineno"> 89</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<size_t></a> checked(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size(), <a class="code hl_variable" href="#afb80b42b42381658a12a57a975ecd0c7">WHITE</a>), traversed_path;</div>
|
|
<div class="line"><span class="lineno"> 90</span> </div>
|
|
<div class="line"><span class="lineno"> 91</span> checked[start] = <a class="code hl_variable" href="#a43e30173f12330e85cce6239a277527e">GREY</a>;</div>
|
|
<div class="line"><span class="lineno"> 92</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack<size_t></a> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>;</div>
|
|
<div class="line"><span class="lineno"> 93</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(start);</div>
|
|
<div class="line"><span class="lineno"> 94</span><span class="comment"></span> </div>
|
|
<div class="line"><span class="lineno"> 95</span><span class="comment"> /// while stack is not empty we keep exploring the node on top of stack</span></div>
|
|
<div class="line"><span class="lineno"> 96</span><span class="comment"></span> <span class="keywordflow">while</span> (!<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.empty()) {</div>
|
|
<div class="line"><span class="lineno"> 97</span> <span class="keywordtype">int</span> act = <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">top</a>();</div>
|
|
<div class="line"><span class="lineno"> 98</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>();</div>
|
|
<div class="line"><span class="lineno"> 99</span> </div>
|
|
<div class="line"><span class="lineno"> 100</span> <span class="keywordflow">if</span> (checked[act] == <a class="code hl_variable" href="#a43e30173f12330e85cce6239a277527e">GREY</a>) {<span class="comment"></span></div>
|
|
<div class="line"><span class="lineno"> 101</span><span class="comment"> /// push the node to the final result vector</span></div>
|
|
<div class="line"><span class="lineno"> 102</span><span class="comment"></span> traversed_path.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(act + 1);</div>
|
|
<div class="line"><span class="lineno"> 103</span><span class="comment"></span> </div>
|
|
<div class="line"><span class="lineno"> 104</span><span class="comment"> /// exploring the neighbours of the current node</span></div>
|
|
<div class="line"><span class="lineno"> 105</span><span class="comment"></span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> it : <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[act]) {</div>
|
|
<div class="line"><span class="lineno"> 106</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(it);</div>
|
|
<div class="line"><span class="lineno"> 107</span> <span class="keywordflow">if</span> (checked[it] != <a class="code hl_variable" href="#a7f1cd94cf4da32933e8551cb3577e18b">BLACK</a>) {</div>
|
|
<div class="line"><span class="lineno"> 108</span> checked[it] = <a class="code hl_variable" href="#a43e30173f12330e85cce6239a277527e">GREY</a>;</div>
|
|
<div class="line"><span class="lineno"> 109</span> }</div>
|
|
<div class="line"><span class="lineno"> 110</span> }</div>
|
|
<div class="line"><span class="lineno"> 111</span> checked[act] = <a class="code hl_variable" href="#a7f1cd94cf4da32933e8551cb3577e18b">BLACK</a>; <span class="comment">/// Node has been explored</span></div>
|
|
<div class="line"><span class="lineno"> 112</span> }</div>
|
|
<div class="line"><span class="lineno"> 113</span> }</div>
|
|
<div class="line"><span class="lineno"> 114</span> <span class="keywordflow">return</span> traversed_path;</div>
|
|
<div class="line"><span class="lineno"> 115</span>}</div>
|
|
<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> stack.hpp:19</div></div>
|
|
<div class="ttc" id="aclassstack_html_a3647fb4418890f19e0dc414b8092b8b0"><div class="ttname"><a href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition</b> stack.hpp:62</div></div>
|
|
<div class="ttc" id="aclassstack_html_a90df277532c23519aa7ac3c08ed90a1d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack::push</a></div><div class="ttdeci">void push(const value_type &item)</div><div class="ttdef"><b>Definition</b> stack.hpp:47</div></div>
|
|
<div class="ttc" id="aclassstack_html_ae09630c4384903d187801921b2ddc709"><div class="ttname"><a href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack::top</a></div><div class="ttdeci">value_type top() const</div><div class="ttdef"><b>Definition</b> stack.hpp:56</div></div>
|
|
<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a43e30173f12330e85cce6239a277527e"><div class="ttname"><a href="#a43e30173f12330e85cce6239a277527e">GREY</a></div><div class="ttdeci">constexpr int GREY</div><div class="ttdoc">indicates the node hasn't been explored</div><div class="ttdef"><b>Definition</b> depth_first_search_with_stack.cpp:39</div></div>
|
|
<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a7f1cd94cf4da32933e8551cb3577e18b"><div class="ttname"><a href="#a7f1cd94cf4da32933e8551cb3577e18b">BLACK</a></div><div class="ttdeci">constexpr int BLACK</div><div class="ttdoc">indicates node is in stack waiting to be explored</div><div class="ttdef"><b>Definition</b> depth_first_search_with_stack.cpp:40</div></div>
|
|
<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_afb80b42b42381658a12a57a975ecd0c7"><div class="ttname"><a href="#afb80b42b42381658a12a57a975ecd0c7">WHITE</a></div><div class="ttdeci">constexpr int WHITE</div><div class="ttdef"><b>Definition</b> depth_first_search_with_stack.cpp:38</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="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
|
|
<div class="ttc" id="astack_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a></div></div>
|
|
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
|
|
</div><!-- fragment --><div class="dynheader">
|
|
Here is the call graph for this function:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d4b/depth__first__search__with__stack_8cpp_a5738da9f508f6a9e87f123c9fb6f2ea9_cgraph.svg" width="510" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
|
</div>
|
|
|
|
</div>
|
|
</div>
|
|
<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>creating a graph</p>
|
|
<p>taking input for the edges</p>
|
|
<p>taking input for the starting position</p>
|
|
<p>Printing the order of traversal</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"> 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> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<size_t></a> traversal;</div>
|
|
<div class="line"><span class="lineno"> 178</span> </div>
|
|
<div class="line"><span class="lineno"> 179</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Enter the Vertices : "</span>;</div>
|
|
<div class="line"><span class="lineno"> 180</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> vertices;</div>
|
|
<div class="line"><span class="lineno"> 181</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Enter the Edges : "</span>;</div>
|
|
<div class="line"><span class="lineno"> 182</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> edges;</div>
|
|
<div class="line"><span class="lineno"> 183</span><span class="comment"></span> </div>
|
|
<div class="line"><span class="lineno"> 184</span><span class="comment"> /// creating a graph</span></div>
|
|
<div class="line"><span class="lineno"> 185</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<size_t></a> > adj(vertices, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<size_t></a>());</div>
|
|
<div class="line"><span class="lineno"> 186</span><span class="comment"></span> </div>
|
|
<div class="line"><span class="lineno"> 187</span><span class="comment"> /// taking input for the edges</span></div>
|
|
<div class="line"><span class="lineno"> 188</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Enter the vertices which have edges between them : "</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><span class="lineno"> 189</span> <span class="keywordflow">while</span> (edges--) {</div>
|
|
<div class="line"><span class="lineno"> 190</span> <span class="keywordtype">size_t</span> u = 0, v = 0;</div>
|
|
<div class="line"><span class="lineno"> 191</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> u >> v;</div>
|
|
<div class="line"><span class="lineno"> 192</span> <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&adj, u, v);</div>
|
|
<div class="line"><span class="lineno"> 193</span> }</div>
|
|
<div class="line"><span class="lineno"> 194</span><span class="comment"></span> </div>
|
|
<div class="line"><span class="lineno"> 195</span><span class="comment"> /// taking input for the starting position</span></div>
|
|
<div class="line"><span class="lineno"> 196</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Enter the starting vertex [1,n]: "</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><span class="lineno"> 197</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> start_pos;</div>
|
|
<div class="line"><span class="lineno"> 198</span> start_pos -= 1;</div>
|
|
<div class="line"><span class="lineno"> 199</span> traversal = <a class="code hl_function" href="#a5738da9f508f6a9e87f123c9fb6f2ea9">graph::depth_first_search::dfs</a>(adj, start_pos);</div>
|
|
<div class="line"><span class="lineno"> 200</span><span class="comment"></span> </div>
|
|
<div class="line"><span class="lineno"> 201</span><span class="comment"> /// Printing the order of traversal</span></div>
|
|
<div class="line"><span class="lineno"> 202</span><span class="comment"></span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> x : traversal) {</div>
|
|
<div class="line"><span class="lineno"> 203</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << x << <span class="charliteral">' '</span>;</div>
|
|
<div class="line"><span class="lineno"> 204</span> }</div>
|
|
<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="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
|
|
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></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> depth_first_search_with_stack.cpp:123</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< size_t > dfs(const std::vector< std::vector< size_t > > &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> depth_first_search_with_stack.cpp:87</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< std::vector< size_t > > *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> depth_first_search_with_stack.cpp:64</div></div>
|
|
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
|
|
</div><!-- fragment --><div class="dynheader">
|
|
Here is the call graph for this function:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d4b/depth__first__search__with__stack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="278" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
|
</div>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">◆ </a></span>tests()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">static void tests </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</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Self-test implementations </p><dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
|
|
<p>Test 1</p>
|
|
<p>for the above sample data, this is the expected output</p>
|
|
<p>Test 2</p>
|
|
<p>for the above sample data, this is the expected output</p>
|
|
<p>Test 3</p>
|
|
<p>for the above sample data, this is the expected output</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 123</span> {</div>
|
|
<div class="line"><span class="lineno"> 124</span> <span class="keywordtype">size_t</span> start_pos;</div>
|
|
<div class="line"><span class="lineno"> 125</span><span class="comment"></span> </div>
|
|
<div class="line"><span class="lineno"> 126</span><span class="comment"> /// Test 1</span></div>
|
|
<div class="line"><span class="lineno"> 127</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Case 1: "</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><span class="lineno"> 128</span> start_pos = 1;</div>
|
|
<div class="line"><span class="lineno"> 129</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<size_t></a> > g1(3, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<size_t></a>());</div>
|
|
<div class="line"><span class="lineno"> 130</span> </div>
|
|
<div class="line"><span class="lineno"> 131</span> <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&g1, 1, 2);</div>
|
|
<div class="line"><span class="lineno"> 132</span> <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&g1, 2, 3);</div>
|
|
<div class="line"><span class="lineno"> 133</span> <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&g1, 3, 1);</div>
|
|
<div class="line"><span class="lineno"> 134</span> </div>
|
|
<div class="line"><span class="lineno"> 135</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<size_t></a> expected1 {1, 2, 3}; <span class="comment">/// for the above sample data, this is the expected output</span></div>
|
|
<div class="line"><span class="lineno"> 136</span> assert(graph::depth_first_search::dfs(g1, start_pos - 1) == expected1);</div>
|
|
<div class="line"><span class="lineno"> 137</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><span class="lineno"> 138</span><span class="comment"></span> </div>
|
|
<div class="line"><span class="lineno"> 139</span><span class="comment"> /// Test 2</span></div>
|
|
<div class="line"><span class="lineno"> 140</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Case 2: "</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><span class="lineno"> 141</span> start_pos = 1;</div>
|
|
<div class="line"><span class="lineno"> 142</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<size_t></a> > g2(4, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<size_t></a>());</div>
|
|
<div class="line"><span class="lineno"> 143</span> </div>
|
|
<div class="line"><span class="lineno"> 144</span> <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&g2, 1, 2);</div>
|
|
<div class="line"><span class="lineno"> 145</span> <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&g2, 1, 3);</div>
|
|
<div class="line"><span class="lineno"> 146</span> <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&g2, 2, 4);</div>
|
|
<div class="line"><span class="lineno"> 147</span> <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&g2, 4, 1);</div>
|
|
<div class="line"><span class="lineno"> 148</span> </div>
|
|
<div class="line"><span class="lineno"> 149</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<size_t></a> expected2 {1, 3, 2, 4}; <span class="comment">/// for the above sample data, this is the expected output</span></div>
|
|
<div class="line"><span class="lineno"> 150</span> assert(graph::depth_first_search::dfs(g2, start_pos - 1) == expected2);</div>
|
|
<div class="line"><span class="lineno"> 151</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><span class="lineno"> 152</span><span class="comment"></span> </div>
|
|
<div class="line"><span class="lineno"> 153</span><span class="comment"> /// Test 3</span></div>
|
|
<div class="line"><span class="lineno"> 154</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Case 3: "</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><span class="lineno"> 155</span> start_pos = 2;</div>
|
|
<div class="line"><span class="lineno"> 156</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<size_t></a> > g3(4, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<size_t></a>());</div>
|
|
<div class="line"><span class="lineno"> 157</span> </div>
|
|
<div class="line"><span class="lineno"> 158</span> <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&g3, 1, 2);</div>
|
|
<div class="line"><span class="lineno"> 159</span> <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&g3, 1, 3);</div>
|
|
<div class="line"><span class="lineno"> 160</span> <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&g3, 2, 4);</div>
|
|
<div class="line"><span class="lineno"> 161</span> <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&g3, 4, 1);</div>
|
|
<div class="line"><span class="lineno"> 162</span> </div>
|
|
<div class="line"><span class="lineno"> 163</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<size_t></a> expected3 {2, 4, 1, 3}; <span class="comment">/// for the above sample data, this is the expected output</span></div>
|
|
<div class="line"><span class="lineno"> 164</span> assert(graph::depth_first_search::dfs(g3, start_pos - 1) == expected3);</div>
|
|
<div class="line"><span class="lineno"> 165</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Passed"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><span class="lineno"> 166</span> </div>
|
|
<div class="line"><span class="lineno"> 167</span>}</div>
|
|
</div><!-- fragment --><div class="dynheader">
|
|
Here is the call graph for this function:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d4b/depth__first__search__with__stack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
|
</div>
|
|
|
|
</div>
|
|
</div>
|
|
<h2 class="groupheader">Variable Documentation</h2>
|
|
<a id="afb80b42b42381658a12a57a975ecd0c7" name="afb80b42b42381658a12a57a975ecd0c7"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#afb80b42b42381658a12a57a975ecd0c7">◆ </a></span>WHITE</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int WHITE = 0</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">constexpr</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>for IO operations header for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a> header for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> header for preprocessor macro assert() header for limits of integral types </p>
|
|
|
|
</div>
|
|
</div>
|
|
</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="../../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.12.0 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|