mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 12:23:13 +08:00
379 lines
48 KiB
HTML
379 lines
48 KiB
HTML
<!-- HTML header for doxygen 1.12.0-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
|
<meta name="generator" content="Doxygen 1.14.0"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>TheAlgorithms/C++: graph/cycle_check_directed_graph.cpp Source File</title>
|
|
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
|
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../jquery.js"></script>
|
|
<script type="text/javascript" src="../../dynsections.js"></script>
|
|
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
|
<script type="text/javascript">
|
|
DoxygenAwesomeDarkModeToggle.init()
|
|
</script>
|
|
<script type="text/javascript" src="../../clipboard.js"></script>
|
|
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../navtreedata.js"></script>
|
|
<script type="text/javascript" src="../../navtree.js"></script>
|
|
<script type="text/javascript" src="../../cookie.js"></script>
|
|
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
|
<script type="text/javascript" src="../../search/search.js"></script>
|
|
<script type="text/javascript">
|
|
window.MathJax = {
|
|
options: {
|
|
ignoreHtmlClass: 'tex2jax_ignore',
|
|
processHtmlClass: 'tex2jax_process'
|
|
},
|
|
loader: {
|
|
load: ['[tex]/ams']
|
|
},
|
|
tex: {
|
|
macros: {},
|
|
packages: ['base','configmacros','ams']
|
|
}
|
|
};
|
|
</script>
|
|
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
|
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr id="projectrow">
|
|
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
|
<td id="projectalign">
|
|
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
|
</div>
|
|
<div id="projectbrief">All the algorithms implemented in C++</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.14.0 -->
|
|
<script type="text/javascript">
|
|
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
|
</script>
|
|
<script type="text/javascript">
|
|
$(function() { codefold.init(); });
|
|
</script>
|
|
<script type="text/javascript" src="../../menudata.js"></script>
|
|
<script type="text/javascript" src="../../menu.js"></script>
|
|
<script type="text/javascript">
|
|
$(function() {
|
|
initMenu('../../',true,false,'search.php','Search',true);
|
|
$(function() { init_search(); });
|
|
});
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
$(function(){initNavTree('d3/dec/cycle__check__directed__graph_8cpp_source.html','../../',''); });
|
|
</script>
|
|
<div id="container">
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<div id="MSearchResults">
|
|
<div class="SRPage">
|
|
<div id="SRIndex">
|
|
<div id="SRResults"></div>
|
|
<div class="SRStatus" id="Loading">Loading...</div>
|
|
<div class="SRStatus" id="Searching">Searching...</div>
|
|
<div class="SRStatus" id="NoMatches">No Matches</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">cycle_check_directed_graph.cpp</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span> </div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="preprocessor">#include <iostream></span> <span class="comment">// for std::cout</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="preprocessor">#include <map></span> <span class="comment">// for std::map</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span><span class="preprocessor">#include <queue></span> <span class="comment">// for std::queue</span></div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include <stdexcept></span> <span class="comment">// for throwing errors</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#include <type_traits></span> <span class="comment">// for std::remove_reference</span></div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <utility></span> <span class="comment">// for std::move</span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <vector></span> <span class="comment">// for std::vector</span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="keyword">struct </span><a class="code hl_struct" href="../../d7/d77/class_edge.html">Edge</a> {</div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> src;</div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> dest;</div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span> </div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> Edge() = <span class="keyword">delete</span>;</div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> ~Edge() = <span class="keywordflow">default</span>;</div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> Edge(Edge&&) = <span class="keywordflow">default</span>;</div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> Edge& operator=(Edge&&) = <span class="keywordflow">default</span>;</div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> Edge(Edge <span class="keyword">const</span>&) = <span class="keywordflow">default</span>;</div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> Edge& operator=(Edge <span class="keyword">const</span>&) = <span class="keywordflow">default</span>;</div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span></div>
|
|
<div class="foldopen" id="foldopen00041" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980"> 41</a></span> <a class="code hl_function" href="../../d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980">Edge</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> source, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> destination)</div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> : src(source), dest(destination) {}</div>
|
|
</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span>};</div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> </div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span><span class="keyword">using </span>AdjList = std::map<unsigned int, std::vector<unsigned int>>;</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span></div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span><span class="keyword">class </span><a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> {</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> Graph() : m_adjList({}) {}</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> ~Graph() = <span class="keywordflow">default</span>;</div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> Graph(Graph&&) = <span class="keywordflow">default</span>;</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> Graph& operator=(Graph&&) = <span class="keywordflow">default</span>;</div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> Graph(Graph <span class="keyword">const</span>&) = <span class="keywordflow">default</span>;</div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> Graph& operator=(Graph <span class="keyword">const</span>&) = <span class="keywordflow">default</span>;</div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span></div>
|
|
<div class="foldopen" id="foldopen00069" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d"> 69</a></span> <a class="code hl_function" href="../../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d">Graph</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> vertices, AdjList adjList)</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> : m_vertices(vertices), m_adjList(std::move(adjList)) {}</div>
|
|
</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span></div>
|
|
<div class="foldopen" id="foldopen00077" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3"> 77</a></span> <a class="code hl_function" href="../../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3">Graph</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> vertices, AdjList&& adjList)</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> : m_vertices(vertices), m_adjList(std::move(adjList)) {}</div>
|
|
</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span></div>
|
|
<div class="foldopen" id="foldopen00089" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"><a class="line" href="../../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1"> 89</a></span> <a class="code hl_function" href="../../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1">Graph</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> vertices, std::vector<Edge> <span class="keyword">const</span>& edges)</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> : m_vertices(vertices) {</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span>& edge : edges) {</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keywordflow">if</span> (edge.src >= vertices || edge.dest >= vertices) {</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keywordflow">throw</span> std::range_error(</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="stringliteral">"Either src or dest of edge out of range"</span>);</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> }</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> m_adjList[edge.src].emplace_back(edge.dest);</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> }</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span></div>
|
|
<div class="foldopen" id="foldopen00104" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="../../da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d"> 104</a></span> std::remove_reference<AdjList>::type <span class="keyword">const</span>& <a class="code hl_function" href="../../da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d">getAdjList</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="keywordflow">return</span> m_adjList;</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span></div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"><a class="line" href="../../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1"> 111</a></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1">getVertices</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> m_vertices; }</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span></div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="../../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413"> 119</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413">addVertices</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> num = 1) { m_vertices += num; }</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span></div>
|
|
<div class="foldopen" id="foldopen00125" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"><a class="line" href="../../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5"> 125</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5">addEdge</a>(<a class="code hl_struct" href="../../d7/d77/class_edge.html">Edge</a> <span class="keyword">const</span>& edge) {</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keywordflow">if</span> (edge.src >= m_vertices || edge.dest >= m_vertices) {</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="keywordflow">throw</span> std::range_error(<span class="stringliteral">"Either src or dest of edge out of range"</span>);</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> }</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> m_adjList[edge.src].emplace_back(edge.dest);</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span></div>
|
|
<div class="foldopen" id="foldopen00137" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"><a class="line" href="../../da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910"> 137</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910">addEdge</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> source, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> destination) {</div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="keywordflow">if</span> (source >= m_vertices || destination >= m_vertices) {</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="keywordflow">throw</span> std::range_error(</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="stringliteral">"Either source or destination of edge out of range"</span>);</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> }</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> m_adjList[source].emplace_back(destination);</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> </div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> m_vertices = 0;</div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> AdjList m_adjList;</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span>};</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span></div>
|
|
<div class="foldopen" id="foldopen00159" data-start="{" data-end="};">
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"><a class="line" href="../../d3/dbb/class_cycle_check.html"> 159</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d3/dbb/class_cycle_check.html">CycleCheck</a> {</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="keyword">enum</span> nodeStates : uint8_t { not_visited = 0, in_stack, visited };</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span></div>
|
|
<div class="foldopen" id="foldopen00171" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"><a class="line" href="../../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b"> 171</a></span> <span class="keyword">static</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b">isCyclicDFSHelper</a>(AdjList <span class="keyword">const</span>& adjList,</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> std::vector<nodeStates>* state,</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="comment">// Add node "in_stack" state.</span></div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> (*state)[<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>] = in_stack;</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> </div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="comment">// If the node has children, then recursively visit all children of the</span></div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="comment">// node.</span></div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="keyword">auto</span> <span class="keyword">const</span> it = adjList.find(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="keywordflow">if</span> (it != adjList.end()) {</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> child : it->second) {</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="comment">// If state of child node is "not_visited", evaluate that child</span></div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="comment">// for presence of cycle.</span></div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <span class="keyword">auto</span> state_of_child = (*state)[child];</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="keywordflow">if</span> (state_of_child == not_visited) {</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b">isCyclicDFSHelper</a>(adjList, state, child)) {</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> }</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (state_of_child == in_stack) {</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="comment">// If child node was "in_stack", then that means that there</span></div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="comment">// is a cycle in the graph. Return true for presence of the</span></div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <span class="comment">// cycle.</span></div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> }</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> }</div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> }</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> </div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <span class="comment">// Current node has been evaluated for the presence of cycle and had no</span></div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <span class="comment">// cycle. Mark current node as "visited".</span></div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> (*state)[<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>] = visited;</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <span class="comment">// Return that current node didn't result in any cycles.</span></div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> </div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <span class="keyword">public</span>:</div>
|
|
<div class="foldopen" id="foldopen00213" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"><a class="line" href="../../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474"> 213</a></span> <span class="keyword">static</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474">isCyclicDFS</a>(<a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> <span class="keyword">const</span>& <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>) {</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="keyword">auto</span> vertices = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.getVertices();</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span></div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> std::vector<nodeStates> state(vertices, not_visited);</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> </div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <span class="comment">// Start visiting each node.</span></div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = 0; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> < vertices; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>++) {</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <span class="comment">// If a node is not visited, only then check for presence of cycle.</span></div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> <span class="comment">// There is no need to check for presence of cycle for a visited</span></div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <span class="comment">// node as it has already been checked for presence of cycle.</span></div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="keywordflow">if</span> (state[<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>] == not_visited) {</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> <span class="comment">// Check for cycle.</span></div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b">isCyclicDFSHelper</a>(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.getAdjList(), &state, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>)) {</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> }</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> }</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> }</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> </div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> <span class="comment">// All nodes have been safely traversed, that means there is no cycle in</span></div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <span class="comment">// the graph. Return false.</span></div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span></div>
|
|
<div class="foldopen" id="foldopen00250" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"><a class="line" href="../../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5"> 250</a></span> <span class="keyword">static</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5">isCyclicBFS</a>(<a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> <span class="keyword">const</span>& <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>) {</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="keyword">auto</span> graphAjdList = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.getAdjList();</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> <span class="keyword">auto</span> vertices = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.getVertices();</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> </div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> std::vector<unsigned int> indegree(vertices, 0);</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> <span class="comment">// Calculate the indegree i.e. the number of incident edges to the node.</span></div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span>& <a class="code hl_struct" href="../../d8/d10/structlist.html">list</a> : graphAjdList) {</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <span class="keyword">auto</span> children = <a class="code hl_struct" href="../../d8/d10/structlist.html">list</a>.second;</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span>& child : children) {</div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> indegree[child]++;</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> }</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> }</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> </div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> std::queue<unsigned int> can_be_solved;</div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = 0; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> < vertices; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>++) {</div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <span class="comment">// If a node doesn't have any input edges, then that node will</span></div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> <span class="comment">// definately not result in a cycle and can be visited safely.</span></div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <span class="keywordflow">if</span> (!indegree[<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>]) {</div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> can_be_solved.emplace(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> }</div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> }</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> </div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <span class="comment">// Vertices that need to be traversed.</span></div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> <span class="keyword">auto</span> remain = vertices;</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> <span class="comment">// While there are safe nodes that we can visit.</span></div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <span class="keywordflow">while</span> (!can_be_solved.empty()) {</div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> <span class="keyword">auto</span> solved = can_be_solved.front();</div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> <span class="comment">// Visit the node.</span></div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> can_be_solved.pop();</div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> <span class="comment">// Decrease number of nodes that need to be traversed.</span></div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> remain--;</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> </div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> <span class="comment">// Visit all the children of the visited node.</span></div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> <span class="keyword">auto</span> it = graphAjdList.find(solved);</div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> <span class="keywordflow">if</span> (it != graphAjdList.end()) {</div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> child : it->second) {</div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <span class="comment">// Check if we can visited the node safely.</span></div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="keywordflow">if</span> (--indegree[child] == 0) {</div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <span class="comment">// if node can be visited safely, then add that node to</span></div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> <span class="comment">// the visit queue.</span></div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> can_be_solved.emplace(child);</div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> }</div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> }</div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> }</div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> }</div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> </div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> <span class="comment">// If there are still nodes that we can't visit, then it means that</span></div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> <span class="comment">// there is a cycle and return true, else return false.</span></div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> <span class="keywordflow">return</span> !(remain == 0);</div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span>};</div>
|
|
</div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span></div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> <span class="comment">// Instantiate the graph.</span></div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> <a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>(7, std::vector<Edge>{{0, 1}, {1, 2}, {2, 0}, {2, 5}, {3, 5}});</div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> <span class="comment">// Check for cycle using BFS method.</span></div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> std::cout << <a class="code hl_function" href="../../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5">CycleCheck::isCyclicBFS</a>(g) << <span class="charliteral">'\n'</span>;</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> </div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> <span class="comment">// Check for cycle using DFS method.</span></div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> std::cout << <a class="code hl_function" href="../../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474">CycleCheck::isCyclicDFS</a>(g) << <span class="charliteral">'\n'</span>;</div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span>}</div>
|
|
<div class="ttc" id="aclass_cycle_check_html"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html">CycleCheck</a></div><div class="ttdef"><b>Definition</b> <a href="#l00159">cycle_check_directed_graph.cpp:159</a></div></div>
|
|
<div class="ttc" id="aclass_cycle_check_html_a2f4485c08b45e7a21a2e86f9c3f01d8b"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b">CycleCheck::isCyclicDFSHelper</a></div><div class="ttdeci">static bool isCyclicDFSHelper(AdjList const &adjList, std::vector< nodeStates > *state, unsigned int node)</div><div class="ttdef"><b>Definition</b> <a href="#l00171">cycle_check_directed_graph.cpp:171</a></div></div>
|
|
<div class="ttc" id="aclass_cycle_check_html_a399292a33edf87499daa52b51315aca5"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5">CycleCheck::isCyclicBFS</a></div><div class="ttdeci">static bool isCyclicBFS(Graph const &graph)</div><div class="ttdef"><b>Definition</b> <a href="#l00250">cycle_check_directed_graph.cpp:250</a></div></div>
|
|
<div class="ttc" id="aclass_cycle_check_html_ad9a270ffba3a68539b92272c702e3474"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474">CycleCheck::isCyclicDFS</a></div><div class="ttdeci">static bool isCyclicDFS(Graph const &graph)</div><div class="ttdef"><b>Definition</b> <a href="#l00213">cycle_check_directed_graph.cpp:213</a></div></div>
|
|
<div class="ttc" id="aclass_edge_html"><div class="ttname"><a href="../../d7/d77/class_edge.html">Edge</a></div><div class="ttdef"><b>Definition</b> <a href="../../df/d14/bellman__ford_8cpp_source.html#l00008">bellman_ford.cpp:8</a></div></div>
|
|
<div class="ttc" id="aclass_edge_html_a415a5d002fe11c58711e48aabe975980"><div class="ttname"><a href="../../d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980">Edge::Edge</a></div><div class="ttdeci">Edge(unsigned int source, unsigned int destination)</div><div class="ttdef"><b>Definition</b> <a href="#l00041">cycle_check_directed_graph.cpp:41</a></div></div>
|
|
<div class="ttc" id="aclass_graph_html"><div class="ttname"><a href="../../da/d9a/class_graph.html">Graph</a></div><div class="ttdef"><b>Definition</b> <a href="../../df/d14/bellman__ford_8cpp_source.html#l00014">bellman_ford.cpp:14</a></div></div>
|
|
<div class="ttc" id="aclass_graph_html_a5a090e1a63a5c47bdd1a539b21f7fd1d"><div class="ttname"><a href="../../da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d">Graph::getAdjList</a></div><div class="ttdeci">std::remove_reference< AdjList >::type const & getAdjList() const</div><div class="ttdef"><b>Definition</b> <a href="#l00104">cycle_check_directed_graph.cpp:104</a></div></div>
|
|
<div class="ttc" id="aclass_graph_html_a8c95e00effaea0cd9404dd74cd802ae3"><div class="ttname"><a href="../../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3">Graph::Graph</a></div><div class="ttdeci">Graph(unsigned int vertices, AdjList &&adjList)</div><div class="ttdef"><b>Definition</b> <a href="#l00077">cycle_check_directed_graph.cpp:77</a></div></div>
|
|
<div class="ttc" id="aclass_graph_html_a8dcb5ce0b4a6f65827f5055d9d53a3f1"><div class="ttname"><a href="../../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1">Graph::getVertices</a></div><div class="ttdeci">unsigned int getVertices() const</div><div class="ttdef"><b>Definition</b> <a href="#l00111">cycle_check_directed_graph.cpp:111</a></div></div>
|
|
<div class="ttc" id="aclass_graph_html_aa99d44d3179d5bbbfa84a5031cf80cb1"><div class="ttname"><a href="../../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1">Graph::Graph</a></div><div class="ttdeci">Graph(unsigned int vertices, std::vector< Edge > const &edges)</div><div class="ttdef"><b>Definition</b> <a href="#l00089">cycle_check_directed_graph.cpp:89</a></div></div>
|
|
<div class="ttc" id="aclass_graph_html_ac5a4d9a4f894a179198936042c778413"><div class="ttname"><a href="../../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413">Graph::addVertices</a></div><div class="ttdeci">void addVertices(unsigned int num=1)</div><div class="ttdef"><b>Definition</b> <a href="#l00119">cycle_check_directed_graph.cpp:119</a></div></div>
|
|
<div class="ttc" id="aclass_graph_html_ac85c63bcca4764a621f9f8609a8e5910"><div class="ttname"><a href="../../da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910">Graph::addEdge</a></div><div class="ttdeci">void addEdge(unsigned int source, unsigned int destination)</div><div class="ttdef"><b>Definition</b> <a href="#l00137">cycle_check_directed_graph.cpp:137</a></div></div>
|
|
<div class="ttc" id="aclass_graph_html_adcbd1b60cab30b97c54d700eee8e456d"><div class="ttname"><a href="../../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d">Graph::Graph</a></div><div class="ttdeci">Graph(unsigned int vertices, AdjList adjList)</div><div class="ttdef"><b>Definition</b> <a href="#l00069">cycle_check_directed_graph.cpp:69</a></div></div>
|
|
<div class="ttc" id="aclass_graph_html_af765dda8f21280e1cecea19e129f1bc5"><div class="ttname"><a href="../../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5">Graph::addEdge</a></div><div class="ttdeci">void addEdge(Edge const &edge)</div><div class="ttdef"><b>Definition</b> <a href="#l00125">cycle_check_directed_graph.cpp:125</a></div></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 class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</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="astructlist_html"><div class="ttname"><a href="../../d8/d10/structlist.html">list</a></div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00029">hash_search.cpp:29</a></div></div>
|
|
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</div><!-- container -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><b>cycle_check_directed_graph.cpp</b></li>
|
|
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|