mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-07-27 08:51:41 +08:00
Documentation for c6af943508
This commit is contained in:
realstealthninja
@@ -160,7 +160,7 @@ Static Private Member Functions</h2></td></tr>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 160</span>: uint8_t { not_visited = 0, in_stack, visited };</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 161</span>: uint8_t { not_visited = 0, in_stack, visited };</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -196,56 +196,56 @@ Static Private Member Functions</h2></td></tr>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>true if a cycle is detected, else false. </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 249</span> {</div>
|
||||
<div class="line"><span class="lineno"> 250</span> <span class="keyword">auto</span> graphAjdList = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.getAdjList();</div>
|
||||
<div class="line"><span class="lineno"> 251</span> <span class="keyword">auto</span> vertices = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.getVertices();</div>
|
||||
<div class="line"><span class="lineno"> 252</span> </div>
|
||||
<div class="line"><span class="lineno"> 253</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<unsigned int></a> indegree(vertices, 0);</div>
|
||||
<div class="line"><span class="lineno"> 254</span> <span class="comment">// Calculate the indegree i.e. the number of incident edges to the node.</span></div>
|
||||
<div class="line"><span class="lineno"> 255</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"><span class="lineno"> 256</span> <span class="keyword">auto</span> children = <a class="code hl_struct" href="../../d8/d10/structlist.html">list</a>.second;</div>
|
||||
<div class="line"><span class="lineno"> 257</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span>& child : children) {</div>
|
||||
<div class="line"><span class="lineno"> 258</span> indegree[child]++;</div>
|
||||
<div class="line"><span class="lineno"> 259</span> }</div>
|
||||
<div class="line"><span class="lineno"> 260</span> }</div>
|
||||
<div class="line"><span class="lineno"> 261</span> </div>
|
||||
<div class="line"><span class="lineno"> 262</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue<unsigned int></a> can_be_solved;</div>
|
||||
<div class="line"><span class="lineno"> 263</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"><span class="lineno"> 264</span> <span class="comment">// If a node doesn't have any input edges, then that node will</span></div>
|
||||
<div class="line"><span class="lineno"> 265</span> <span class="comment">// definately not result in a cycle and can be visited safely.</span></div>
|
||||
<div class="line"><span class="lineno"> 266</span> <span class="keywordflow">if</span> (!indegree[<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>]) {</div>
|
||||
<div class="line"><span class="lineno"> 267</span> can_be_solved.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/emplace.html">emplace</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
|
||||
<div class="line"><span class="lineno"> 268</span> }</div>
|
||||
<div class="line"><span class="lineno"> 269</span> }</div>
|
||||
<div class="line"><span class="lineno"> 270</span> </div>
|
||||
<div class="line"><span class="lineno"> 271</span> <span class="comment">// Vertices that need to be traversed.</span></div>
|
||||
<div class="line"><span class="lineno"> 272</span> <span class="keyword">auto</span> remain = vertices;</div>
|
||||
<div class="line"><span class="lineno"> 273</span> <span class="comment">// While there are safe nodes that we can visit.</span></div>
|
||||
<div class="line"><span class="lineno"> 274</span> <span class="keywordflow">while</span> (!can_be_solved.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/empty.html">empty</a>()) {</div>
|
||||
<div class="line"><span class="lineno"> 275</span> <span class="keyword">auto</span> solved = can_be_solved.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/front.html">front</a>();</div>
|
||||
<div class="line"><span class="lineno"> 276</span> <span class="comment">// Visit the node.</span></div>
|
||||
<div class="line"><span class="lineno"> 277</span> can_be_solved.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/pop.html">pop</a>();</div>
|
||||
<div class="line"><span class="lineno"> 278</span> <span class="comment">// Decrease number of nodes that need to be traversed.</span></div>
|
||||
<div class="line"><span class="lineno"> 279</span> remain--;</div>
|
||||
<div class="line"><span class="lineno"> 280</span> </div>
|
||||
<div class="line"><span class="lineno"> 281</span> <span class="comment">// Visit all the children of the visited node.</span></div>
|
||||
<div class="line"><span class="lineno"> 282</span> <span class="keyword">auto</span> it = graphAjdList.find(solved);</div>
|
||||
<div class="line"><span class="lineno"> 283</span> <span class="keywordflow">if</span> (it != graphAjdList.end()) {</div>
|
||||
<div class="line"><span class="lineno"> 284</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> child : it->second) {</div>
|
||||
<div class="line"><span class="lineno"> 285</span> <span class="comment">// Check if we can visited the node safely.</span></div>
|
||||
<div class="line"><span class="lineno"> 286</span> <span class="keywordflow">if</span> (--indegree[child] == 0) {</div>
|
||||
<div class="line"><span class="lineno"> 287</span> <span class="comment">// if node can be visited safely, then add that node to</span></div>
|
||||
<div class="line"><span class="lineno"> 288</span> <span class="comment">// the visit queue.</span></div>
|
||||
<div class="line"><span class="lineno"> 289</span> can_be_solved.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/emplace.html">emplace</a>(child);</div>
|
||||
<div class="line"><span class="lineno"> 290</span> }</div>
|
||||
<div class="line"><span class="lineno"> 291</span> }</div>
|
||||
<div class="line"><span class="lineno"> 292</span> }</div>
|
||||
<div class="line"><span class="lineno"> 293</span> }</div>
|
||||
<div class="line"><span class="lineno"> 294</span> </div>
|
||||
<div class="line"><span class="lineno"> 295</span> <span class="comment">// If there are still nodes that we can't visit, then it means that</span></div>
|
||||
<div class="line"><span class="lineno"> 296</span> <span class="comment">// there is a cycle and return true, else return false.</span></div>
|
||||
<div class="line"><span class="lineno"> 297</span> <span class="keywordflow">return</span> !(remain == 0);</div>
|
||||
<div class="line"><span class="lineno"> 298</span> }</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 250</span> {</div>
|
||||
<div class="line"><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"><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"><span class="lineno"> 253</span> </div>
|
||||
<div class="line"><span class="lineno"> 254</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<unsigned int></a> indegree(vertices, 0);</div>
|
||||
<div class="line"><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"><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"><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"><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"><span class="lineno"> 259</span> indegree[child]++;</div>
|
||||
<div class="line"><span class="lineno"> 260</span> }</div>
|
||||
<div class="line"><span class="lineno"> 261</span> }</div>
|
||||
<div class="line"><span class="lineno"> 262</span> </div>
|
||||
<div class="line"><span class="lineno"> 263</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue<unsigned int></a> can_be_solved;</div>
|
||||
<div class="line"><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"><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"><span class="lineno"> 266</span> <span class="comment">// definately not result in a cycle and can be visited safely.</span></div>
|
||||
<div class="line"><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"><span class="lineno"> 268</span> can_be_solved.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/emplace.html">emplace</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
|
||||
<div class="line"><span class="lineno"> 269</span> }</div>
|
||||
<div class="line"><span class="lineno"> 270</span> }</div>
|
||||
<div class="line"><span class="lineno"> 271</span> </div>
|
||||
<div class="line"><span class="lineno"> 272</span> <span class="comment">// Vertices that need to be traversed.</span></div>
|
||||
<div class="line"><span class="lineno"> 273</span> <span class="keyword">auto</span> remain = vertices;</div>
|
||||
<div class="line"><span class="lineno"> 274</span> <span class="comment">// While there are safe nodes that we can visit.</span></div>
|
||||
<div class="line"><span class="lineno"> 275</span> <span class="keywordflow">while</span> (!can_be_solved.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/empty.html">empty</a>()) {</div>
|
||||
<div class="line"><span class="lineno"> 276</span> <span class="keyword">auto</span> solved = can_be_solved.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/front.html">front</a>();</div>
|
||||
<div class="line"><span class="lineno"> 277</span> <span class="comment">// Visit the node.</span></div>
|
||||
<div class="line"><span class="lineno"> 278</span> can_be_solved.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/pop.html">pop</a>();</div>
|
||||
<div class="line"><span class="lineno"> 279</span> <span class="comment">// Decrease number of nodes that need to be traversed.</span></div>
|
||||
<div class="line"><span class="lineno"> 280</span> remain--;</div>
|
||||
<div class="line"><span class="lineno"> 281</span> </div>
|
||||
<div class="line"><span class="lineno"> 282</span> <span class="comment">// Visit all the children of the visited node.</span></div>
|
||||
<div class="line"><span class="lineno"> 283</span> <span class="keyword">auto</span> it = graphAjdList.find(solved);</div>
|
||||
<div class="line"><span class="lineno"> 284</span> <span class="keywordflow">if</span> (it != graphAjdList.end()) {</div>
|
||||
<div class="line"><span class="lineno"> 285</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> child : it->second) {</div>
|
||||
<div class="line"><span class="lineno"> 286</span> <span class="comment">// Check if we can visited the node safely.</span></div>
|
||||
<div class="line"><span class="lineno"> 287</span> <span class="keywordflow">if</span> (--indegree[child] == 0) {</div>
|
||||
<div class="line"><span class="lineno"> 288</span> <span class="comment">// if node can be visited safely, then add that node to</span></div>
|
||||
<div class="line"><span class="lineno"> 289</span> <span class="comment">// the visit queue.</span></div>
|
||||
<div class="line"><span class="lineno"> 290</span> can_be_solved.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/emplace.html">emplace</a>(child);</div>
|
||||
<div class="line"><span class="lineno"> 291</span> }</div>
|
||||
<div class="line"><span class="lineno"> 292</span> }</div>
|
||||
<div class="line"><span class="lineno"> 293</span> }</div>
|
||||
<div class="line"><span class="lineno"> 294</span> }</div>
|
||||
<div class="line"><span class="lineno"> 295</span> </div>
|
||||
<div class="line"><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"><span class="lineno"> 297</span> <span class="comment">// there is a cycle and return true, else return false.</span></div>
|
||||
<div class="line"><span class="lineno"> 298</span> <span class="keywordflow">return</span> !(remain == 0);</div>
|
||||
<div class="line"><span class="lineno"> 299</span> }</div>
|
||||
<div class="ttc" id="aemplace_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/emplace.html">std::queue::emplace</a></div><div class="ttdeci">T emplace(T... args)</div></div>
|
||||
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/empty.html">std::queue::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
|
||||
<div class="ttc" id="afront_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/front.html">std::queue::front</a></div><div class="ttdeci">T front(T... args)</div></div>
|
||||
@@ -297,36 +297,36 @@ Here is the call graph for this function:</div>
|
||||
<p>State of the node.</p>
|
||||
<p>It is a vector of "nodeStates" which represents the state node is in. It can take only 3 values: "not_visited", "in_stack", and "visited".</p>
|
||||
<p>Initially, all nodes are in "not_visited" state.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 212</span> {</div>
|
||||
<div class="line"><span class="lineno"> 213</span> <span class="keyword">auto</span> vertices = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.getVertices();</div>
|
||||
<div class="line"><span class="lineno"> 214</span><span class="comment"></span> </div>
|
||||
<div class="line"><span class="lineno"> 215</span><span class="comment"> /** State of the node.</span></div>
|
||||
<div class="line"><span class="lineno"> 216</span><span class="comment"> *</span></div>
|
||||
<div class="line"><span class="lineno"> 217</span><span class="comment"> * It is a vector of "nodeStates" which represents the state node is in.</span></div>
|
||||
<div class="line"><span class="lineno"> 218</span><span class="comment"> * It can take only 3 values: "not_visited", "in_stack", and "visited".</span></div>
|
||||
<div class="line"><span class="lineno"> 219</span><span class="comment"> *</span></div>
|
||||
<div class="line"><span class="lineno"> 220</span><span class="comment"> * Initially, all nodes are in "not_visited" state.</span></div>
|
||||
<div class="line"><span class="lineno"> 221</span><span class="comment"> */</span></div>
|
||||
<div class="line"><span class="lineno"> 222</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<nodeStates></a> state(vertices, not_visited);</div>
|
||||
<div class="line"><span class="lineno"> 223</span> </div>
|
||||
<div class="line"><span class="lineno"> 224</span> <span class="comment">// Start visiting each node.</span></div>
|
||||
<div class="line"><span class="lineno"> 225</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"><span class="lineno"> 226</span> <span class="comment">// If a node is not visited, only then check for presence of cycle.</span></div>
|
||||
<div class="line"><span class="lineno"> 227</span> <span class="comment">// There is no need to check for presence of cycle for a visited</span></div>
|
||||
<div class="line"><span class="lineno"> 228</span> <span class="comment">// node as it has already been checked for presence of cycle.</span></div>
|
||||
<div class="line"><span class="lineno"> 229</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"><span class="lineno"> 230</span> <span class="comment">// Check for cycle.</span></div>
|
||||
<div class="line"><span class="lineno"> 231</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#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"><span class="lineno"> 232</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 233</span> }</div>
|
||||
<div class="line"><span class="lineno"> 234</span> }</div>
|
||||
<div class="line"><span class="lineno"> 235</span> }</div>
|
||||
<div class="line"><span class="lineno"> 236</span> </div>
|
||||
<div class="line"><span class="lineno"> 237</span> <span class="comment">// All nodes have been safely traversed, that means there is no cycle in</span></div>
|
||||
<div class="line"><span class="lineno"> 238</span> <span class="comment">// the graph. Return false.</span></div>
|
||||
<div class="line"><span class="lineno"> 239</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 240</span> }</div>
|
||||
<div class="ttc" id="aclass_cycle_check_html_a2f4485c08b45e7a21a2e86f9c3f01d8b"><div class="ttname"><a href="#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> cycle_check_directed_graph.cpp:170</div></div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 213</span> {</div>
|
||||
<div class="line"><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"><span class="lineno"> 215</span><span class="comment"></span> </div>
|
||||
<div class="line"><span class="lineno"> 216</span><span class="comment"> /** State of the node.</span></div>
|
||||
<div class="line"><span class="lineno"> 217</span><span class="comment"> *</span></div>
|
||||
<div class="line"><span class="lineno"> 218</span><span class="comment"> * It is a vector of "nodeStates" which represents the state node is in.</span></div>
|
||||
<div class="line"><span class="lineno"> 219</span><span class="comment"> * It can take only 3 values: "not_visited", "in_stack", and "visited".</span></div>
|
||||
<div class="line"><span class="lineno"> 220</span><span class="comment"> *</span></div>
|
||||
<div class="line"><span class="lineno"> 221</span><span class="comment"> * Initially, all nodes are in "not_visited" state.</span></div>
|
||||
<div class="line"><span class="lineno"> 222</span><span class="comment"> */</span></div>
|
||||
<div class="line"><span class="lineno"> 223</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<nodeStates></a> state(vertices, not_visited);</div>
|
||||
<div class="line"><span class="lineno"> 224</span> </div>
|
||||
<div class="line"><span class="lineno"> 225</span> <span class="comment">// Start visiting each node.</span></div>
|
||||
<div class="line"><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"><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"><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"><span class="lineno"> 229</span> <span class="comment">// node as it has already been checked for presence of cycle.</span></div>
|
||||
<div class="line"><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"><span class="lineno"> 231</span> <span class="comment">// Check for cycle.</span></div>
|
||||
<div class="line"><span class="lineno"> 232</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#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"><span class="lineno"> 233</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 234</span> }</div>
|
||||
<div class="line"><span class="lineno"> 235</span> }</div>
|
||||
<div class="line"><span class="lineno"> 236</span> }</div>
|
||||
<div class="line"><span class="lineno"> 237</span> </div>
|
||||
<div class="line"><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"><span class="lineno"> 239</span> <span class="comment">// the graph. Return false.</span></div>
|
||||
<div class="line"><span class="lineno"> 240</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 241</span> }</div>
|
||||
<div class="ttc" id="aclass_cycle_check_html_a2f4485c08b45e7a21a2e86f9c3f01d8b"><div class="ttname"><a href="#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> cycle_check_directed_graph.cpp:171</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -376,37 +376,37 @@ Here is the call graph for this function:</div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>true if graph has a cycle, else false. </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 172</span> {</div>
|
||||
<div class="line"><span class="lineno"> 173</span> <span class="comment">// Add node "in_stack" state.</span></div>
|
||||
<div class="line"><span class="lineno"> 174</span> (*state)[<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>] = in_stack;</div>
|
||||
<div class="line"><span class="lineno"> 175</span> </div>
|
||||
<div class="line"><span class="lineno"> 176</span> <span class="comment">// If the node has children, then recursively visit all children of the</span></div>
|
||||
<div class="line"><span class="lineno"> 177</span> <span class="comment">// node.</span></div>
|
||||
<div class="line"><span class="lineno"> 178</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"><span class="lineno"> 179</span> <span class="keywordflow">if</span> (it != adjList.end()) {</div>
|
||||
<div class="line"><span class="lineno"> 180</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> child : it->second) {</div>
|
||||
<div class="line"><span class="lineno"> 181</span> <span class="comment">// If state of child node is "not_visited", evaluate that child</span></div>
|
||||
<div class="line"><span class="lineno"> 182</span> <span class="comment">// for presence of cycle.</span></div>
|
||||
<div class="line"><span class="lineno"> 183</span> <span class="keyword">auto</span> state_of_child = (*state)[child];</div>
|
||||
<div class="line"><span class="lineno"> 184</span> <span class="keywordflow">if</span> (state_of_child == not_visited) {</div>
|
||||
<div class="line"><span class="lineno"> 185</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a2f4485c08b45e7a21a2e86f9c3f01d8b">isCyclicDFSHelper</a>(adjList, state, child)) {</div>
|
||||
<div class="line"><span class="lineno"> 186</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 187</span> }</div>
|
||||
<div class="line"><span class="lineno"> 188</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (state_of_child == in_stack) {</div>
|
||||
<div class="line"><span class="lineno"> 189</span> <span class="comment">// If child node was "in_stack", then that means that there</span></div>
|
||||
<div class="line"><span class="lineno"> 190</span> <span class="comment">// is a cycle in the graph. Return true for presence of the</span></div>
|
||||
<div class="line"><span class="lineno"> 191</span> <span class="comment">// cycle.</span></div>
|
||||
<div class="line"><span class="lineno"> 192</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 193</span> }</div>
|
||||
<div class="line"><span class="lineno"> 194</span> }</div>
|
||||
<div class="line"><span class="lineno"> 195</span> }</div>
|
||||
<div class="line"><span class="lineno"> 196</span> </div>
|
||||
<div class="line"><span class="lineno"> 197</span> <span class="comment">// Current node has been evaluated for the presence of cycle and had no</span></div>
|
||||
<div class="line"><span class="lineno"> 198</span> <span class="comment">// cycle. Mark current node as "visited".</span></div>
|
||||
<div class="line"><span class="lineno"> 199</span> (*state)[<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>] = visited;</div>
|
||||
<div class="line"><span class="lineno"> 200</span> <span class="comment">// Return that current node didn't result in any cycles.</span></div>
|
||||
<div class="line"><span class="lineno"> 201</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 202</span> }</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 173</span> {</div>
|
||||
<div class="line"><span class="lineno"> 174</span> <span class="comment">// Add node "in_stack" state.</span></div>
|
||||
<div class="line"><span class="lineno"> 175</span> (*state)[<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>] = in_stack;</div>
|
||||
<div class="line"><span class="lineno"> 176</span> </div>
|
||||
<div class="line"><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"><span class="lineno"> 178</span> <span class="comment">// node.</span></div>
|
||||
<div class="line"><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"><span class="lineno"> 180</span> <span class="keywordflow">if</span> (it != adjList.end()) {</div>
|
||||
<div class="line"><span class="lineno"> 181</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> child : it->second) {</div>
|
||||
<div class="line"><span class="lineno"> 182</span> <span class="comment">// If state of child node is "not_visited", evaluate that child</span></div>
|
||||
<div class="line"><span class="lineno"> 183</span> <span class="comment">// for presence of cycle.</span></div>
|
||||
<div class="line"><span class="lineno"> 184</span> <span class="keyword">auto</span> state_of_child = (*state)[child];</div>
|
||||
<div class="line"><span class="lineno"> 185</span> <span class="keywordflow">if</span> (state_of_child == not_visited) {</div>
|
||||
<div class="line"><span class="lineno"> 186</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a2f4485c08b45e7a21a2e86f9c3f01d8b">isCyclicDFSHelper</a>(adjList, state, child)) {</div>
|
||||
<div class="line"><span class="lineno"> 187</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 188</span> }</div>
|
||||
<div class="line"><span class="lineno"> 189</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (state_of_child == in_stack) {</div>
|
||||
<div class="line"><span class="lineno"> 190</span> <span class="comment">// If child node was "in_stack", then that means that there</span></div>
|
||||
<div class="line"><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"><span class="lineno"> 192</span> <span class="comment">// cycle.</span></div>
|
||||
<div class="line"><span class="lineno"> 193</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 194</span> }</div>
|
||||
<div class="line"><span class="lineno"> 195</span> }</div>
|
||||
<div class="line"><span class="lineno"> 196</span> }</div>
|
||||
<div class="line"><span class="lineno"> 197</span> </div>
|
||||
<div class="line"><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"><span class="lineno"> 199</span> <span class="comment">// cycle. Mark current node as "visited".</span></div>
|
||||
<div class="line"><span class="lineno"> 200</span> (*state)[<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>] = visited;</div>
|
||||
<div class="line"><span class="lineno"> 201</span> <span class="comment">// Return that current node didn't result in any cycles.</span></div>
|
||||
<div class="line"><span class="lineno"> 202</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 203</span> }</div>
|
||||
<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
|
||||
Reference in New Issue
Block a user