backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-24 02:23:10 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for f1eddf4d65

Browse Source
This commit is contained in:
realstealthninja
2025-07-09 10:53:16 +00:00
parent e7edde96ab
commit b41207008f
2497 changed files with 31270 additions and 40283 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
d3/d05/classbinary__search__tree-members.html
View File

@@ -4,7 +4,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.13.2"/>
<meta name="generator" content="Doxygen 1.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: Member List</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -19,7 +19,6 @@
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
@@ -60,26 +59,20 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.13.2 -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
@@ -94,10 +87,9 @@ $(function() {
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('d9/dde/classbinary__search__tree.html','../../'); initResizable(true); });
/* @license-end */
$(function(){initNavTree('d9/dde/classbinary__search__tree.html','../../',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
@@ -149,10 +141,11 @@ $(function(){initNavTree('d9/dde/classbinary__search__tree.html','../../'); init
<tr class="odd"><td class="entry"><a class="el" href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</td><td class="entry"><a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">private</span></td></tr>
</table></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="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.13.2 </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>

77
d3/d05/sudoku__solver_8cpp.html
View File

@@ -4,7 +4,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.13.2"/>
<meta name="generator" content="Doxygen 1.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: backtracking/sudoku_solver.cpp File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -19,7 +19,6 @@
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
@@ -60,26 +59,20 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.13.2 -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
@@ -94,10 +87,9 @@ $(function() {
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('d3/d05/sudoku__solver_8cpp.html','../../'); initResizable(true); });
/* @license-end */
$(function(){initNavTree('d3/d05/sudoku__solver_8cpp.html','../../',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
@@ -121,9 +113,6 @@ $(function(){initNavTree('d3/d05/sudoku__solver_8cpp.html','../../'); initResiza
</div>
<div class="header">
<div class="summary">
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">sudoku_solver.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
@@ -135,39 +124,33 @@ $(function(){initNavTree('d3/d05/sudoku__solver_8cpp.html','../../'); initResiza
</div><div class="textblock"><div class="dynheader">
Include dependency graph for sudoku_solver.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dfd/sudoku__solver_8cpp__incl.svg" width="160" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../da/dfd/sudoku__solver_8cpp__incl.svg" width="160" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
<p><a href="../../d3/d05/sudoku__solver_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
<tr class="heading"><td colspan="2"><h2 id="header-namespaces" class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html">backtracking</a></td></tr>
<tr class="memitem:backtracking" id="r_backtracking"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html">backtracking</a></td></tr>
<tr class="memdesc:db/dc0/namespacebacktracking"><td class="mdescLeft">&#160;</td><td class="mdescRight">for vector container <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d9f/namespacesudoku__solver.html">sudoku_solver</a></td></tr>
<tr class="memitem:sudoku_5Fsolver" id="r_sudoku_5Fsolver"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d9f/namespacesudoku__solver.html">sudoku_solver</a></td></tr>
<tr class="memdesc:d8/d9f/namespacesudoku__solver"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the <a href="https://en.wikipedia.org/wiki/Sudoku" target="_blank">Sudoku Solver</a> implementation. <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 id="func-members" name="func-members"></a>
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a07dc6acffd0500de9bdbf16b3ade94b0" id="r_a07dc6acffd0500de9bdbf16b3ade94b0"><td class="memTemplParams" colspan="2">template&lt;size_t V&gt; </td></tr>
<tr class="memitem:a07dc6acffd0500de9bdbf16b3ade94b0"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a07dc6acffd0500de9bdbf16b3ade94b0">backtracking::sudoku_solver::isPossible</a> (const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;mat, int i, int j, int no, int n)</td></tr>
<tr class="memdesc:a07dc6acffd0500de9bdbf16b3ade94b0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Check if it's possible to place a number (<code>no</code> parameter) <br /></td></tr>
<tr class="separator:a07dc6acffd0500de9bdbf16b3ade94b0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a07dc6acffd0500de9bdbf16b3ade94b0 template"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a07dc6acffd0500de9bdbf16b3ade94b0">backtracking::sudoku_solver::isPossible</a> (const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;mat, int i, int j, int no, int n)</td></tr>
<tr class="memdesc:a07dc6acffd0500de9bdbf16b3ade94b0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Check if it's possible to place a number (<span class="tt">no</span> parameter) <br /></td></tr>
<tr class="memitem:ab040a12d7684cd85fb3684f4211ea5ac" id="r_ab040a12d7684cd85fb3684f4211ea5ac"><td class="memTemplParams" colspan="2">template&lt;size_t V&gt; </td></tr>
<tr class="memitem:ab040a12d7684cd85fb3684f4211ea5ac"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ab040a12d7684cd85fb3684f4211ea5ac">backtracking::sudoku_solver::printMat</a> (const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;mat, const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;starting_mat, int n)</td></tr>
<tr class="memitem:ab040a12d7684cd85fb3684f4211ea5ac template"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab040a12d7684cd85fb3684f4211ea5ac">backtracking::sudoku_solver::printMat</a> (const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;mat, const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;starting_mat, int n)</td></tr>
<tr class="memdesc:ab040a12d7684cd85fb3684f4211ea5ac"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to print the matrix. <br /></td></tr>
<tr class="separator:ab040a12d7684cd85fb3684f4211ea5ac"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac911c8bca8556206ff64461b2424866b" id="r_ac911c8bca8556206ff64461b2424866b"><td class="memTemplParams" colspan="2">template&lt;size_t V&gt; </td></tr>
<tr class="memitem:ac911c8bca8556206ff64461b2424866b"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac911c8bca8556206ff64461b2424866b">backtracking::sudoku_solver::solveSudoku</a> (std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;mat, const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;starting_mat, int i, int j)</td></tr>
<tr class="memitem:ac911c8bca8556206ff64461b2424866b template"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac911c8bca8556206ff64461b2424866b">backtracking::sudoku_solver::solveSudoku</a> (std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;mat, const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;starting_mat, int i, int j)</td></tr>
<tr class="memdesc:ac911c8bca8556206ff64461b2424866b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function to implement the Sudoku algorithm. <br /></td></tr>
<tr class="separator:ac911c8bca8556206ff64461b2424866b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></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>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Sudoku" target="_blank">Sudoku Solver</a> algorithm. </p>
<p>Sudoku (数独, sūdoku, digit-single) (/suːˈdoʊkuː/, /-ˈdɒk-/, /sə-/, originally called Number Place) is a logic-based, combinatorial number-placement puzzle. In classic sudoku, the objective is to fill a 9×9 grid with digits so that each column, each row, and each of the nine 3×3 subgrids that compose the grid (also called "boxes", "blocks", or "regions") contain all of the digits from 1 to 9. The puzzle setter provides a partially completed grid, which for a well-posed puzzle has a single solution.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/DarthCoder3200" target="_blank">DarthCoder3200</a> </dd>
@@ -175,7 +158,7 @@ Functions</h2></td></tr>
<a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
<p class="definition">Definition in file <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html">sudoku_solver.cpp</a>.</p>
</div><h2 class="groupheader">Function Documentation</h2>
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
<a id="a07dc6acffd0500de9bdbf16b3ade94b0" name="a07dc6acffd0500de9bdbf16b3ade94b0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a07dc6acffd0500de9bdbf16b3ade94b0">&#9670;&#160;</a></span>isPossible()</h2>
@@ -212,7 +195,7 @@ template&lt;size_t V&gt; </div>
</table>
</div><div class="memdoc">
<p>Check if it's possible to place a number (<code>no</code> parameter) </p>
<p>Check if it's possible to place a number (<span class="tt">no</span> parameter) </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">V</td><td>number of vertices in the array </td></tr>
@@ -229,11 +212,11 @@ template&lt;size_t V&gt; </div>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if 'mat' is different from 'no' </dd>
<dl class="section return"><dt>Returns</dt><dd><span class="tt">true</span> if 'mat' is different from 'no' </dd>
<dd>
<code>false</code> if 'mat' equals to 'no' </dd></dl>
<p><code>no</code> shouldn't be present in either row i or column j</p>
<p><code>no</code> shouldn't be present in the 3*3 subgrid</p>
<span class="tt">false</span> if 'mat' equals to 'no' </dd></dl>
<p><span class="tt">no</span> shouldn't be present in either row i or column j</p>
<p><span class="tt">no</span> shouldn't be present in the 3*3 subgrid</p>
<p class="definition">Definition at line <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html">sudoku_solver.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 45</span> {</div>
@@ -416,16 +399,16 @@ template&lt;size_t V&gt; </div>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if 'no' was placed </dd>
<dl class="section return"><dt>Returns</dt><dd><span class="tt">true</span> if 'no' was placed </dd>
<dd>
<code>false</code> if 'no' was not placed </dd></dl>
<span class="tt">false</span> if 'no' was not placed </dd></dl>
<p>Base Case</p>
<p>Solved for 9 rows already</p>
<p>Crossed the last Cell in the row</p>
<p>Blue Cell - Skip</p>
<p>White Cell Try to place every possible no</p>
<p>Place the 'no' - assuming a solution will exist</p>
<p>Couldn't find a solution loop will place the next <code>no</code>.</p>
<p>Couldn't find a solution loop will place the next <span class="tt">no</span>.</p>
<p><a class="el" href="../../dd/d4f/class_solution.html">Solution</a> couldn't be found for any of the numbers provided</p>
<p class="definition">Definition at line <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html#l00110">110</a> of file <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html">sudoku_solver.cpp</a>.</p>
@@ -460,11 +443,19 @@ template&lt;size_t V&gt; </div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div id="page-nav" class="page-nav-panel">
<div id="page-nav-resize-handle"></div>
<div id="page-nav-tree">
<div id="page-nav-contents">
</div><!-- page-nav-contents -->
</div><!-- page-nav-tree -->
</div><!-- page-nav -->
</div><!-- container -->
<!-- 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="../../d3/d05/sudoku__solver_8cpp.html">sudoku_solver.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.13.2 </li>
<li class="navelem"><a href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a href="../../d3/d05/sudoku__solver_8cpp.html">sudoku_solver.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
</ul>
</div>
</body>

23
d3/d05/sudoku__solver_8cpp_source.html
View File

@@ -4,7 +4,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.13.2"/>
<meta name="generator" content="Doxygen 1.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: backtracking/sudoku_solver.cpp Source File</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -19,7 +19,6 @@
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
@@ -60,26 +59,20 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.13.2 -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
@@ -94,10 +87,9 @@ $(function() {
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('d3/d05/sudoku__solver_8cpp_source.html','../../'); initResizable(true); });
/* @license-end */
$(function(){initNavTree('d3/d05/sudoku__solver_8cpp_source.html','../../',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
@@ -242,11 +234,12 @@ $(function(){initNavTree('d3/d05/sudoku__solver_8cpp_source.html','../../'); ini
<div class="ttc" id="asudoku__solver_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00154">sudoku_solver.cpp:154</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 class="el" href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a class="el" href="../../d3/d05/sudoku__solver_8cpp.html">sudoku_solver.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.13.2 </li>
<li class="navelem"><a href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a href="../../d3/d05/sudoku__solver_8cpp.html">sudoku_solver.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
</ul>
</div>
</body>