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

Documentation for c26eea874d

Browse Source
This commit is contained in:
realstealthninja
2025-05-19 11:38:33 +00:00
parent c7a9a42397
commit 14583a2f33
2829 changed files with 30266 additions and 21669 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
da/dac/n__queens__all__solution__optimised_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.12.0"/>
<meta name="generator" content="Doxygen 1.13.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: backtracking/n_queens_all_solution_optimised.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&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -265,7 +265,7 @@ template&lt;size_t n&gt; </div>
<div class="line"><span class="lineno"> 112</span> </div>
<div class="line"><span class="lineno"> 113</span> <span class="keywordflow">if</span> (n % 2 == 0) {</div>
<div class="line"><span class="lineno"> 114</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= n / 2 - 1; i++) {</div>
<div class="line"><span class="lineno"> 115</span> <span class="keywordflow">if</span> (backtracking::n_queens_optimized::CanIMove(board, i, 0)) {</div>
<div class="line"><span class="lineno"> 115</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a9e48455584a4faa33e83dd1891efd9b9">backtracking::n_queens_optimized::CanIMove</a>(board, i, 0)) {</div>
<div class="line"><span class="lineno"> 116</span> board[i][0] = 1;</div>
<div class="line"><span class="lineno"> 117</span> <a class="code hl_function" href="#a23c0547e4fd1708e6fb643b08327a60f">backtracking::n_queens_optimized::NQueenSol</a>(board, 1);</div>
<div class="line"><span class="lineno"> 118</span> board[i][0] = 0;</div>
@@ -273,7 +273,7 @@ template&lt;size_t n&gt; </div>
<div class="line"><span class="lineno"> 120</span> }</div>
<div class="line"><span class="lineno"> 121</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 122</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= n / 2; i++) {</div>
<div class="line"><span class="lineno"> 123</span> <span class="keywordflow">if</span> (backtracking::n_queens_optimized::CanIMove(board, i, 0)) {</div>
<div class="line"><span class="lineno"> 123</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a9e48455584a4faa33e83dd1891efd9b9">backtracking::n_queens_optimized::CanIMove</a>(board, i, 0)) {</div>
<div class="line"><span class="lineno"> 124</span> board[i][0] = 1;</div>
<div class="line"><span class="lineno"> 125</span> <a class="code hl_function" href="#a23c0547e4fd1708e6fb643b08327a60f">backtracking::n_queens_optimized::NQueenSol</a>(board, 1);</div>
<div class="line"><span class="lineno"> 126</span> board[i][0] = 0;</div>
@@ -283,6 +283,7 @@ template&lt;size_t n&gt; </div>
<div class="line"><span class="lineno"> 130</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 131</span>}</div>
<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a23c0547e4fd1708e6fb643b08327a60f"><div class="ttname"><a href="#a23c0547e4fd1708e6fb643b08327a60f">backtracking::n_queens_optimized::NQueenSol</a></div><div class="ttdeci">void NQueenSol(std::array&lt; std::array&lt; int, n &gt;, n &gt; board, int col)</div><div class="ttdef"><b>Definition</b> <a href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00089">n_queens_all_solution_optimised.cpp:89</a></div></div>
<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a9e48455584a4faa33e83dd1891efd9b9"><div class="ttname"><a href="#a9e48455584a4faa33e83dd1891efd9b9">backtracking::n_queens_optimized::CanIMove</a></div><div class="ttdeci">bool CanIMove(const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board, int row, int col)</div><div class="ttdef"><b>Definition</b> <a href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00059">n_queens_all_solution_optimised.cpp:59</a></div></div>
</div><!-- fragment -->
</div>
</div>
@@ -323,7 +324,7 @@ template&lt;size_t n&gt; </div>
<p class="definition">Definition at line <a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00089">89</a> of file <a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html">n_queens_all_solution_optimised.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 89</span> {</div>
<div class="line"><span class="lineno"> 90</span> <span class="keywordflow">if</span> (col &gt;= n) {</div>
<div class="line"><span class="lineno"> 91</span> PrintSol&lt;n&gt;(board);</div>
<div class="line"><span class="lineno"> 91</span> <a class="code hl_function" href="#a04090463be4942a69ea91fe7386da905">PrintSol&lt;n&gt;</a>(board);</div>
<div class="line"><span class="lineno"> 92</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 93</span> }</div>
<div class="line"><span class="lineno"> 94</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
@@ -334,6 +335,7 @@ template&lt;size_t n&gt; </div>
<div class="line"><span class="lineno"> 99</span> }</div>
<div class="line"><span class="lineno"> 100</span> }</div>
<div class="line"><span class="lineno"> 101</span>}</div>
<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a04090463be4942a69ea91fe7386da905"><div class="ttname"><a href="#a04090463be4942a69ea91fe7386da905">backtracking::n_queens_optimized::PrintSol</a></div><div class="ttdeci">void PrintSol(const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board)</div><div class="ttdef"><b>Definition</b> <a href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00030">n_queens_all_solution_optimised.cpp:30</a></div></div>
</div><!-- fragment -->
</div>
</div>
@@ -394,7 +396,7 @@ template&lt;size_t n&gt; </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="../../da/dac/n__queens__all__solution__optimised_8cpp.html">n_queens_all_solution_optimised.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>