mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-04-29 21:14:35 +08:00
Documentation for c26eea874d
This commit is contained in:
realstealthninja
@@ -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.12.0"/>
|
||||
<meta name="generator" content="Doxygen 1.13.2"/>
|
||||
<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" />
|
||||
@@ -60,7 +60,7 @@ window.MathJax = {
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.12.0 -->
|
||||
<!-- Generated by Doxygen 1.13.2 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
@@ -242,7 +242,7 @@ template<size_t V> </div>
|
||||
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 50</span> }</div>
|
||||
<div class="line"><span class="lineno"> 51</span> }</div>
|
||||
<div class="line"><span class="lineno"> 52</span> </div>
|
||||
<div class="line"><span class="lineno"> 52</span></div>
|
||||
<div class="line"><span class="lineno"> 54</span> <span class="keywordtype">int</span> sx = (i / 3) * 3;</div>
|
||||
<div class="line"><span class="lineno"> 55</span> <span class="keywordtype">int</span> sy = (j / 3) * 3;</div>
|
||||
<div class="line"><span class="lineno"> 56</span> </div>
|
||||
@@ -291,13 +291,15 @@ template<size_t V> </div>
|
||||
<div class="line"><span class="lineno"> 164</span> std::array<int, V>{0, 0, 0, 4, 1, 9, 0, 0, 5},</div>
|
||||
<div class="line"><span class="lineno"> 165</span> std::array<int, V>{0, 0, 0, 0, 8, 0, 0, 7, 9}};</div>
|
||||
<div class="line"><span class="lineno"> 166</span> </div>
|
||||
<div class="line"><span class="lineno"> 167</span> backtracking::sudoku_solver::printMat<V>(mat, mat, 9);</div>
|
||||
<div class="line"><span class="lineno"> 167</span> <a class="code hl_function" href="#ab040a12d7684cd85fb3684f4211ea5ac">backtracking::sudoku_solver::printMat<V></a>(mat, mat, 9);</div>
|
||||
<div class="line"><span class="lineno"> 168</span> std::cout << <span class="stringliteral">"Solution "</span> << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 169</span> std::array<std::array<int, V>, V> starting_mat = mat;</div>
|
||||
<div class="line"><span class="lineno"> 170</span> backtracking::sudoku_solver::solveSudoku<V>(mat, starting_mat, 0, 0);</div>
|
||||
<div class="line"><span class="lineno"> 170</span> <a class="code hl_function" href="#ac911c8bca8556206ff64461b2424866b">backtracking::sudoku_solver::solveSudoku<V></a>(mat, starting_mat, 0, 0);</div>
|
||||
<div class="line"><span class="lineno"> 171</span> </div>
|
||||
<div class="line"><span class="lineno"> 172</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 173</span>}</div>
|
||||
<div class="ttc" id="asudoku__solver_8cpp_html_ab040a12d7684cd85fb3684f4211ea5ac"><div class="ttname"><a href="#ab040a12d7684cd85fb3684f4211ea5ac">backtracking::sudoku_solver::printMat</a></div><div class="ttdeci">void printMat(const std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int n)</div><div class="ttdoc">Utility function to print the matrix.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d05/sudoku__solver_8cpp_source.html#l00077">sudoku_solver.cpp:77</a></div></div>
|
||||
<div class="ttc" id="asudoku__solver_8cpp_html_ac911c8bca8556206ff64461b2424866b"><div class="ttname"><a href="#ac911c8bca8556206ff64461b2424866b">backtracking::sudoku_solver::solveSudoku</a></div><div class="ttdeci">bool solveSudoku(std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int i, int j)</div><div class="ttdoc">Main function to implement the Sudoku algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d05/sudoku__solver_8cpp_source.html#l00110">sudoku_solver.cpp:110</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -429,21 +431,21 @@ template<size_t V> </div>
|
||||
<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>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 112</span> {</div>
|
||||
<div class="line"><span class="lineno"> 114</span> <span class="keywordflow">if</span> (i == 9) {</div>
|
||||
<div class="line"><span class="lineno"> 116</span> printMat<V>(mat, starting_mat, 9);</div>
|
||||
<div class="line"><span class="lineno"> 116</span> <a class="code hl_function" href="#ab040a12d7684cd85fb3684f4211ea5ac">printMat<V></a>(mat, starting_mat, 9);</div>
|
||||
<div class="line"><span class="lineno"> 117</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 118</span> }</div>
|
||||
<div class="line"><span class="lineno"> 119</span> </div>
|
||||
<div class="line"><span class="lineno"> 119</span></div>
|
||||
<div class="line"><span class="lineno"> 121</span> <span class="keywordflow">if</span> (j == 9) {</div>
|
||||
<div class="line"><span class="lineno"> 122</span> <span class="keywordflow">return</span> solveSudoku<V>(mat, starting_mat, i + 1, 0);</div>
|
||||
<div class="line"><span class="lineno"> 123</span> }</div>
|
||||
<div class="line"><span class="lineno"> 124</span> </div>
|
||||
<div class="line"><span class="lineno"> 124</span></div>
|
||||
<div class="line"><span class="lineno"> 126</span> <span class="keywordflow">if</span> (mat[i][j] != 0) {</div>
|
||||
<div class="line"><span class="lineno"> 127</span> <span class="keywordflow">return</span> solveSudoku<V>(mat, starting_mat, i, j + 1);</div>
|
||||
<div class="line"><span class="lineno"> 128</span> }</div>
|
||||
<div class="line"><span class="lineno"> 131</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> no = 1; no <= 9; no++) {</div>
|
||||
<div class="line"><span class="lineno"> 132</span> <span class="keywordflow">if</span> (isPossible<V>(mat, i, j, no, 9)) {</div>
|
||||
<div class="line"><span class="lineno"> 132</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a07dc6acffd0500de9bdbf16b3ade94b0">isPossible<V></a>(mat, i, j, no, 9)) {</div>
|
||||
<div class="line"><span class="lineno"> 134</span> mat[i][j] = no;</div>
|
||||
<div class="line"><span class="lineno"> 135</span> <span class="keywordtype">bool</span> solution_found = solveSudoku<V>(mat, starting_mat, i, j + 1);</div>
|
||||
<div class="line"><span class="lineno"> 135</span> <span class="keywordtype">bool</span> solution_found = <a class="code hl_function" href="#ac911c8bca8556206ff64461b2424866b">solveSudoku<V></a>(mat, starting_mat, i, j + 1);</div>
|
||||
<div class="line"><span class="lineno"> 136</span> <span class="keywordflow">if</span> (solution_found) {</div>
|
||||
<div class="line"><span class="lineno"> 137</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 138</span> }</div>
|
||||
@@ -452,6 +454,7 @@ template<size_t V> </div>
|
||||
<div class="line"><span class="lineno"> 144</span> mat[i][j] = 0;</div>
|
||||
<div class="line"><span class="lineno"> 145</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 146</span>}</div>
|
||||
<div class="ttc" id="asudoku__solver_8cpp_html_a07dc6acffd0500de9bdbf16b3ade94b0"><div class="ttname"><a href="#a07dc6acffd0500de9bdbf16b3ade94b0">backtracking::sudoku_solver::isPossible</a></div><div class="ttdeci">bool isPossible(const std::array< std::array< int, V >, V > &mat, int i, int j, int no, int n)</div><div class="ttdoc">Check if it's possible to place a number (no parameter)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d05/sudoku__solver_8cpp_source.html#l00044">sudoku_solver.cpp:44</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -461,7 +464,7 @@ template<size_t V> </div>
|
||||
<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.12.0 </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>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
|
||||
Reference in New Issue
Block a user