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

Documentation for f4403718ef

Browse Source
This commit is contained in:
github-actions
2021-01-15 16:44:30 +00:00
parent 15ef0745d8
commit 5780d2cb95
1583 changed files with 24124 additions and 25495 deletions
Download Patch File Download Diff File Expand all files Collapse all files

31
dc/d5a/rat__maze_8cpp.html
View File

@@ -3,7 +3,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.20"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: backtracking/rat_maze.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -42,10 +42,10 @@
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.20 -->
<!-- Generated by Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
var searchBox = new SearchBox("searchBox", "../../search",false,'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
@@ -98,8 +98,8 @@ $(document).ready(function(){initNavTree('dc/d5a/rat__maze_8cpp.html','../../');
</div><!--header-->
<div class="contents">
<p>Implements <a href="https://www.codesdope.com/blog/article/backtracking-to-
solve-a-rat-in-a-maze-c-java-pytho/">Rat in a Maze</a> algorithm.
<p>Implements &lt;a href="https://www.codesdope.com/blog/article/backtracking-to-
solve-a-rat-in-a-maze-c-java-pytho/".
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;array&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
@@ -117,8 +117,8 @@ Namespaces</h2></td></tr>
<tr class="memdesc:db/dc0/namespacebacktracking"><td class="mdescLeft">&#160;</td><td class="mdescRight">Backtracking algorithms. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d9/d60/namespacerat__maze"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d60/namespacerat__maze.html">rat_maze</a></td></tr>
<tr class="memdesc:d9/d60/namespacerat__maze"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to-
solve-a-rat-in-a-maze-c-java-pytho/">Rat in a Maze</a> algorithm. <br /></td></tr>
<tr class="memdesc:d9/d60/namespacerat__maze"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for &lt;a href="https://www.codesdope.com/blog/article/backtracking-to-
solve-a-rat-in-a-maze-c-java-pytho/". <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
@@ -135,8 +135,9 @@ Functions</h2></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implements <a href="https://www.codesdope.com/blog/article/backtracking-to-
solve-a-rat-in-a-maze-c-java-pytho/">Rat in a Maze</a> algorithm. </p>
<div class="textblock"><p>Implements &lt;a href="https://www.codesdope.com/blog/article/backtracking-to-
solve-a-rat-in-a-maze-c-java-pytho/". </p>
<p>&gt;Rat in a Maze algorithm</p>
<p>A Maze is given as N*N binary matrix of blocks where source block is the upper left most block i.e., maze[0][0] and destination block is lower rightmost block i.e., maze[N-1][N-1]. A rat starts from source and has to reach destination. The rat can move only in two directions: forward and down. In the maze matrix, 0 means the block is dead end and 1 means the block can be used in the path from source to destination.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/vaithak">Vaibhav Thakkar</a> </dd>
<dd>
@@ -164,6 +165,7 @@ solve-a-rat-in-a-maze-c-java-pytho/">Rat in a Maze</a> algorithm. </p>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; <a class="code" href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run the tests</span></div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160;}</div>
<div class="ttc" id="arat__maze_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> rat_maze.cpp:84</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -260,6 +262,9 @@ template&lt;size_t size&gt; </div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; }</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160;}</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="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 class="ttc" id="arat__maze_8cpp_html_ab99107bfb4c6934cd4691868c66c0aa3"><div class="ttname"><a href="../../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3">backtracking::rat_maze::solveMaze</a></div><div class="ttdeci">bool solveMaze(int currposrow, int currposcol, const std::array&lt; std::array&lt; int, size &gt;, size &gt; &amp;maze, std::array&lt; std::array&lt; int, size &gt;, size &gt; soln)</div><div class="ttdoc">Solve rat maze problem.</div><div class="ttdef"><b>Definition:</b> rat_maze.cpp:45</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -317,21 +322,17 @@ Here is the call graph for this function:</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; assert(backtracking::rat_maze::solveMaze&lt;size&gt;(currposrow, currposcol, maze,</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; soln) == 1);</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160;}</div>
<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="arat__maze_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> rat_maze.cpp:84</div></div>
<div class="ttc" id="arat__maze_8cpp_html_ab99107bfb4c6934cd4691868c66c0aa3"><div class="ttname"><a href="../../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3">backtracking::rat_maze::solveMaze</a></div><div class="ttdeci">bool solveMaze(int currposrow, int currposcol, const std::array&lt; std::array&lt; int, size &gt;, size &gt; &amp;maze, std::array&lt; std::array&lt; int, size &gt;, size &gt; soln)</div><div class="ttdoc">Solve rat maze problem.</div><div class="ttdef"><b>Definition:</b> rat_maze.cpp:45</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="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div><div class="ttdoc">STL class.</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>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a class="el" href="../../dc/d5a/rat__maze_8cpp.html">rat_maze.cpp</a></li>
<li class="footer">Generated by <a href="http://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.8.20 </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.9.1 </li>
</ul>
</div>
</body>