mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-11-04 06:45:45 +08:00
Documentation for 4e3abd4601
This commit is contained in:
github-actions
@@ -1,5 +1,5 @@
|
||||
<map id="backtracking/n_queens.cpp" name="backtracking/n_queens.cpp">
|
||||
<area shape="rect" id="node1" title="Eight Queens puzzle" alt="" coords="5,5,189,32"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="18,80,91,107"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="115,80,167,107"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="29,80,81,107"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="105,80,178,107"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
f87b3655775488f459df8c6053d2f5c5
|
||||
ec423be383376690578eba1614c444df
|
||||
@@ -22,8 +22,8 @@
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="9.5,-0.5 9.5,-19.5 64.5,-19.5 64.5,-0.5 9.5,-0.5"/>
|
||||
<text text-anchor="middle" x="37" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="17.5,-0.5 17.5,-19.5 56.5,-19.5 56.5,-0.5 17.5,-0.5"/>
|
||||
<text text-anchor="middle" x="37" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -37,8 +37,8 @@
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="82.5,-0.5 82.5,-19.5 121.5,-19.5 121.5,-0.5 82.5,-0.5"/>
|
||||
<text text-anchor="middle" x="102" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="74.5,-0.5 74.5,-19.5 129.5,-19.5 129.5,-0.5 74.5,-0.5"/>
|
||||
<text text-anchor="middle" x="102" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 2.2 KiB After Width: | Height: | Size: 2.2 KiB |
@@ -99,8 +99,8 @@ $(document).ready(function(){initNavTree('d1/d2a/knight__tour_8cpp.html','../../
|
||||
|
||||
<p><a href="https://en.wikipedia.org/wiki/Knight%27s_tour" target="_blank">Knight's tour</a> algorithm
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <iostream></code><br />
|
||||
<code>#include <array></code><br />
|
||||
<div class="textblock"><code>#include <array></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for knight_tour.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -111,18 +111,22 @@ Include dependency graph for knight_tour.cpp:</div>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:db/dc0/namespacebacktracking"><td class="memItemLeft" align="right" valign="top">namespace  </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"> </td><td class="mdescRight">Backtracking algorithms. <br /></td></tr>
|
||||
<tr class="memdesc:db/dc0/namespacebacktracking"><td class="mdescLeft"> </td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:d1/db6/namespaceknight__tour"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/db6/namespaceknight__tour.html">knight_tour</a></td></tr>
|
||||
<tr class="memdesc:d1/db6/namespaceknight__tour"><td class="mdescLeft"> </td><td class="mdescRight">Functions for the <a href="https://en.wikipedia.org/wiki/Knight%27s_tour" target="_blank">Knight's tour</a> algorithm. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:a531de8cb2d4d16ca63353d9c72158257"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:a531de8cb2d4d16ca63353d9c72158257"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#a531de8cb2d4d16ca63353d9c72158257">backtracking::issafe</a> (int x, int y, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &sol)</td></tr>
|
||||
<tr class="separator:a531de8cb2d4d16ca63353d9c72158257"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a932e38e8912742cedf7b5a837168e03a"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:a932e38e8912742cedf7b5a837168e03a"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#a932e38e8912742cedf7b5a837168e03a">backtracking::solve</a> (int x, int y, int <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &sol, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > &xmov, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > &ymov)</td></tr>
|
||||
<tr class="separator:a932e38e8912742cedf7b5a837168e03a"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:af27031fbff093ffd625f64010d98aab2"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:af27031fbff093ffd625f64010d98aab2"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2">backtracking::knight_tour::issafe</a> (int x, int y, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &sol)</td></tr>
|
||||
<tr class="separator:af27031fbff093ffd625f64010d98aab2"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:aaa47356d98676cf5315d978f741e29c9"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:aaa47356d98676cf5315d978f741e29c9"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9">backtracking::knight_tour::solve</a> (int x, int y, int <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &sol, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > &xmov, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > &ymov)</td></tr>
|
||||
<tr class="separator:aaa47356d98676cf5315d978f741e29c9"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
||||
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <a href="../../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
|
||||
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
@@ -132,6 +136,68 @@ Functions</h2></td></tr>
|
||||
<dd>
|
||||
<a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="af27031fbff093ffd625f64010d98aab2" name="af27031fbff093ffd625f64010d98aab2"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#af27031fbff093ffd625f64010d98aab2">◆ </a></span>issafe()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<size_t V> </div>
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">bool backtracking::knight_tour::issafe </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>x</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>y</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > & </td>
|
||||
<td class="paramname"><em>sol</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >A utility function to check if i,j are valid indexes for N*N chessboard </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">V</td><td>number of vertices in array </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">x</td><td>current index in rows </td></tr>
|
||||
<tr><td class="paramname">y</td><td>current index in columns </td></tr>
|
||||
<tr><td class="paramname">sol</td><td>matrix where numbers are saved </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if .... </dd>
|
||||
<dd>
|
||||
<code>false</code> if .... </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> {</div>
|
||||
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="keywordflow">return</span> (x < V && x >= 0 && y < V && y >= 0 && sol[x][y] == -1);</div>
|
||||
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d2a/knight__tour_8cpp_af27031fbff093ffd625f64010d98aab2_cgraph.svg" width="151" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
||||
|
||||
@@ -147,36 +213,145 @@ Functions</h2></td></tr>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >Main function </p>
|
||||
<div class="fragment"><div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> {</div>
|
||||
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keyword">const</span> <span class="keywordtype">int</span> n = 8;</div>
|
||||
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array <std::array <int, n></a>, n> sol = { 0 };</div>
|
||||
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> </div>
|
||||
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordtype">int</span> i, j;</div>
|
||||
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordflow">for</span> (i = 0; i < n; i++) {</div>
|
||||
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keywordflow">for</span> (j = 0; j < n; j++) { sol[i][j] = -1; }</div>
|
||||
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> }</div>
|
||||
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> </div>
|
||||
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array <int, n></a> xmov = { 2, 1, -1, -2, -2, -1, 1, 2 };</div>
|
||||
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array <int, n></a> ymov = { 1, 2, 2, 1, -1, -2, -2, -1 };</div>
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> {</div>
|
||||
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="keyword">const</span> <span class="keywordtype">int</span> n = 8;</div>
|
||||
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<std::array<int, n></a>, n> sol = {0};</div>
|
||||
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> </div>
|
||||
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> sol[0][0] = 0;</div>
|
||||
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> </div>
|
||||
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keywordtype">bool</span> flag = backtracking::solve<n>(0, 0, 1, sol, xmov, ymov);</div>
|
||||
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="keywordflow">if</span> (flag == <span class="keyword">false</span>) {</div>
|
||||
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Error: Solution does not exist\n"</span>;</div>
|
||||
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keywordtype">int</span> i = 0, j = 0;</div>
|
||||
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keywordflow">for</span> (i = 0; i < n; i++) {</div>
|
||||
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keywordflow">for</span> (j = 0; j < n; j++) {</div>
|
||||
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> sol[i][j] = -1;</div>
|
||||
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> }</div>
|
||||
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> }</div>
|
||||
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordflow">for</span> (i = 0; i < n; i++) {</div>
|
||||
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="keywordflow">for</span> (j = 0; j < n; j++) { <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << sol[i][j] << <span class="stringliteral">" "</span>; }</div>
|
||||
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> }</div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> }</div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span>}</div>
|
||||
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> </div>
|
||||
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, n></a> xmov = {2, 1, -1, -2, -2, -1, 1, 2};</div>
|
||||
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, n></a> ymov = {1, 2, 2, 1, -1, -2, -2, -1};</div>
|
||||
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> </div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> sol[0][0] = 0;</div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> </div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keywordtype">bool</span> flag = backtracking::knight_tour::solve<n>(0, 0, 1, sol, xmov, ymov);</div>
|
||||
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="keywordflow">if</span> (flag == <span class="keyword">false</span>) {</div>
|
||||
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Error: Solution does not exist\n"</span>;</div>
|
||||
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keywordflow">for</span> (i = 0; i < n; i++) {</div>
|
||||
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="keywordflow">for</span> (j = 0; j < n; j++) {</div>
|
||||
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << sol[i][j] << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> }</div>
|
||||
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> }</div>
|
||||
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> }</div>
|
||||
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span>}</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 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><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="aaa47356d98676cf5315d978f741e29c9" name="aaa47356d98676cf5315d978f741e29c9"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#aaa47356d98676cf5315d978f741e29c9">◆ </a></span>solve()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<size_t V> </div>
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">bool backtracking::knight_tour::solve </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>x</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>y</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>mov</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > & </td>
|
||||
<td class="paramname"><em>sol</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > & </td>
|
||||
<td class="paramname"><em>xmov</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > & </td>
|
||||
<td class="paramname"><em>ymov</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >Knight's tour algorithm </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">V</td><td>number of vertices in array </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">x</td><td>current index in rows </td></tr>
|
||||
<tr><td class="paramname">y</td><td>current index in columns </td></tr>
|
||||
<tr><td class="paramname">mov</td><td>movement to be done </td></tr>
|
||||
<tr><td class="paramname">sol</td><td>matrix where numbers are saved </td></tr>
|
||||
<tr><td class="paramname">xmov</td><td>next move of knight (x coordinate) </td></tr>
|
||||
<tr><td class="paramname">ymov</td><td>next move of knight (y coordinate) </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if solution exists </dd>
|
||||
<dd>
|
||||
<code>false</code> if solution does not exist </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> {</div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keywordtype">int</span> k = 0, xnext = 0, ynext = 0;</div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> </div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a> == V * V) {</div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> }</div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> </div>
|
||||
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordflow">for</span> (k = 0; k < V; k++) {</div>
|
||||
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> xnext = x + xmov[k];</div>
|
||||
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> ynext = y + ymov[k];</div>
|
||||
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> </div>
|
||||
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">if</span> (issafe<V>(xnext, ynext, sol)) {</div>
|
||||
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> sol[xnext][ynext] = <a class="code hl_function" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a>;</div>
|
||||
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> </div>
|
||||
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keywordflow">if</span> (solve<V>(xnext, ynext, <a class="code hl_function" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a> + 1, sol, xmov, ymov) == <span class="keyword">true</span>) {</div>
|
||||
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> sol[xnext][ynext] = -1;</div>
|
||||
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> }</div>
|
||||
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> }</div>
|
||||
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> }</div>
|
||||
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span>}</div>
|
||||
<div class="ttc" id="atower__of__hanoi_8cpp_html_af4cfc41e546f1f8d25f01e0804e8b61d"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a></div><div class="ttdeci">void mov(tower *From, tower *To)</div><div class="ttdef"><b>Definition:</b> tower_of_hanoi.cpp:39</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d2a/knight__tour_8cpp_aaa47356d98676cf5315d978f741e29c9_cgraph.svg" width="246" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
var knight__tour_8cpp =
|
||||
[
|
||||
[ "issafe", "d1/d2a/knight__tour_8cpp.html#a531de8cb2d4d16ca63353d9c72158257", null ],
|
||||
[ "issafe", "d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2", null ],
|
||||
[ "main", "d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
|
||||
[ "solve", "d1/d2a/knight__tour_8cpp.html#a932e38e8912742cedf7b5a837168e03a", null ]
|
||||
[ "solve", "d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9", null ]
|
||||
];
|
||||
@@ -0,0 +1,4 @@
|
||||
<map id="backtracking::knight_tour::solve" name="backtracking::knight_tour::solve">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,29,145,71"/>
|
||||
<area shape="rect" id="node2" href="$db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d" title=" " alt="" coords="193,37,240,63"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
fe6218a377814190bd7aac91c9407c1f
|
||||
@@ -0,0 +1,44 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
|
||||
-->
|
||||
<!-- Title: backtracking::knight_tour::solve Pages: 1 -->
|
||||
<svg width="184pt" height="57pt"
|
||||
viewBox="0.00 0.00 184.00 57.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 53)">
|
||||
<title>backtracking::knight_tour::solve</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-53 180,-53 180,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 105,-30.5 105,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::knight</text>
|
||||
<text text-anchor="middle" x="52.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_tour::solve</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M34.03,-30.66C29.57,-40.06 35.73,-49 52.5,-49 62.72,-49 69,-45.68 71.33,-40.96"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="74.82,-40.53 70.97,-30.66 67.83,-40.78 74.82,-40.53"/>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="141,-6 141,-25 176,-25 176,-6 141,-6"/>
|
||||
<text text-anchor="middle" x="158.5" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">mov</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M105.2,-15.5C113.93,-15.5 122.67,-15.5 130.44,-15.5"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="130.67,-19 140.67,-15.5 130.67,-12 130.67,-19"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.1 KiB |
@@ -0,0 +1,3 @@
|
||||
<map id="backtracking::knight_tour::issafe" name="backtracking::knight_tour::issafe">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,29,145,71"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
6177ffefe6a7004016837480e27c487b
|
||||
@@ -0,0 +1,29 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
|
||||
-->
|
||||
<!-- Title: backtracking::knight_tour::issafe Pages: 1 -->
|
||||
<svg width="113pt" height="57pt"
|
||||
viewBox="0.00 0.00 113.00 57.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 53)">
|
||||
<title>backtracking::knight_tour::issafe</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-53 109,-53 109,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 105,-30.5 105,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::knight</text>
|
||||
<text text-anchor="middle" x="52.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_tour::issafe</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M34.38,-30.66C30.01,-40.06 36.05,-49 52.5,-49 62.53,-49 68.69,-45.68 70.98,-40.96"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="74.47,-40.53 70.62,-30.66 67.47,-40.77 74.47,-40.53"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.4 KiB |
111
d1/db6/namespaceknight__tour.html
Normal file
111
d1/db6/namespaceknight__tour.html
Normal file
@@ -0,0 +1,111 @@
|
||||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||||
<html xmlns="http://www.w3.org/1999/xhtml">
|
||||
<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.9.2"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: knight_tour Namespace Reference</title>
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../resize.js"></script>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
<script type="text/javascript" src="../../navtree.js"></script>
|
||||
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||||
<script type="text/javascript" src="../../search/search.js"></script>
|
||||
<script type="text/x-mathjax-config">
|
||||
MathJax.Hub.Config({
|
||||
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||||
jax: ["input/TeX","output/HTML-CSS"],
|
||||
});
|
||||
</script>
|
||||
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||||
</head>
|
||||
<body>
|
||||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||||
<div id="titlearea">
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr style="height: 56px;">
|
||||
<td id="projectalign" style="padding-left: 0.5em;">
|
||||
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.9.2 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
|
||||
/* @license-end */
|
||||
</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&dn=expat.txt MIT */
|
||||
$(function() {
|
||||
initMenu('../../',true,false,'search.php','Search');
|
||||
$(document).ready(function() { init_search(); });
|
||||
});
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="main-nav"></div>
|
||||
</div><!-- top -->
|
||||
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||||
<div id="nav-tree">
|
||||
<div id="nav-tree-contents">
|
||||
<div id="nav-sync" class="sync"></div>
|
||||
</div>
|
||||
</div>
|
||||
<div id="splitbar" style="-moz-user-select:none;"
|
||||
class="ui-resizable-handle">
|
||||
</div>
|
||||
</div>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(document).ready(function(){initNavTree('d1/db6/namespaceknight__tour.html','../../'); initResizable(); });
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="doc-content">
|
||||
<!-- window showing the filter options -->
|
||||
<div id="MSearchSelectWindow"
|
||||
onmouseover="return searchBox.OnSearchSelectShow()"
|
||||
onmouseout="return searchBox.OnSearchSelectHide()"
|
||||
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
||||
</div>
|
||||
|
||||
<!-- iframe showing the search results (closed by default) -->
|
||||
<div id="MSearchResultsWindow">
|
||||
<iframe src="javascript:void(0)" frameborder="0"
|
||||
name="MSearchResults" id="MSearchResults">
|
||||
</iframe>
|
||||
</div>
|
||||
|
||||
<div class="header">
|
||||
<div class="headertitle"><div class="title">knight_tour Namespace Reference</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>Functions for the <a href="https://en.wikipedia.org/wiki/Knight%27s_tour" target="_blank">Knight's tour</a> algorithm.
|
||||
<a href="../../d1/db6/namespaceknight__tour.html#details">More...</a></p>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p >Functions for the <a href="https://en.wikipedia.org/wiki/Knight%27s_tour" target="_blank">Knight's tour</a> algorithm. </p>
|
||||
</div></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../d1/db6/namespaceknight__tour.html">knight_tour</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.9.2 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
@@ -112,7 +112,7 @@ Include dependency graph for subset_sum.cpp:</div>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:db/dc0/namespacebacktracking"><td class="memItemLeft" align="right" valign="top">namespace  </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"> </td><td class="mdescRight">Backtracking algorithms. <br /></td></tr>
|
||||
<tr class="memdesc:db/dc0/namespacebacktracking"><td class="mdescLeft"> </td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:de/d95/namespace_subsets"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d95/namespace_subsets.html">Subsets</a></td></tr>
|
||||
<tr class="memdesc:de/d95/namespace_subsets"><td class="mdescLeft"> </td><td class="mdescRight">Functions for the <a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset Sum</a> problem. <br /></td></tr>
|
||||
|
||||
@@ -112,21 +112,28 @@ Include dependency graph for graph_coloring.cpp:</div>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:db/dc0/namespacebacktracking"><td class="memItemLeft" align="right" valign="top">namespace  </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"> </td><td class="mdescRight">Backtracking algorithms. <br /></td></tr>
|
||||
<tr class="memdesc:db/dc0/namespacebacktracking"><td class="mdescLeft"> </td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:d7/d08/namespacegraph__coloring"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d08/namespacegraph__coloring.html">graph_coloring</a></td></tr>
|
||||
<tr class="memdesc:d7/d08/namespacegraph__coloring"><td class="mdescLeft"> </td><td class="mdescRight">Functions for the <a href="https://en.wikipedia.org/wiki/Graph_coloring" target="_blank">Graph Coloring</a> algorithm,. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:a8cfb2d08840766ac4402196079308a36"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:a8cfb2d08840766ac4402196079308a36"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#a8cfb2d08840766ac4402196079308a36">backtracking::printSolution</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > &color)</td></tr>
|
||||
<tr class="separator:a8cfb2d08840766ac4402196079308a36"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a5a6c3c2b065ea1c07adf2f638f8efc43"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:a5a6c3c2b065ea1c07adf2f638f8efc43"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#a5a6c3c2b065ea1c07adf2f638f8efc43">backtracking::isSafe</a> (int v, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &graph, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > &color, int c)</td></tr>
|
||||
<tr class="separator:a5a6c3c2b065ea1c07adf2f638f8efc43"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a29360ddb1bad75caa61ec895b6e71986"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:a29360ddb1bad75caa61ec895b6e71986"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#a29360ddb1bad75caa61ec895b6e71986">backtracking::graphColoring</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &graph, int m, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > color, int v)</td></tr>
|
||||
<tr class="separator:a29360ddb1bad75caa61ec895b6e71986"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a8c47fa37fb6eeeb781b2ec1b05af6b07"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:a8c47fa37fb6eeeb781b2ec1b05af6b07"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07">backtracking::graph_coloring::printSolution</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > &color)</td></tr>
|
||||
<tr class="memdesc:a8c47fa37fb6eeeb781b2ec1b05af6b07"><td class="mdescLeft"> </td><td class="mdescRight">A utility function to print the solution. <a href="../../d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07">More...</a><br /></td></tr>
|
||||
<tr class="separator:a8c47fa37fb6eeeb781b2ec1b05af6b07"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a976efe049deb042bf1f02612e181ab1d"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:a976efe049deb042bf1f02612e181ab1d"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d">backtracking::graph_coloring::isSafe</a> (int v, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &graph, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > &color, int c)</td></tr>
|
||||
<tr class="memdesc:a976efe049deb042bf1f02612e181ab1d"><td class="mdescLeft"> </td><td class="mdescRight">Utility function to check if the current color assignment is safe for vertex v. <a href="../../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d">More...</a><br /></td></tr>
|
||||
<tr class="separator:a976efe049deb042bf1f02612e181ab1d"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a40337efc5dad761096489bf2c5b1c80c"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:a40337efc5dad761096489bf2c5b1c80c"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c">backtracking::graph_coloring::graphColoring</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &graph, int m, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > color, int v)</td></tr>
|
||||
<tr class="memdesc:a40337efc5dad761096489bf2c5b1c80c"><td class="mdescLeft"> </td><td class="mdescRight">Recursive utility function to solve m coloring problem. <a href="../../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c">More...</a><br /></td></tr>
|
||||
<tr class="separator:a40337efc5dad761096489bf2c5b1c80c"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:gae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
||||
<tr class="memdesc:gae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <a href="../../d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
|
||||
<tr class="separator:gae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
@@ -136,6 +143,170 @@ Functions</h2></td></tr>
|
||||
<dd>
|
||||
<a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="a40337efc5dad761096489bf2c5b1c80c" name="a40337efc5dad761096489bf2c5b1c80c"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a40337efc5dad761096489bf2c5b1c80c">◆ </a></span>graphColoring()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<size_t V> </div>
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void backtracking::graph_coloring::graphColoring </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > & </td>
|
||||
<td class="paramname"><em>graph</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>m</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > </td>
|
||||
<td class="paramname"><em>color</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>v</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Recursive utility function to solve m coloring problem. </p>
|
||||
<dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">V</td><td>number of vertices in the graph </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramdir"></td><td class="paramname">graph</td><td>matrix of graph nonnectivity </td></tr>
|
||||
<tr><td class="paramdir"></td><td class="paramname">m</td><td>number of colors </td></tr>
|
||||
<tr><td class="paramdir">[in,out]</td><td class="paramname">color</td><td>description // used in,out to notify in documentation that this parameter gets modified by the function </td></tr>
|
||||
<tr><td class="paramdir"></td><td class="paramname">v</td><td>index of graph vertex to check </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> {</div>
|
||||
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="comment">// base case:</span></div>
|
||||
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="comment">// If all vertices are assigned a color then return true</span></div>
|
||||
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keywordflow">if</span> (v == V) {</div>
|
||||
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> printSolution<V>(color);</div>
|
||||
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> }</div>
|
||||
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> </div>
|
||||
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="comment">// Consider this vertex v and try different colors</span></div>
|
||||
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> c = 1; c <= m; c++) {</div>
|
||||
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="comment">// Check if assignment of color c to v is fine</span></div>
|
||||
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keywordflow">if</span> (isSafe<V>(v, <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, color, c)) {</div>
|
||||
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> color[v] = c;</div>
|
||||
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> </div>
|
||||
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// recur to assign colors to rest of the vertices</span></div>
|
||||
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> graphColoring<V>(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, m, color, v + 1);</div>
|
||||
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> </div>
|
||||
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="comment">// If assigning color c doesn't lead to a solution then remove it</span></div>
|
||||
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> color[v] = 0;</div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> }</div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> }</div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span>}</div>
|
||||
<div class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph Algorithms.</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_cgraph.svg" width="178" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="a976efe049deb042bf1f02612e181ab1d" name="a976efe049deb042bf1f02612e181ab1d"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a976efe049deb042bf1f02612e181ab1d">◆ </a></span>isSafe()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<size_t V> </div>
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">bool backtracking::graph_coloring::isSafe </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>v</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > & </td>
|
||||
<td class="paramname"><em>graph</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > & </td>
|
||||
<td class="paramname"><em>color</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>c</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Utility function to check if the current color assignment is safe for vertex v. </p>
|
||||
<dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">V</td><td>number of vertices in the graph </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">v</td><td>index of graph vertex to check </td></tr>
|
||||
<tr><td class="paramname">graph</td><td>matrix of graph nonnectivity </td></tr>
|
||||
<tr><td class="paramname">color</td><td>vector of colors assigned to the graph nodes/vertices </td></tr>
|
||||
<tr><td class="paramname">c</td><td>color value to check for the node <code>v</code> </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if the color is safe to be assigned to the node </dd>
|
||||
<dd>
|
||||
<code>false</code> if the color is not safe to be assigned to the node </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> {</div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < V; i++) {</div>
|
||||
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordflow">if</span> (<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[v][i] && c == color[i]) {</div>
|
||||
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> }</div>
|
||||
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> }</div>
|
||||
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_cgraph.svg" width="150" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="gae66f6b31b5ad750f1fe042a706a4e3d4" name="gae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#gae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
||||
|
||||
@@ -151,32 +322,81 @@ Functions</h2></td></tr>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >Main function</p>
|
||||
<p >Driver Code </p>
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit</dd></dl>
|
||||
<p>Driver Code </p>
|
||||
<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html#a6">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp</a>, and <a class="el" href="../../dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html#a11">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp</a>.</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> {</div>
|
||||
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="comment">// Create following graph and test whether it is 3 colorable</span></div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="comment">// (3)---(2)</span></div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// | / |</span></div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="comment">// | / |</span></div>
|
||||
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="comment">// | / |</span></div>
|
||||
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// (0)---(1)</span></div>
|
||||
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> </div>
|
||||
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keyword">const</span> <span class="keywordtype">int</span> V = 4; <span class="comment">// number of vertices in the graph</span></div>
|
||||
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<std::array<int, V></a>, V> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> = {</div>
|
||||
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a>({0, 1, 1, 1}), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a>({1, 0, 1, 0}),</div>
|
||||
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a>({1, 1, 0, 1}), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a>({1, 0, 1, 0})};</div>
|
||||
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> </div>
|
||||
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="keywordtype">int</span> m = 3; <span class="comment">// Number of colors</span></div>
|
||||
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a> color{};</div>
|
||||
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> </div>
|
||||
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> backtracking::graphColoring<V>(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, m, color, 0);</div>
|
||||
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span>}</div>
|
||||
<div class="fragment"><div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> {</div>
|
||||
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="comment">// Create following graph and test whether it is 3 colorable</span></div>
|
||||
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// (3)---(2)</span></div>
|
||||
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="comment">// | / |</span></div>
|
||||
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <span class="comment">// | / |</span></div>
|
||||
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="comment">// | / |</span></div>
|
||||
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="comment">// (0)---(1)</span></div>
|
||||
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> </div>
|
||||
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="keyword">const</span> <span class="keywordtype">int</span> V = 4; <span class="comment">// number of vertices in the graph</span></div>
|
||||
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<std::array<int, V></a>, V> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> = {</div>
|
||||
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a>({0, 1, 1, 1}), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a>({1, 0, 1, 0}),</div>
|
||||
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a>({1, 1, 0, 1}), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a>({1, 0, 1, 0})};</div>
|
||||
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> </div>
|
||||
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordtype">int</span> m = 3; <span class="comment">// Number of colors</span></div>
|
||||
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a> color{};</div>
|
||||
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> </div>
|
||||
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> backtracking::graph_coloring::graphColoring<V>(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, m, color, 0);</div>
|
||||
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span>}</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 class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph Algorithms.</div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a8c47fa37fb6eeeb781b2ec1b05af6b07" name="a8c47fa37fb6eeeb781b2ec1b05af6b07"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a8c47fa37fb6eeeb781b2ec1b05af6b07">◆ </a></span>printSolution()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<size_t V> </div>
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void backtracking::graph_coloring::printSolution </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > & </td>
|
||||
<td class="paramname"><em>color</em></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>A utility function to print the solution. </p>
|
||||
<dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">V</td><td>number of vertices in the graph </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">color</td><td>array of colors assigned to the nodes </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> {</div>
|
||||
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Following are the assigned colors\n"</span>;</div>
|
||||
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span>& col : color) {</div>
|
||||
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << col;</div>
|
||||
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> }</div>
|
||||
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span>}</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><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_cgraph.svg" width="168" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
</div><!-- contents -->
|
||||
|
||||
6
d3/d40/graph__coloring_8cpp.js
vendored
6
d3/d40/graph__coloring_8cpp.js
vendored
@@ -1,7 +1,7 @@
|
||||
var graph__coloring_8cpp =
|
||||
[
|
||||
[ "graphColoring", "d3/d40/graph__coloring_8cpp.html#a29360ddb1bad75caa61ec895b6e71986", null ],
|
||||
[ "isSafe", "d3/d40/graph__coloring_8cpp.html#a5a6c3c2b065ea1c07adf2f638f8efc43", null ],
|
||||
[ "graphColoring", "d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c", null ],
|
||||
[ "isSafe", "d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d", null ],
|
||||
[ "main", "d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4", null ],
|
||||
[ "printSolution", "d3/d40/graph__coloring_8cpp.html#a8cfb2d08840766ac4402196079308a36", null ]
|
||||
[ "printSolution", "d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07", null ]
|
||||
];
|
||||
@@ -0,0 +1,3 @@
|
||||
<map id="backtracking::graph_coloring::graphColoring" name="backtracking::graph_coloring::graphColoring">
|
||||
<area shape="rect" id="node1" title="Recursive utility function to solve m coloring problem." alt="" coords="5,29,172,71"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
9dccd97635ab6e07ca97f30c6a179215
|
||||
@@ -0,0 +1,29 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
|
||||
-->
|
||||
<!-- Title: backtracking::graph_coloring::graphColoring Pages: 1 -->
|
||||
<svg width="133pt" height="57pt"
|
||||
viewBox="0.00 0.00 133.00 57.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 53)">
|
||||
<title>backtracking::graph_coloring::graphColoring</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-53 129,-53 129,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Recursive utility function to solve m coloring problem.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 125,-30.5 125,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::graph</text>
|
||||
<text text-anchor="middle" x="62.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_coloring::graphColoring</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M40.89,-30.66C35.68,-40.06 42.88,-49 62.5,-49 74.45,-49 81.8,-45.68 84.53,-40.96"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="88.02,-40.51 84.11,-30.66 81.02,-40.79 88.02,-40.51"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.5 KiB |
@@ -0,0 +1,3 @@
|
||||
<map id="backtracking::graph_coloring::printSolution" name="backtracking::graph_coloring::printSolution">
|
||||
<area shape="rect" id="node1" title="A utility function to print the solution." alt="" coords="5,29,163,71"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
bdf49531d2c787f88b14290f7de87439
|
||||
@@ -0,0 +1,29 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
|
||||
-->
|
||||
<!-- Title: backtracking::graph_coloring::printSolution Pages: 1 -->
|
||||
<svg width="126pt" height="57pt"
|
||||
viewBox="0.00 0.00 126.00 57.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 53)">
|
||||
<title>backtracking::graph_coloring::printSolution</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-53 122,-53 122,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="A utility function to print the solution.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 118,-30.5 118,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::graph</text>
|
||||
<text text-anchor="middle" x="59" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_coloring::printSolution</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.44,-30.66C33.48,-40.06 40.33,-49 59,-49 70.38,-49 77.36,-45.68 79.97,-40.96"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="83.45,-40.51 79.56,-30.66 76.46,-40.79 83.45,-40.51"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.5 KiB |
@@ -0,0 +1,3 @@
|
||||
<map id="backtracking::graph_coloring::isSafe" name="backtracking::graph_coloring::isSafe">
|
||||
<area shape="rect" id="node1" title="Utility function to check if the current color assignment is safe for vertex v." alt="" coords="5,29,144,71"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
3ee00c8129f2726d0272babc0a9175d4
|
||||
@@ -0,0 +1,29 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
|
||||
-->
|
||||
<!-- Title: backtracking::graph_coloring::isSafe Pages: 1 -->
|
||||
<svg width="112pt" height="57pt"
|
||||
viewBox="0.00 0.00 112.00 57.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 53)">
|
||||
<title>backtracking::graph_coloring::isSafe</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-53 108,-53 108,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Utility function to check if the current color assignment is safe for vertex v.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 104,-30.5 104,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::graph</text>
|
||||
<text text-anchor="middle" x="52" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_coloring::isSafe</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M33.88,-30.66C29.51,-40.06 35.55,-49 52,-49 62.03,-49 68.19,-45.68 70.48,-40.96"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="73.97,-40.53 70.12,-30.66 66.97,-40.77 73.97,-40.53"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.5 KiB |
@@ -99,8 +99,8 @@ $(document).ready(function(){initNavTree('d4/d3e/n__queens_8cpp.html','../../');
|
||||
|
||||
<p><a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <iostream></code><br />
|
||||
<code>#include <array></code><br />
|
||||
<div class="textblock"><code>#include <array></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for n_queens.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -111,7 +111,7 @@ Include dependency graph for n_queens.cpp:</div>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:db/dc0/namespacebacktracking"><td class="memItemLeft" align="right" valign="top">namespace  </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"> </td><td class="mdescRight">Backtracking algorithms. <br /></td></tr>
|
||||
<tr class="memdesc:db/dc0/namespacebacktracking"><td class="mdescLeft"> </td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:d3/da1/namespacen__queens"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/da1/namespacen__queens.html">n_queens</a></td></tr>
|
||||
<tr class="memdesc:d3/da1/namespacen__queens"><td class="mdescLeft"> </td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle. <br /></td></tr>
|
||||
@@ -129,6 +129,7 @@ Functions</h2></td></tr>
|
||||
<tr class="memitem:a0dbd7af47d87f0b956609fe9e3288ecb"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb">backtracking::n_queens::solveNQ</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, n >, n > board, const int &col)</td></tr>
|
||||
<tr class="separator:a0dbd7af47d87f0b956609fe9e3288ecb"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
||||
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <a href="../../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
|
||||
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
@@ -188,30 +189,30 @@ template<size_t n> </div>
|
||||
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if queen can be placed on matrix </dd>
|
||||
<dd>
|
||||
<code>false</code> if queen can't be placed on matrix </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> {</div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keywordtype">int</span> i = 0, j = 0;</div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> </div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// Check this row on left side</span></div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">for</span> (i = 0; i < col; i++) {</div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordflow">if</span> (board[row][i]) {</div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> }</div>
|
||||
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> }</div>
|
||||
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> </div>
|
||||
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="comment">// Check upper diagonal on left side</span></div>
|
||||
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">for</span> (i = row, j = col; i >= 0 && j >= 0; i--, j--) {</div>
|
||||
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keywordflow">if</span> (board[i][j]) {</div>
|
||||
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> }</div>
|
||||
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> }</div>
|
||||
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// Check lower diagonal on left side</span></div>
|
||||
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keywordflow">for</span> (i = row, j = col; j >= 0 && i < n; i++, j--) {</div>
|
||||
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keywordflow">if</span> (board[i][j]) {</div>
|
||||
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> }</div>
|
||||
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div>
|
||||
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> }</div>
|
||||
<div class="fragment"><div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> {</div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keywordtype">int</span> i = 0, j = 0;</div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> </div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// Check this row on left side</span></div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordflow">for</span> (i = 0; i < col; i++) {</div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordflow">if</span> (board[row][i]) {</div>
|
||||
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> }</div>
|
||||
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> }</div>
|
||||
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> </div>
|
||||
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// Check upper diagonal on left side</span></div>
|
||||
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keywordflow">for</span> (i = row, j = col; i >= 0 && j >= 0; i--, j--) {</div>
|
||||
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keywordflow">if</span> (board[i][j]) {</div>
|
||||
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> }</div>
|
||||
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> }</div>
|
||||
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="comment">// Check lower diagonal on left side</span></div>
|
||||
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keywordflow">for</span> (i = row, j = col; j >= 0 && i < n; i++, j--) {</div>
|
||||
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="keywordflow">if</span> (board[i][j]) {</div>
|
||||
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div>
|
||||
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> }</div>
|
||||
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span>}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -230,19 +231,18 @@ template<size_t n> </div>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >Main function </p>
|
||||
<div class="fragment"><div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> {</div>
|
||||
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <span class="keyword">const</span> <span class="keywordtype">int</span> n = 4;</div>
|
||||
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<std::array<int, n></a>, n> board = {</div>
|
||||
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, n></a>({0, 0, 0, 0}),</div>
|
||||
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, n></a>({0, 0, 0, 0}),</div>
|
||||
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, n></a>({0, 0, 0, 0}),</div>
|
||||
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, n></a>({0, 0, 0, 0})</div>
|
||||
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> };</div>
|
||||
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> </div>
|
||||
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> backtracking::n_queens::solveNQ<n>(board, 0);</div>
|
||||
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span>}</div>
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> {</div>
|
||||
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="keyword">const</span> <span class="keywordtype">int</span> n = 4;</div>
|
||||
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<std::array<int, n></a>, n> board = {</div>
|
||||
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, n></a>({0, 0, 0, 0}), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, n></a>({0, 0, 0, 0}),</div>
|
||||
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, n></a>({0, 0, 0, 0}), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, n></a>({0, 0, 0, 0})};</div>
|
||||
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> </div>
|
||||
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> backtracking::n_queens::solveNQ<n>(board, 0);</div>
|
||||
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span>}</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>
|
||||
@@ -276,15 +276,15 @@ template<size_t n> </div>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> {</div>
|
||||
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||||
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < n; j++) {</div>
|
||||
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">""</span> << board[i][j] << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> }</div>
|
||||
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> }</div>
|
||||
<div class="fragment"><div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> {</div>
|
||||
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||||
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < n; j++) {</div>
|
||||
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">""</span> << board[i][j] << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> }</div>
|
||||
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> }</div>
|
||||
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span>}</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><!-- fragment -->
|
||||
</div>
|
||||
@@ -329,28 +329,28 @@ template<size_t n> </div>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> {</div>
|
||||
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordflow">if</span> (col >= n) {</div>
|
||||
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> printSolution<n>(board);</div>
|
||||
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> }</div>
|
||||
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> </div>
|
||||
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// Consider this column and try placing</span></div>
|
||||
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// this queen in all rows one by one</span></div>
|
||||
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||||
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="comment">// Check if queen can be placed</span></div>
|
||||
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="comment">// on board[i][col]</span></div>
|
||||
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="keywordflow">if</span> (isSafe<n>(board, i, col)) {</div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="comment">// Place this queen in matrix</span></div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> board[i][col] = 1;</div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> </div>
|
||||
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="comment">// Recursive to place rest of the queens</span></div>
|
||||
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> solveNQ<n>(board, col + 1);</div>
|
||||
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> </div>
|
||||
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> board[i][col] = 0; <span class="comment">// backtrack</span></div>
|
||||
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> }</div>
|
||||
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> }</div>
|
||||
<div class="fragment"><div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> {</div>
|
||||
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keywordflow">if</span> (col >= n) {</div>
|
||||
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> printSolution<n>(board);</div>
|
||||
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> }</div>
|
||||
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> </div>
|
||||
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// Consider this column and try placing</span></div>
|
||||
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="comment">// this queen in all rows one by one</span></div>
|
||||
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||||
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="comment">// Check if queen can be placed</span></div>
|
||||
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="comment">// on board[i][col]</span></div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keywordflow">if</span> (isSafe<n>(board, i, col)) {</div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// Place this queen in matrix</span></div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> board[i][col] = 1;</div>
|
||||
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> </div>
|
||||
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// Recursive to place rest of the queens</span></div>
|
||||
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> solveNQ<n>(board, col + 1);</div>
|
||||
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> </div>
|
||||
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> board[i][col] = 0; <span class="comment">// backtrack</span></div>
|
||||
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> }</div>
|
||||
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> }</div>
|
||||
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
|
||||
@@ -1,5 +1,5 @@
|
||||
<map id="backtracking/sudoku_solve.cpp" name="backtracking/sudoku_solve.cpp">
|
||||
<area shape="rect" id="node1" title="Sudoku Solver algorithm." alt="" coords="13,5,157,47"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="5,95,79,121"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="103,95,155,121"/>
|
||||
<area shape="rect" id="node1" title="Sudoku Solver algorithm." alt="" coords="5,5,149,47"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="9,95,61,121"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="85,95,158,121"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
e03cf02b097829558144c50ead56455b
|
||||
7b9b6fa42b07e9f76ca36f912cb7dd7b
|
||||
@@ -4,18 +4,18 @@
|
||||
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
|
||||
-->
|
||||
<!-- Title: backtracking/sudoku_solve.cpp Pages: 1 -->
|
||||
<svg width="122pt" height="95pt"
|
||||
viewBox="0.00 0.00 121.50 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="123pt" height="95pt"
|
||||
viewBox="0.00 0.00 122.50 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 91)">
|
||||
<title>backtracking/sudoku_solve.cpp</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 117.5,-91 117.5,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 118.5,-91 118.5,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Sudoku Solver algorithm.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="5.5,-56.5 5.5,-86.5 113.5,-86.5 113.5,-56.5 5.5,-56.5"/>
|
||||
<text text-anchor="start" x="13.5" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking/sudoku</text>
|
||||
<text text-anchor="middle" x="59.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_solve.cpp</text>
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-56.5 0,-86.5 108,-86.5 108,-56.5 0,-56.5"/>
|
||||
<text text-anchor="start" x="8" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking/sudoku</text>
|
||||
<text text-anchor="middle" x="54" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_solve.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -23,31 +23,31 @@
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 55,-19.5 55,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="27.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="2.5,-0.5 2.5,-19.5 41.5,-19.5 41.5,-0.5 2.5,-0.5"/>
|
||||
<text text-anchor="middle" x="22" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M51.92,-56.4C47.46,-48.11 41.78,-37.55 37.02,-28.71"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="39.98,-26.81 32.16,-19.66 33.81,-30.12 39.98,-26.81"/>
|
||||
<path fill="none" stroke="midnightblue" d="M46.42,-56.4C41.96,-48.11 36.28,-37.55 31.52,-28.71"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="34.48,-26.81 26.66,-19.66 28.31,-30.12 34.48,-26.81"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="73,-0.5 73,-19.5 112,-19.5 112,-0.5 73,-0.5"/>
|
||||
<text text-anchor="middle" x="92.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="59.5,-0.5 59.5,-19.5 114.5,-19.5 114.5,-0.5 59.5,-0.5"/>
|
||||
<text text-anchor="middle" x="87" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M67.32,-56.4C71.97,-48.02 77.9,-37.33 82.84,-28.42"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="85.91,-30.1 87.7,-19.66 79.79,-26.71 85.91,-30.1"/>
|
||||
<path fill="none" stroke="midnightblue" d="M61.82,-56.4C66.47,-48.02 72.4,-37.33 77.34,-28.42"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="80.41,-30.1 82.2,-19.66 74.29,-26.71 80.41,-30.1"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 2.3 KiB After Width: | Height: | Size: 2.3 KiB |
@@ -99,33 +99,40 @@ $(document).ready(function(){initNavTree('d6/d7b/sudoku__solve_8cpp.html','../..
|
||||
|
||||
<p><a href="https://en.wikipedia.org/wiki/Sudoku" target="_blank">Sudoku Solver</a> algorithm.
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <iostream></code><br />
|
||||
<code>#include <array></code><br />
|
||||
<div class="textblock"><code>#include <array></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for sudoku_solve.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d8e/sudoku__solve_8cpp__incl.svg" width="163" height="127"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d8e/sudoku__solve_8cpp__incl.svg" width="164" height="127"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
</div><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:db/dc0/namespacebacktracking"><td class="memItemLeft" align="right" valign="top">namespace  </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"> </td><td class="mdescRight">Backtracking algorithms. <br /></td></tr>
|
||||
<tr class="memdesc:db/dc0/namespacebacktracking"><td class="mdescLeft"> </td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:d8/d9f/namespacesudoku__solver"><td class="memItemLeft" align="right" valign="top">namespace  </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"> </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"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:a80af16e57cfb6aaab2bf1da4c4db3308"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:a80af16e57cfb6aaab2bf1da4c4db3308"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#a80af16e57cfb6aaab2bf1da4c4db3308">backtracking::isPossible</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &mat, int i, int j, int no, int n)</td></tr>
|
||||
<tr class="separator:a80af16e57cfb6aaab2bf1da4c4db3308"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae1a76e21cb3934368d01cea7672d3906"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:ae1a76e21cb3934368d01cea7672d3906"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#ae1a76e21cb3934368d01cea7672d3906">backtracking::printMat</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &mat, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &starting_mat, int n)</td></tr>
|
||||
<tr class="separator:ae1a76e21cb3934368d01cea7672d3906"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a2b98ee79cdbc02ffd7b1f786f9696892"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:a2b98ee79cdbc02ffd7b1f786f9696892"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#a2b98ee79cdbc02ffd7b1f786f9696892">backtracking::solveSudoku</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &mat, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &starting_mat, int i, int j)</td></tr>
|
||||
<tr class="separator:a2b98ee79cdbc02ffd7b1f786f9696892"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a07dc6acffd0500de9bdbf16b3ade94b0"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:a07dc6acffd0500de9bdbf16b3ade94b0"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d6/d7b/sudoku__solve_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0">backtracking::sudoku_solver::isPossible</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &mat, int i, int j, int no, int n)</td></tr>
|
||||
<tr class="memdesc:a07dc6acffd0500de9bdbf16b3ade94b0"><td class="mdescLeft"> </td><td class="mdescRight">Check if it's possible to place a number (<code>no</code> parameter) <a href="../../d6/d7b/sudoku__solve_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0">More...</a><br /></td></tr>
|
||||
<tr class="separator:a07dc6acffd0500de9bdbf16b3ade94b0"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ab040a12d7684cd85fb3684f4211ea5ac"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:ab040a12d7684cd85fb3684f4211ea5ac"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d6/d7b/sudoku__solve_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac">backtracking::sudoku_solver::printMat</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &mat, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &starting_mat, int n)</td></tr>
|
||||
<tr class="memdesc:ab040a12d7684cd85fb3684f4211ea5ac"><td class="mdescLeft"> </td><td class="mdescRight">Utility function to print the matrix. <a href="../../d6/d7b/sudoku__solve_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac">More...</a><br /></td></tr>
|
||||
<tr class="separator:ab040a12d7684cd85fb3684f4211ea5ac"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ac911c8bca8556206ff64461b2424866b"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:ac911c8bca8556206ff64461b2424866b"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d6/d7b/sudoku__solve_8cpp.html#ac911c8bca8556206ff64461b2424866b">backtracking::sudoku_solver::solveSudoku</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &mat, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &starting_mat, int i, int j)</td></tr>
|
||||
<tr class="memdesc:ac911c8bca8556206ff64461b2424866b"><td class="mdescLeft"> </td><td class="mdescRight">Main function to implement the Sudoku algorithm. <a href="../../d6/d7b/sudoku__solve_8cpp.html#ac911c8bca8556206ff64461b2424866b">More...</a><br /></td></tr>
|
||||
<tr class="separator:ac911c8bca8556206ff64461b2424866b"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d7b/sudoku__solve_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
||||
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <a href="../../d6/d7b/sudoku__solve_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
|
||||
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
@@ -135,6 +142,105 @@ Functions</h2></td></tr>
|
||||
<dd>
|
||||
<a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="a07dc6acffd0500de9bdbf16b3ade94b0" name="a07dc6acffd0500de9bdbf16b3ade94b0"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a07dc6acffd0500de9bdbf16b3ade94b0">◆ </a></span>isPossible()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<size_t V> </div>
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">bool backtracking::sudoku_solver::isPossible </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > & </td>
|
||||
<td class="paramname"><em>mat</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>i</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>j</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>no</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>n</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Check if it's possible to place a number (<code>no</code> 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>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">mat</td><td>matrix where numbers are saved </td></tr>
|
||||
<tr><td class="paramname">i</td><td>current index in rows </td></tr>
|
||||
<tr><td class="paramname">j</td><td>current index in columns </td></tr>
|
||||
<tr><td class="paramname">no</td><td>number to be added in matrix </td></tr>
|
||||
<tr><td class="paramname">n</td><td>number of times loop will run </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd><code>true</code> 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>
|
||||
<div class="fragment"><div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> {<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span><span class="comment"> /// `no` shouldn't be present in either row i or column j</span></div>
|
||||
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span><span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < n; x++) {</div>
|
||||
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keywordflow">if</span> (mat[x][j] == no || mat[i][x] == no) {</div>
|
||||
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> }</div>
|
||||
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> }</div>
|
||||
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span><span class="comment"></span> </div>
|
||||
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span><span class="comment"> /// `no` shouldn't be present in the 3*3 subgrid</span></div>
|
||||
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span><span class="comment"></span> <span class="keywordtype">int</span> sx = (i / 3) * 3;</div>
|
||||
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordtype">int</span> sy = (j / 3) * 3;</div>
|
||||
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> </div>
|
||||
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = sx; x < sx + 3; x++) {</div>
|
||||
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> y = sy; y < sy + 3; y++) {</div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keywordflow">if</span> (mat[x][y] == no) {</div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> }</div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> }</div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> }</div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> </div>
|
||||
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d7b/sudoku__solve_8cpp_a07dc6acffd0500de9bdbf16b3ade94b0_cgraph.svg" width="158" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
||||
|
||||
@@ -150,28 +256,29 @@ Functions</h2></td></tr>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >Main function </p>
|
||||
<div class="fragment"><div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> {</div>
|
||||
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="keyword">const</span> <span class="keywordtype">int</span> V = 9;</div>
|
||||
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array <std::array <int, V></a>, V> mat = { </div>
|
||||
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array <int, V></a> {5, 3, 0, 0, 7, 0, 0, 0, 0},</div>
|
||||
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array <int, V></a> {6, 0, 0, 1, 9, 5, 0, 0, 0},</div>
|
||||
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array <int, V></a> {0, 9, 8, 0, 0, 0, 0, 6, 0},</div>
|
||||
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array <int, V></a> {8, 0, 0, 0, 6, 0, 0, 0, 3},</div>
|
||||
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array <int, V></a> {4, 0, 0, 8, 0, 3, 0, 0, 1},</div>
|
||||
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array <int, V></a> {7, 0, 0, 0, 2, 0, 0, 0, 6},</div>
|
||||
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array <int, V></a> {0, 6, 0, 0, 0, 0, 2, 8, 0},</div>
|
||||
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array <int, V></a> {0, 0, 0, 4, 1, 9, 0, 0, 5},</div>
|
||||
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array <int, V></a> {0, 0, 0, 0, 8, 0, 0, 7, 9}</div>
|
||||
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> };</div>
|
||||
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> </div>
|
||||
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> backtracking::printMat<V>(mat, mat, 9);</div>
|
||||
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Solution "</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array <std::array <int, V></a>, V> starting_mat = mat;</div>
|
||||
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> backtracking::solveSudoku<V>(mat, starting_mat, 0, 0);</div>
|
||||
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> </div>
|
||||
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span>}</div>
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> {</div>
|
||||
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <span class="keyword">const</span> <span class="keywordtype">int</span> V = 9;</div>
|
||||
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<std::array<int, V></a>, V> mat = {</div>
|
||||
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a>{5, 3, 0, 0, 7, 0, 0, 0, 0},</div>
|
||||
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a>{6, 0, 0, 1, 9, 5, 0, 0, 0},</div>
|
||||
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a>{0, 9, 8, 0, 0, 0, 0, 6, 0},</div>
|
||||
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a>{8, 0, 0, 0, 6, 0, 0, 0, 3},</div>
|
||||
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a>{4, 0, 0, 8, 0, 3, 0, 0, 1},</div>
|
||||
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a>{7, 0, 0, 0, 2, 0, 0, 0, 6},</div>
|
||||
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a>{0, 6, 0, 0, 0, 0, 2, 8, 0},</div>
|
||||
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a>{0, 0, 0, 4, 1, 9, 0, 0, 5},</div>
|
||||
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, V></a>{0, 0, 0, 0, 8, 0, 0, 7, 9}};</div>
|
||||
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> </div>
|
||||
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> backtracking::sudoku_solver::printMat<V>(mat, mat, 9);</div>
|
||||
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Solution "</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<std::array<int, V></a>, V> starting_mat = mat;</div>
|
||||
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> backtracking::sudoku_solver::solveSudoku<V>(mat, starting_mat, 0, 0);</div>
|
||||
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> </div>
|
||||
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span>}</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 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>
|
||||
@@ -182,6 +289,195 @@ Here is the call graph for this function:</div>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="ab040a12d7684cd85fb3684f4211ea5ac" name="ab040a12d7684cd85fb3684f4211ea5ac"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ab040a12d7684cd85fb3684f4211ea5ac">◆ </a></span>printMat()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<size_t V> </div>
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void backtracking::sudoku_solver::printMat </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > & </td>
|
||||
<td class="paramname"><em>mat</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > & </td>
|
||||
<td class="paramname"><em>starting_mat</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>n</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Utility function to print the matrix. </p>
|
||||
<dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">V</td><td>number of vertices in array </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">mat</td><td>matrix where numbers are saved </td></tr>
|
||||
<tr><td class="paramname">starting_mat</td><td>copy of mat, required by printMat for highlighting the differences </td></tr>
|
||||
<tr><td class="paramname">n</td><td>number of times loop will run </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> {</div>
|
||||
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||||
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < n; j++) {</div>
|
||||
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keywordflow">if</span> (starting_mat[i][j] != mat[i][j]) {</div>
|
||||
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\033[93m"</span> << mat[i][j] << <span class="stringliteral">"\033[0m"</span></div>
|
||||
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << mat[i][j] << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> }</div>
|
||||
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="keywordflow">if</span> ((j + 1) % 3 == 0) {</div>
|
||||
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="charliteral">'\t'</span>;</div>
|
||||
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> }</div>
|
||||
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> }</div>
|
||||
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordflow">if</span> ((i + 1) % 3 == 0) {</div>
|
||||
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> }</div>
|
||||
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> }</div>
|
||||
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d7b/sudoku__solve_8cpp_ab040a12d7684cd85fb3684f4211ea5ac_cgraph.svg" width="278" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="ac911c8bca8556206ff64461b2424866b" name="ac911c8bca8556206ff64461b2424866b"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ac911c8bca8556206ff64461b2424866b">◆ </a></span>solveSudoku()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<size_t V> </div>
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">bool backtracking::sudoku_solver::solveSudoku </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > & </td>
|
||||
<td class="paramname"><em>mat</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > & </td>
|
||||
<td class="paramname"><em>starting_mat</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>i</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>j</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Main function to implement the Sudoku algorithm. </p>
|
||||
<dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">V</td><td>number of vertices in array </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">mat</td><td>matrix where numbers are saved </td></tr>
|
||||
<tr><td class="paramname">starting_mat</td><td>copy of mat, required by printMat for highlighting the differences </td></tr>
|
||||
<tr><td class="paramname">i</td><td>current index in rows </td></tr>
|
||||
<tr><td class="paramname">j</td><td>current index in columns </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if 'no' was placed </dd>
|
||||
<dd>
|
||||
<code>false</code> 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 ><a class="el" href="../../dd/d4f/class_solution.html">Solution</a> couldn't be found for any of the numbers provided</p>
|
||||
<div class="fragment"><div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> {<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span><span class="comment"> /// Base Case</span></div>
|
||||
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span><span class="comment"></span> <span class="keywordflow">if</span> (i == 9) {<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span><span class="comment"> /// Solved for 9 rows already</span></div>
|
||||
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span><span class="comment"></span> printMat<V>(mat, starting_mat, 9);</div>
|
||||
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> }</div>
|
||||
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span><span class="comment"></span> </div>
|
||||
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span><span class="comment"> /// Crossed the last Cell in the row</span></div>
|
||||
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span><span class="comment"></span> <span class="keywordflow">if</span> (j == 9) {</div>
|
||||
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="keywordflow">return</span> solveSudoku<V>(mat, starting_mat, i + 1, 0);</div>
|
||||
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> }</div>
|
||||
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span><span class="comment"></span> </div>
|
||||
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span><span class="comment"> /// Blue Cell - Skip</span></div>
|
||||
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span><span class="comment"></span> <span class="keywordflow">if</span> (mat[i][j] != 0) {</div>
|
||||
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="keywordflow">return</span> solveSudoku<V>(mat, starting_mat, i, j + 1);</div>
|
||||
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> }<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span><span class="comment"> /// White Cell</span></div>
|
||||
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span><span class="comment"> /// Try to place every possible no</span></div>
|
||||
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span><span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> no = 1; no <= 9; no++) {</div>
|
||||
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="keywordflow">if</span> (isPossible<V>(mat, i, j, no, 9)) {<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span><span class="comment"> /// Place the 'no' - assuming a solution will exist</span></div>
|
||||
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span><span class="comment"></span> mat[i][j] = no;</div>
|
||||
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="keywordtype">bool</span> solution_found = solveSudoku<V>(mat, starting_mat, i, j + 1);</div>
|
||||
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="keywordflow">if</span> (solution_found) {</div>
|
||||
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> }<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span><span class="comment"> /// Couldn't find a solution</span></div>
|
||||
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span><span class="comment"> /// loop will place the next `no`.</span></div>
|
||||
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span><span class="comment"></span> }</div>
|
||||
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> }<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span><span class="comment"> /// Solution couldn't be found for any of the numbers provided</span></div>
|
||||
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span><span class="comment"></span> mat[i][j] = 0;</div>
|
||||
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d7b/sudoku__solve_8cpp_ac911c8bca8556206ff64461b2424866b_cgraph.svg" width="160" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -1,7 +1,7 @@
|
||||
var sudoku__solve_8cpp =
|
||||
[
|
||||
[ "isPossible", "d6/d7b/sudoku__solve_8cpp.html#a80af16e57cfb6aaab2bf1da4c4db3308", null ],
|
||||
[ "isPossible", "d6/d7b/sudoku__solve_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0", null ],
|
||||
[ "main", "d6/d7b/sudoku__solve_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
|
||||
[ "printMat", "d6/d7b/sudoku__solve_8cpp.html#ae1a76e21cb3934368d01cea7672d3906", null ],
|
||||
[ "solveSudoku", "d6/d7b/sudoku__solve_8cpp.html#a2b98ee79cdbc02ffd7b1f786f9696892", null ]
|
||||
[ "printMat", "d6/d7b/sudoku__solve_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac", null ],
|
||||
[ "solveSudoku", "d6/d7b/sudoku__solve_8cpp.html#ac911c8bca8556206ff64461b2424866b", null ]
|
||||
];
|
||||
@@ -0,0 +1,3 @@
|
||||
<map id="backtracking::sudoku_solver::isPossible" name="backtracking::sudoku_solver::isPossible">
|
||||
<area shape="rect" id="node1" title="Check if it's possible to place a number (no parameter)" alt="" coords="5,29,152,71"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
588777246f1bc4d0956090f200f69d87
|
||||
@@ -0,0 +1,29 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
|
||||
-->
|
||||
<!-- Title: backtracking::sudoku_solver::isPossible Pages: 1 -->
|
||||
<svg width="118pt" height="57pt"
|
||||
viewBox="0.00 0.00 118.00 57.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 53)">
|
||||
<title>backtracking::sudoku_solver::isPossible</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-53 114,-53 114,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Check if it's possible to place a number (no parameter)">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 110,-30.5 110,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::sudoku</text>
|
||||
<text text-anchor="middle" x="55" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_solver::isPossible</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M35.83,-30.66C31.21,-40.06 37.6,-49 55,-49 65.6,-49 72.12,-45.68 74.55,-40.96"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="78.03,-40.52 74.17,-30.66 71.04,-40.78 78.03,-40.52"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.5 KiB |
@@ -0,0 +1,4 @@
|
||||
<map id="backtracking::sudoku_solver::printMat" name="backtracking::sudoku_solver::printMat">
|
||||
<area shape="rect" id="node1" title="Utility function to print the matrix." alt="" coords="5,29,152,71"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="200,37,272,63"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
5f5b66a954df84d108cb4d89a21a2305
|
||||
@@ -0,0 +1,44 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
|
||||
-->
|
||||
<!-- Title: backtracking::sudoku_solver::printMat Pages: 1 -->
|
||||
<svg width="208pt" height="57pt"
|
||||
viewBox="0.00 0.00 208.00 57.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 53)">
|
||||
<title>backtracking::sudoku_solver::printMat</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-53 204,-53 204,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Utility function to print the matrix.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 110,-30.5 110,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::sudoku</text>
|
||||
<text text-anchor="middle" x="55" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_solver::printMat</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M34.44,-30.66C29.48,-40.06 36.33,-49 55,-49 66.38,-49 73.36,-45.68 75.97,-40.96"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="79.45,-40.51 75.56,-30.66 72.46,-40.79 79.45,-40.51"/>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="146,-6 146,-25 200,-25 200,-6 146,-6"/>
|
||||
<text text-anchor="middle" x="173" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M110.26,-15.5C118.87,-15.5 127.59,-15.5 135.66,-15.5"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="135.83,-19 145.83,-15.5 135.83,-12 135.83,-19"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.1 KiB |
@@ -0,0 +1,3 @@
|
||||
<map id="backtracking::sudoku_solver::solveSudoku" name="backtracking::sudoku_solver::solveSudoku">
|
||||
<area shape="rect" id="node1" title="Main function to implement the Sudoku algorithm." alt="" coords="5,29,155,71"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
ba63a170eb3df4de7c60bcaaeceebe02
|
||||
@@ -0,0 +1,29 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
|
||||
-->
|
||||
<!-- Title: backtracking::sudoku_solver::solveSudoku Pages: 1 -->
|
||||
<svg width="120pt" height="57pt"
|
||||
viewBox="0.00 0.00 120.00 57.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 53)">
|
||||
<title>backtracking::sudoku_solver::solveSudoku</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-53 116,-53 116,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Main function to implement the Sudoku algorithm.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 112,-30.5 112,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::sudoku</text>
|
||||
<text text-anchor="middle" x="56" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_solver::solveSudoku</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M36.48,-30.66C31.78,-40.06 38.28,-49 56,-49 66.8,-49 73.43,-45.68 75.9,-40.96"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="79.39,-40.52 75.52,-30.66 72.39,-40.78 79.39,-40.52"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.5 KiB |
@@ -1,4 +1,4 @@
|
||||
<map id="main" name="main">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,5,56,32"/>
|
||||
<area shape="rect" id="node1" title="Main function." alt="" coords="5,5,56,32"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="104,5,176,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
85270aea331ae2e33b0af08bba3538a8
|
||||
4b2b7a86ed024f51a94096c684cf2192
|
||||
@@ -12,7 +12,7 @@
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<g id="a_node1"><a xlink:title="Main function.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 38,-19.5 38,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="19" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
|
||||
</a>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.6 KiB After Width: | Height: | Size: 1.6 KiB |
111
d7/d08/namespacegraph__coloring.html
Normal file
111
d7/d08/namespacegraph__coloring.html
Normal file
@@ -0,0 +1,111 @@
|
||||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||||
<html xmlns="http://www.w3.org/1999/xhtml">
|
||||
<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.9.2"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: graph_coloring Namespace Reference</title>
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../resize.js"></script>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
<script type="text/javascript" src="../../navtree.js"></script>
|
||||
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||||
<script type="text/javascript" src="../../search/search.js"></script>
|
||||
<script type="text/x-mathjax-config">
|
||||
MathJax.Hub.Config({
|
||||
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||||
jax: ["input/TeX","output/HTML-CSS"],
|
||||
});
|
||||
</script>
|
||||
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||||
</head>
|
||||
<body>
|
||||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||||
<div id="titlearea">
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr style="height: 56px;">
|
||||
<td id="projectalign" style="padding-left: 0.5em;">
|
||||
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.9.2 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
|
||||
/* @license-end */
|
||||
</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&dn=expat.txt MIT */
|
||||
$(function() {
|
||||
initMenu('../../',true,false,'search.php','Search');
|
||||
$(document).ready(function() { init_search(); });
|
||||
});
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="main-nav"></div>
|
||||
</div><!-- top -->
|
||||
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||||
<div id="nav-tree">
|
||||
<div id="nav-tree-contents">
|
||||
<div id="nav-sync" class="sync"></div>
|
||||
</div>
|
||||
</div>
|
||||
<div id="splitbar" style="-moz-user-select:none;"
|
||||
class="ui-resizable-handle">
|
||||
</div>
|
||||
</div>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(document).ready(function(){initNavTree('d7/d08/namespacegraph__coloring.html','../../'); initResizable(); });
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="doc-content">
|
||||
<!-- window showing the filter options -->
|
||||
<div id="MSearchSelectWindow"
|
||||
onmouseover="return searchBox.OnSearchSelectShow()"
|
||||
onmouseout="return searchBox.OnSearchSelectHide()"
|
||||
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
||||
</div>
|
||||
|
||||
<!-- iframe showing the search results (closed by default) -->
|
||||
<div id="MSearchResultsWindow">
|
||||
<iframe src="javascript:void(0)" frameborder="0"
|
||||
name="MSearchResults" id="MSearchResults">
|
||||
</iframe>
|
||||
</div>
|
||||
|
||||
<div class="header">
|
||||
<div class="headertitle"><div class="title">graph_coloring Namespace Reference</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>Functions for the <a href="https://en.wikipedia.org/wiki/Graph_coloring" target="_blank">Graph Coloring</a> algorithm,.
|
||||
<a href="../../d7/d08/namespacegraph__coloring.html#details">More...</a></p>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p >Functions for the <a href="https://en.wikipedia.org/wiki/Graph_coloring" target="_blank">Graph Coloring</a> algorithm,. </p>
|
||||
</div></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../d7/d08/namespacegraph__coloring.html">graph_coloring</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.9.2 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
@@ -99,8 +99,8 @@ $(document).ready(function(){initNavTree('d7/d24/nqueen__print__all__solutions_8
|
||||
|
||||
<p><a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle, printing all solutions
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <iostream></code><br />
|
||||
<code>#include <array></code><br />
|
||||
<div class="textblock"><code>#include <array></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for nqueen_print_all_solutions.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -111,24 +111,28 @@ Include dependency graph for nqueen_print_all_solutions.cpp:</div>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:db/dc0/namespacebacktracking"><td class="memItemLeft" align="right" valign="top">namespace  </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"> </td><td class="mdescRight">Backtracking algorithms. <br /></td></tr>
|
||||
<tr class="memdesc:db/dc0/namespacebacktracking"><td class="mdescLeft"> </td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:df/d44/namespacen__queens__all__solutions"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d44/namespacen__queens__all__solutions.html">n_queens_all_solutions</a></td></tr>
|
||||
<tr class="memdesc:df/d44/namespacen__queens__all__solutions"><td class="mdescLeft"> </td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle with all solutions. <br /></td></tr>
|
||||
<tr class="memdesc:df/d44/namespacen__queens__all__solutions"><td class="mdescLeft"> </td><td class="mdescRight">Functions for the <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle with all solutions. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:aebd5e11fab6dab282efccfb61beb0bd9"><td class="memTemplParams" colspan="2">template<size_t n> </td></tr>
|
||||
<tr class="memitem:aebd5e11fab6dab282efccfb61beb0bd9"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d7/d24/nqueen__print__all__solutions_8cpp.html#aebd5e11fab6dab282efccfb61beb0bd9">backtracking::n_queens_all_solutions::PrintSol</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, n >, n > &board)</td></tr>
|
||||
<tr class="memdesc:aebd5e11fab6dab282efccfb61beb0bd9"><td class="mdescLeft"> </td><td class="mdescRight">Utility function to print matrix. <a href="../../d7/d24/nqueen__print__all__solutions_8cpp.html#aebd5e11fab6dab282efccfb61beb0bd9">More...</a><br /></td></tr>
|
||||
<tr class="separator:aebd5e11fab6dab282efccfb61beb0bd9"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:aea343d8a72a39c9a4c0fbcbc362f2648"><td class="memTemplParams" colspan="2">template<size_t n> </td></tr>
|
||||
<tr class="memitem:aea343d8a72a39c9a4c0fbcbc362f2648"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d7/d24/nqueen__print__all__solutions_8cpp.html#aea343d8a72a39c9a4c0fbcbc362f2648">backtracking::n_queens_all_solutions::CanIMove</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, n >, n > &board, int row, int col)</td></tr>
|
||||
<tr class="memdesc:aea343d8a72a39c9a4c0fbcbc362f2648"><td class="mdescLeft"> </td><td class="mdescRight">Check if a queen can be placed on the matrix. <a href="../../d7/d24/nqueen__print__all__solutions_8cpp.html#aea343d8a72a39c9a4c0fbcbc362f2648">More...</a><br /></td></tr>
|
||||
<tr class="separator:aea343d8a72a39c9a4c0fbcbc362f2648"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:acc809c055f335011de0d9030034c7108"><td class="memTemplParams" colspan="2">template<size_t n> </td></tr>
|
||||
<tr class="memitem:acc809c055f335011de0d9030034c7108"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108">backtracking::n_queens_all_solutions::NQueenSol</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, n >, n > board, int col)</td></tr>
|
||||
<tr class="memdesc:acc809c055f335011de0d9030034c7108"><td class="mdescLeft"> </td><td class="mdescRight">Main function to solve the N Queens problem. <a href="../../d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108">More...</a><br /></td></tr>
|
||||
<tr class="separator:acc809c055f335011de0d9030034c7108"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
||||
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <a href="../../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
|
||||
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
@@ -170,7 +174,9 @@ template<size_t n> </div>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >Check if a queen can be placed on matrix </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
|
||||
<p>Check if a queen can be placed on the matrix. </p>
|
||||
<dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">n</td><td>number of matrix size </td></tr>
|
||||
</table>
|
||||
@@ -190,27 +196,27 @@ template<size_t n> </div>
|
||||
<p >check in the row</p>
|
||||
<p >check the first diagonal</p>
|
||||
<p >check the second diagonal</p>
|
||||
<div class="fragment"><div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> {<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span><span class="comment"> /// check in the row</span></div>
|
||||
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span><span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < col; i++) {</div>
|
||||
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="keywordflow">if</span> (board[row][i] == 1) {</div>
|
||||
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> }</div>
|
||||
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> }<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span><span class="comment"> /// check the first diagonal</span></div>
|
||||
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span><span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = row, j = col; i >= 0 && j >= 0; i--, j--) {</div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keywordflow">if</span> (board[i][j] == 1) {</div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> }</div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> }<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span><span class="comment"> /// check the second diagonal</span></div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span><span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = row, j = col; i <= n - 1 && j >= 0; i++, j--) {</div>
|
||||
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordflow">if</span> (board[i][j] == 1) {</div>
|
||||
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> }</div>
|
||||
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> }</div>
|
||||
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span>}</div>
|
||||
<div class="fragment"><div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> {<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span><span class="comment"> /// check in the row</span></div>
|
||||
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span><span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < col; i++) {</div>
|
||||
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordflow">if</span> (board[row][i] == 1) {</div>
|
||||
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> }</div>
|
||||
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> }<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span><span class="comment"> /// check the first diagonal</span></div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span><span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = row, j = col; i >= 0 && j >= 0; i--, j--) {</div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keywordflow">if</span> (board[i][j] == 1) {</div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> }</div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> }<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span><span class="comment"> /// check the second diagonal</span></div>
|
||||
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span><span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = row, j = col; i <= n - 1 && j >= 0; i++, j--) {</div>
|
||||
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="keywordflow">if</span> (board[i][j] == 1) {</div>
|
||||
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> }</div>
|
||||
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> }</div>
|
||||
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span>}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -229,15 +235,17 @@ template<size_t n> </div>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >Main function </p>
|
||||
<div class="fragment"><div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> {</div>
|
||||
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keyword">const</span> <span class="keywordtype">int</span> n = 4;</div>
|
||||
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<std::array<int, n></a>, n> board{0};</div>
|
||||
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> </div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <a class="code hl_function" href="../../d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108">backtracking::n_queens_all_solutions::NQueenSol</a>(board, 0);</div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span>}</div>
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> {</div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keyword">const</span> <span class="keywordtype">int</span> n = 4;</div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<std::array<int, n></a>, n> board{0};</div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> </div>
|
||||
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <a class="code hl_function" href="../../d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108">backtracking::n_queens_all_solutions::NQueenSol</a>(board, 0);</div>
|
||||
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span>}</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 class="ttc" id="anqueen__print__all__solutions_8cpp_html_acc809c055f335011de0d9030034c7108"><div class="ttname"><a href="../../d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108">backtracking::n_queens_all_solutions::NQueenSol</a></div><div class="ttdeci">void NQueenSol(std::array< std::array< int, n >, n > board, int col)</div><div class="ttdef"><b>Definition:</b> nqueen_print_all_solutions.cpp:79</div></div>
|
||||
<div class="ttc" id="anqueen__print__all__solutions_8cpp_html_acc809c055f335011de0d9030034c7108"><div class="ttname"><a href="../../d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108">backtracking::n_queens_all_solutions::NQueenSol</a></div><div class="ttdeci">void NQueenSol(std::array< std::array< int, n >, n > board, int col)</div><div class="ttdoc">Main function to solve the N Queens problem.</div><div class="ttdef"><b>Definition:</b> nqueen_print_all_solutions.cpp:81</div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -268,7 +276,9 @@ template<size_t n> </div>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >Solve n queens problem </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
|
||||
<p>Main function to solve the N Queens problem. </p>
|
||||
<dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">n</td><td>number of matrix size </td></tr>
|
||||
</table>
|
||||
@@ -281,19 +291,19 @@ template<size_t n> </div>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> {</div>
|
||||
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keywordflow">if</span> (col >= n) {</div>
|
||||
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <a class="code hl_function" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905">PrintSol</a>(board);</div>
|
||||
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> }</div>
|
||||
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||||
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9">CanIMove</a>(board, i, col)) {</div>
|
||||
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> board[i][col] = 1;</div>
|
||||
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <a class="code hl_function" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f">NQueenSol</a>(board, col + 1);</div>
|
||||
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> board[i][col] = 0;</div>
|
||||
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> }</div>
|
||||
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> }</div>
|
||||
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span>}</div>
|
||||
<div class="fragment"><div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> {</div>
|
||||
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keywordflow">if</span> (col >= n) {</div>
|
||||
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <a class="code hl_function" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905">PrintSol</a>(board);</div>
|
||||
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> }</div>
|
||||
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||||
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9">CanIMove</a>(board, i, col)) {</div>
|
||||
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> board[i][col] = 1;</div>
|
||||
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <a class="code hl_function" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f">NQueenSol</a>(board, col + 1);</div>
|
||||
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> board[i][col] = 0;</div>
|
||||
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> }</div>
|
||||
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> }</div>
|
||||
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span>}</div>
|
||||
<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a04090463be4942a69ea91fe7386da905"><div class="ttname"><a href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905">backtracking::n_queens_optimized::PrintSol</a></div><div class="ttdeci">void PrintSol(const std::array< std::array< int, n >, n > &board)</div><div class="ttdef"><b>Definition:</b> n_queens_all_solution_optimised.cpp:30</div></div>
|
||||
<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a23c0547e4fd1708e6fb643b08327a60f"><div class="ttname"><a href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f">backtracking::n_queens_optimized::NQueenSol</a></div><div class="ttdeci">void NQueenSol(std::array< std::array< int, n >, n > board, int col)</div><div class="ttdef"><b>Definition:</b> n_queens_all_solution_optimised.cpp:89</div></div>
|
||||
<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a9e48455584a4faa33e83dd1891efd9b9"><div class="ttname"><a href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9">backtracking::n_queens_optimized::CanIMove</a></div><div class="ttdeci">bool CanIMove(const std::array< std::array< int, n >, n > &board, int row, int col)</div><div class="ttdef"><b>Definition:</b> n_queens_all_solution_optimised.cpp:59</div></div>
|
||||
@@ -317,7 +327,9 @@ template<size_t n> </div>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >Utility function to print matrix </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
|
||||
<p>Utility function to print matrix. </p>
|
||||
<dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">n</td><td>number of matrix size </td></tr>
|
||||
</table>
|
||||
@@ -329,15 +341,15 @@ template<size_t n> </div>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> {</div>
|
||||
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||||
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < n; j++) {</div>
|
||||
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << board[i][j] << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> }</div>
|
||||
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> }</div>
|
||||
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span>}</div>
|
||||
<div class="fragment"><div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> {</div>
|
||||
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||||
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < n; j++) {</div>
|
||||
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << board[i][j] << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> }</div>
|
||||
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> }</div>
|
||||
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span>}</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><!-- fragment --><div class="dynheader">
|
||||
|
||||
@@ -1,4 +1,4 @@
|
||||
<map id="backtracking::n_queens_all_solutions::PrintSol" name="backtracking::n_queens_all_solutions::PrintSol">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,5,168,47"/>
|
||||
<area shape="rect" id="node1" title="Utility function to print matrix." alt="" coords="5,5,168,47"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="216,13,288,39"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
e77ded5f2616483556faa79bf703373b
|
||||
d7d2b0f201a18528bcbc8552dcb2f415
|
||||
@@ -12,7 +12,7 @@
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<g id="a_node1"><a xlink:title="Utility function to print matrix.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 122,-30.5 122,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::n_queens</text>
|
||||
<text text-anchor="middle" x="61" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_all_solutions::PrintSol</text>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.8 KiB After Width: | Height: | Size: 1.8 KiB |
111
d8/d9f/namespacesudoku__solver.html
Normal file
111
d8/d9f/namespacesudoku__solver.html
Normal file
@@ -0,0 +1,111 @@
|
||||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||||
<html xmlns="http://www.w3.org/1999/xhtml">
|
||||
<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.9.2"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: sudoku_solver Namespace Reference</title>
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../resize.js"></script>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
<script type="text/javascript" src="../../navtree.js"></script>
|
||||
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||||
<script type="text/javascript" src="../../search/search.js"></script>
|
||||
<script type="text/x-mathjax-config">
|
||||
MathJax.Hub.Config({
|
||||
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||||
jax: ["input/TeX","output/HTML-CSS"],
|
||||
});
|
||||
</script>
|
||||
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||||
</head>
|
||||
<body>
|
||||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||||
<div id="titlearea">
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr style="height: 56px;">
|
||||
<td id="projectalign" style="padding-left: 0.5em;">
|
||||
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.9.2 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
|
||||
/* @license-end */
|
||||
</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&dn=expat.txt MIT */
|
||||
$(function() {
|
||||
initMenu('../../',true,false,'search.php','Search');
|
||||
$(document).ready(function() { init_search(); });
|
||||
});
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="main-nav"></div>
|
||||
</div><!-- top -->
|
||||
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||||
<div id="nav-tree">
|
||||
<div id="nav-tree-contents">
|
||||
<div id="nav-sync" class="sync"></div>
|
||||
</div>
|
||||
</div>
|
||||
<div id="splitbar" style="-moz-user-select:none;"
|
||||
class="ui-resizable-handle">
|
||||
</div>
|
||||
</div>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(document).ready(function(){initNavTree('d8/d9f/namespacesudoku__solver.html','../../'); initResizable(); });
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="doc-content">
|
||||
<!-- window showing the filter options -->
|
||||
<div id="MSearchSelectWindow"
|
||||
onmouseover="return searchBox.OnSearchSelectShow()"
|
||||
onmouseout="return searchBox.OnSearchSelectHide()"
|
||||
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
||||
</div>
|
||||
|
||||
<!-- iframe showing the search results (closed by default) -->
|
||||
<div id="MSearchResultsWindow">
|
||||
<iframe src="javascript:void(0)" frameborder="0"
|
||||
name="MSearchResults" id="MSearchResults">
|
||||
</iframe>
|
||||
</div>
|
||||
|
||||
<div class="header">
|
||||
<div class="headertitle"><div class="title">sudoku_solver Namespace Reference</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>Functions for the <a href="https://en.wikipedia.org/wiki/Sudoku" target="_blank">Sudoku Solver</a> implementation.
|
||||
<a href="../../d8/d9f/namespacesudoku__solver.html#details">More...</a></p>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p >Functions for the <a href="https://en.wikipedia.org/wiki/Sudoku" target="_blank">Sudoku Solver</a> implementation. </p>
|
||||
</div></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../d8/d9f/namespacesudoku__solver.html">sudoku_solver</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.9.2 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,6 +1,6 @@
|
||||
<map id="backtracking/rat_maze.cpp" name="backtracking/rat_maze.cpp">
|
||||
<area shape="rect" id="node1" title="Implements <a href="https://www.codesdope.com/blog/article/backtracking-to- solve-a-rat-in-a-maze-c-j..." alt="" coords="27,5,209,32"/>
|
||||
<area shape="rect" id="node1" title="Implements <a href="https://www.codesdope.com/blog/article/backtracking-to- solve-a-rat-in-a-maze-c-j..." alt="" coords="23,5,205,32"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="5,80,57,107"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="81,80,155,107"/>
|
||||
<area shape="rect" id="node4" title=" " alt="" coords="179,80,244,107"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="81,80,147,107"/>
|
||||
<area shape="rect" id="node4" title=" " alt="" coords="171,80,244,107"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
b31531092bd33ba642c32a05e7278e42
|
||||
b8969910e602719001158e9ec94d2732
|
||||
@@ -13,8 +13,8 @@
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Implements <a href="https://www.codesdope.com/blog/article/backtracking-to- solve-a-rat-in-a-maze-c-j...">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="16.5,-56.5 16.5,-75.5 152.5,-75.5 152.5,-56.5 16.5,-56.5"/>
|
||||
<text text-anchor="middle" x="84.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking/rat_maze.cpp</text>
|
||||
<polygon fill="#bfbfbf" stroke="black" points="13.5,-56.5 13.5,-75.5 149.5,-75.5 149.5,-56.5 13.5,-56.5"/>
|
||||
<text text-anchor="middle" x="81.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking/rat_maze.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -30,38 +30,38 @@
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M74.06,-56.32C64.35,-48.26 49.68,-36.08 38,-26.37"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="40.06,-23.53 30.13,-19.83 35.59,-28.92 40.06,-23.53"/>
|
||||
<path fill="none" stroke="midnightblue" d="M71.54,-56.32C62.37,-48.34 48.56,-36.31 37.47,-26.65"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="39.48,-23.76 29.64,-19.83 34.88,-29.04 39.48,-23.76"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="57,-0.5 57,-19.5 112,-19.5 112,-0.5 57,-0.5"/>
|
||||
<text text-anchor="middle" x="84.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="57,-0.5 57,-19.5 106,-19.5 106,-0.5 57,-0.5"/>
|
||||
<text text-anchor="middle" x="81.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M84.5,-56.08C84.5,-49.01 84.5,-38.86 84.5,-29.99"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="88,-29.75 84.5,-19.75 81,-29.75 88,-29.75"/>
|
||||
<path fill="none" stroke="midnightblue" d="M81.5,-56.08C81.5,-49.01 81.5,-38.86 81.5,-29.99"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="85,-29.75 81.5,-19.75 78,-29.75 85,-29.75"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="130,-0.5 130,-19.5 179,-19.5 179,-0.5 130,-0.5"/>
|
||||
<text text-anchor="middle" x="154.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="124,-0.5 124,-19.5 179,-19.5 179,-0.5 124,-0.5"/>
|
||||
<text text-anchor="middle" x="151.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M95.75,-56.32C106.3,-48.18 122.3,-35.84 134.94,-26.09"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="137.27,-28.71 143.05,-19.83 132.99,-23.17 137.27,-28.71"/>
|
||||
<path fill="none" stroke="midnightblue" d="M92.75,-56.32C103.3,-48.18 119.3,-35.84 131.94,-26.09"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="134.27,-28.71 140.05,-19.83 129.99,-23.17 134.27,-28.71"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 2.9 KiB After Width: | Height: | Size: 2.9 KiB |
@@ -111,7 +111,7 @@ Include dependency graph for n_queens_all_solution_optimised.cpp:</div>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:db/dc0/namespacebacktracking"><td class="memItemLeft" align="right" valign="top">namespace  </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"> </td><td class="mdescRight">Backtracking algorithms. <br /></td></tr>
|
||||
<tr class="memdesc:db/dc0/namespacebacktracking"><td class="mdescLeft"> </td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:d8/d14/namespacen__queens__optimized"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d14/namespacen__queens__optimized.html">n_queens_optimized</a></td></tr>
|
||||
<tr class="memdesc:d8/d14/namespacen__queens__optimized"><td class="mdescLeft"> </td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle optimized. <br /></td></tr>
|
||||
@@ -244,7 +244,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<std::array<int, n></a>, n> board{};</div>
|
||||
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> </div>
|
||||
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="keywordflow">if</span> (n % 2 == 0) {</div>
|
||||
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i <= n / 2 - 1; i++) { <span class="comment">// 😎</span></div>
|
||||
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i <= n / 2 - 1; i++) {</div>
|
||||
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="keywordflow">if</span> (backtracking::n_queens_optimized::CanIMove(board, i, 0)) {</div>
|
||||
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> board[i][0] = 1;</div>
|
||||
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <a class="code hl_function" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f">backtracking::n_queens_optimized::NQueenSol</a>(board, 1);</div>
|
||||
@@ -252,7 +252,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> }</div>
|
||||
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> }</div>
|
||||
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i <= n / 2; i++) { <span class="comment">// 😏</span></div>
|
||||
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i <= n / 2; i++) {</div>
|
||||
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="keywordflow">if</span> (backtracking::n_queens_optimized::CanIMove(board, i, 0)) {</div>
|
||||
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> board[i][0] = 1;</div>
|
||||
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <a class="code hl_function" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f">backtracking::n_queens_optimized::NQueenSol</a>(board, 1);</div>
|
||||
|
||||
@@ -96,344 +96,37 @@ $(document).ready(function(){initNavTree('db/dc0/namespacebacktracking.html','..
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>Backtracking algorithms.
|
||||
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>
|
||||
<a href="../../db/dc0/namespacebacktracking.html#details">More...</a></p>
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:a8cfb2d08840766ac4402196079308a36"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:a8cfb2d08840766ac4402196079308a36"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#a8cfb2d08840766ac4402196079308a36">printSolution</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > &color)</td></tr>
|
||||
<tr class="separator:a8cfb2d08840766ac4402196079308a36"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a5a6c3c2b065ea1c07adf2f638f8efc43"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:a5a6c3c2b065ea1c07adf2f638f8efc43"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#a5a6c3c2b065ea1c07adf2f638f8efc43">isSafe</a> (int v, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &graph, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > &color, int c)</td></tr>
|
||||
<tr class="separator:a5a6c3c2b065ea1c07adf2f638f8efc43"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a29360ddb1bad75caa61ec895b6e71986"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:a29360ddb1bad75caa61ec895b6e71986"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#a29360ddb1bad75caa61ec895b6e71986">graphColoring</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &graph, int m, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > color, int v)</td></tr>
|
||||
<tr class="separator:a29360ddb1bad75caa61ec895b6e71986"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a531de8cb2d4d16ca63353d9c72158257"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:a531de8cb2d4d16ca63353d9c72158257"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#a531de8cb2d4d16ca63353d9c72158257">issafe</a> (int x, int y, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &sol)</td></tr>
|
||||
<tr class="separator:a531de8cb2d4d16ca63353d9c72158257"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a932e38e8912742cedf7b5a837168e03a"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:a932e38e8912742cedf7b5a837168e03a"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#a932e38e8912742cedf7b5a837168e03a">solve</a> (int x, int y, int <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &sol, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > &xmov, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > &ymov)</td></tr>
|
||||
<tr class="separator:a932e38e8912742cedf7b5a837168e03a"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a78540bcb5ef3473b2348cbc34748ec50"><td class="memTemplParams" colspan="2">template<size_t T> </td></tr>
|
||||
<tr class="memitem:a78540bcb5ef3473b2348cbc34748ec50"><td class="memTemplItemLeft" align="right" valign="top">int </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">minimax</a> (int depth, int node_index, bool is_max, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, T > &scores, double <a class="el" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>)</td></tr>
|
||||
<tr class="memdesc:a78540bcb5ef3473b2348cbc34748ec50"><td class="mdescLeft"> </td><td class="mdescRight">Check which is the maximum/minimum number in the array. <a href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">More...</a><br /></td></tr>
|
||||
<tr class="separator:a78540bcb5ef3473b2348cbc34748ec50"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a80af16e57cfb6aaab2bf1da4c4db3308"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:a80af16e57cfb6aaab2bf1da4c4db3308"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#a80af16e57cfb6aaab2bf1da4c4db3308">isPossible</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &mat, int i, int j, int no, int n)</td></tr>
|
||||
<tr class="separator:a80af16e57cfb6aaab2bf1da4c4db3308"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae1a76e21cb3934368d01cea7672d3906"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:ae1a76e21cb3934368d01cea7672d3906"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#ae1a76e21cb3934368d01cea7672d3906">printMat</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &mat, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &starting_mat, int n)</td></tr>
|
||||
<tr class="separator:ae1a76e21cb3934368d01cea7672d3906"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a2b98ee79cdbc02ffd7b1f786f9696892"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||||
<tr class="memitem:a2b98ee79cdbc02ffd7b1f786f9696892"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#a2b98ee79cdbc02ffd7b1f786f9696892">solveSudoku</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &mat, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > &starting_mat, int i, int j)</td></tr>
|
||||
<tr class="separator:a2b98ee79cdbc02ffd7b1f786f9696892"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p >Backtracking algorithms. </p>
|
||||
<p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
|
||||
<div class="textblock"><p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
|
||||
<p >Backtracking algorithms.</p>
|
||||
<p >for IO operations</p>
|
||||
<p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for IO operations</p>
|
||||
<p >Backtracking algorithms</p>
|
||||
<p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></p>
|
||||
<p >Backtracking algorithms</p>
|
||||
<p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/count.html">std::count</a> for assert for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html">std::accumulate</a></p>
|
||||
<p >Backtracking algorithms</p>
|
||||
<p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for log2</p>
|
||||
<p >Backtracking algorithms</p>
|
||||
<p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for assert</p>
|
||||
<p >Backtracking algorithms</p>
|
||||
<p >for assert for IO operations for unordered_map</p>
|
||||
<p >Backtracking algorithms</p>
|
||||
<p >for assert for IO operations</p>
|
||||
<p >Backtracking algorithms</p>
|
||||
<p >for assert</p>
|
||||
<p >Backtracking algorithms </p>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="a29360ddb1bad75caa61ec895b6e71986" name="a29360ddb1bad75caa61ec895b6e71986"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a29360ddb1bad75caa61ec895b6e71986">◆ </a></span>graphColoring()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<size_t V> </div>
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void backtracking::graphColoring </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > & </td>
|
||||
<td class="paramname"><em>graph</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>m</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > </td>
|
||||
<td class="paramname"><em>color</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>v</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >A recursive utility function to solve m coloring problem </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">V</td><td>number of vertices in the graph </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramdir"></td><td class="paramname">graph</td><td>matrix of graph nonnectivity </td></tr>
|
||||
<tr><td class="paramdir"></td><td class="paramname">m</td><td>number of colors </td></tr>
|
||||
<tr><td class="paramdir">[in,out]</td><td class="paramname">color</td><td>description // used in,out to notify in documentation that this parameter gets modified by the function </td></tr>
|
||||
<tr><td class="paramdir"></td><td class="paramname">v</td><td>index of graph vertex to check </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> {</div>
|
||||
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// base case:</span></div>
|
||||
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="comment">// If all vertices are assigned a color then return true</span></div>
|
||||
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keywordflow">if</span> (v == V) {</div>
|
||||
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> backtracking::printSolution<V>(color);</div>
|
||||
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div>
|
||||
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> </div>
|
||||
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="comment">// Consider this vertex v and try different colors</span></div>
|
||||
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> c = 1; c <= m; c++) {</div>
|
||||
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="comment">// Check if assignment of color c to v is fine</span></div>
|
||||
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordflow">if</span> (backtracking::isSafe<V>(v, <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, color, c)) {</div>
|
||||
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> color[v] = c;</div>
|
||||
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> </div>
|
||||
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="comment">// recur to assign colors to rest of the vertices</span></div>
|
||||
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> backtracking::graphColoring<V>(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, m, color, v + 1);</div>
|
||||
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> </div>
|
||||
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="comment">// If assigning color c doesn't lead to a solution then remove it</span></div>
|
||||
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> color[v] = 0;</div>
|
||||
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> }</div>
|
||||
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> }</div>
|
||||
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span>}</div>
|
||||
<div class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph Algorithms.</div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a80af16e57cfb6aaab2bf1da4c4db3308" name="a80af16e57cfb6aaab2bf1da4c4db3308"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a80af16e57cfb6aaab2bf1da4c4db3308">◆ </a></span>isPossible()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<size_t V> </div>
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">bool backtracking::isPossible </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > & </td>
|
||||
<td class="paramname"><em>mat</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>i</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>j</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>no</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>n</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >Checks if it's possible to place a number 'no' </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>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">mat</td><td>matrix where numbers are saved </td></tr>
|
||||
<tr><td class="paramname">i</td><td>current index in rows </td></tr>
|
||||
<tr><td class="paramname">j</td><td>current index in columns </td></tr>
|
||||
<tr><td class="paramname">no</td><td>number to be added in matrix </td></tr>
|
||||
<tr><td class="paramname">n</td><td>number of times loop will run </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if 'mat' is different from 'no' </dd>
|
||||
<dd>
|
||||
<code>false</code> if 'mat' equals to 'no' </dd></dl>
|
||||
<p >'no' shouldn't be present in either row i or column j</p>
|
||||
<p >'no' shouldn't be present in the 3*3 subgrid</p>
|
||||
<div class="fragment"><div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> {<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="comment"> /// 'no' shouldn't be present in either row i or column j</span></div>
|
||||
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < n; x++) {</div>
|
||||
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="keywordflow">if</span> (mat[x][j] == no || mat[i][x] == no) {</div>
|
||||
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> }</div>
|
||||
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> }</div>
|
||||
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="comment"></span> </div>
|
||||
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="comment"> /// 'no' shouldn't be present in the 3*3 subgrid</span></div>
|
||||
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span><span class="comment"></span> <span class="keywordtype">int</span> sx = (i / 3) * 3;</div>
|
||||
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keywordtype">int</span> sy = (j / 3) * 3;</div>
|
||||
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> </div>
|
||||
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = sx; x < sx + 3; x++) {</div>
|
||||
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> y = sy; y < sy + 3; y++) {</div>
|
||||
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keywordflow">if</span> (mat[x][y] == no) {</div>
|
||||
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> }</div>
|
||||
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> }</div>
|
||||
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> }</div>
|
||||
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> </div>
|
||||
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a5a6c3c2b065ea1c07adf2f638f8efc43" name="a5a6c3c2b065ea1c07adf2f638f8efc43"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a5a6c3c2b065ea1c07adf2f638f8efc43">◆ </a></span>isSafe()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<size_t V> </div>
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">bool backtracking::isSafe </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>v</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > & </td>
|
||||
<td class="paramname"><em>graph</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > & </td>
|
||||
<td class="paramname"><em>color</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>c</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >A utility function to check if the current color assignment is safe for vertex v </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">V</td><td>number of vertices in the graph </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">v</td><td>index of graph vertex to check </td></tr>
|
||||
<tr><td class="paramname">graph</td><td>matrix of graph nonnectivity </td></tr>
|
||||
<tr><td class="paramname">color</td><td>vector of colors assigned to the graph nodes/vertices </td></tr>
|
||||
<tr><td class="paramname">c</td><td>color value to check for the node <code>v</code> </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if the color is safe to be assigned to the node </dd>
|
||||
<dd>
|
||||
<code>false</code> if the color is not safe to be assigned to the node </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> {</div>
|
||||
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < V; i++) {</div>
|
||||
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keywordflow">if</span> (<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[v][i] && c == color[i]) {</div>
|
||||
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> }</div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> }</div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span>}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a531de8cb2d4d16ca63353d9c72158257" name="a531de8cb2d4d16ca63353d9c72158257"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a531de8cb2d4d16ca63353d9c72158257">◆ </a></span>issafe()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<size_t V> </div>
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">bool backtracking::issafe </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>x</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>y</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > & </td>
|
||||
<td class="paramname"><em>sol</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >A utility function to check if i,j are valid indexes for N*N chessboard </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">V</td><td>number of vertices in array </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">x</td><td>current index in rows </td></tr>
|
||||
<tr><td class="paramname">y</td><td>current index in columns </td></tr>
|
||||
<tr><td class="paramname">sol</td><td>matrix where numbers are saved </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if .... </dd>
|
||||
<dd>
|
||||
<code>false</code> if .... </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> {</div>
|
||||
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <span class="keywordflow">return</span> (x < V && x >= 0 && y < V && y >= 0 && sol[x][y] == -1);</div>
|
||||
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a78540bcb5ef3473b2348cbc34748ec50" name="a78540bcb5ef3473b2348cbc34748ec50"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a78540bcb5ef3473b2348cbc34748ec50">◆ </a></span>minimax()</h2>
|
||||
|
||||
@@ -479,7 +172,9 @@ template<size_t T> </div>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >Check which number is the maximum/minimum in the array </p><dl class="params"><dt>Parameters</dt><dd>
|
||||
|
||||
<p>Check which is the maximum/minimum number in the array. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">depth</td><td>current depth in game tree </td></tr>
|
||||
<tr><td class="paramname">node_index</td><td>current index in array </td></tr>
|
||||
@@ -489,20 +184,20 @@ template<size_t T> </div>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>maximum or minimum number </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> {</div>
|
||||
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keywordflow">if</span> (depth == <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>) {</div>
|
||||
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="keywordflow">return</span> scores[node_index];</div>
|
||||
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> }</div>
|
||||
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> </div>
|
||||
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="keywordtype">int</span> v1 = <a class="code hl_function" href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">minimax</a>(depth + 1, node_index * 2, !is_max, scores, <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>);</div>
|
||||
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keywordtype">int</span> v2 = <a class="code hl_function" href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">minimax</a>(depth + 1, node_index * 2 + 1, !is_max, scores, <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>);</div>
|
||||
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> </div>
|
||||
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="keywordflow">return</span> is_max ? <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(v1, v2) : <a class="code hl_namespace" href="../../d8/dcc/namespacestd.html">std</a>::min(v1, v2);</div>
|
||||
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span>}</div>
|
||||
<dl class="section return"><dt>Returns</dt><dd>the maximum or minimum number </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> {</div>
|
||||
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="keywordflow">if</span> (depth == <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>) {</div>
|
||||
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="keywordflow">return</span> scores[node_index];</div>
|
||||
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> }</div>
|
||||
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> </div>
|
||||
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keywordtype">int</span> v1 = <a class="code hl_function" href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">minimax</a>(depth + 1, node_index * 2, !is_max, scores, <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>);</div>
|
||||
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keywordtype">int</span> v2 = <a class="code hl_function" href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">minimax</a>(depth + 1, node_index * 2 + 1, !is_max, scores, <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>);</div>
|
||||
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> </div>
|
||||
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keywordflow">return</span> is_max ? <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(v1, v2) : <a class="code hl_namespace" href="../../d8/dcc/namespacestd.html">std</a>::min(v1, v2);</div>
|
||||
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span>}</div>
|
||||
<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition:</b> avltree.cpp:31</div></div>
|
||||
<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
|
||||
<div class="ttc" id="anamespacebacktracking_html_a78540bcb5ef3473b2348cbc34748ec50"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">backtracking::minimax</a></div><div class="ttdeci">int minimax(int depth, int node_index, bool is_max, const std::array< int, T > &scores, double height)</div><div class="ttdef"><b>Definition:</b> minimax.cpp:38</div></div>
|
||||
<div class="ttc" id="anamespacebacktracking_html_a78540bcb5ef3473b2348cbc34748ec50"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">backtracking::minimax</a></div><div class="ttdeci">int minimax(int depth, int node_index, bool is_max, const std::array< int, T > &scores, double height)</div><div class="ttdoc">Check which is the maximum/minimum number in the array.</div><div class="ttdef"><b>Definition:</b> minimax.cpp:39</div></div>
|
||||
<div class="ttc" id="anamespacestd_html"><div class="ttname"><a href="../../d8/dcc/namespacestd.html">std</a></div><div class="ttdoc">STL namespace.</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
@@ -511,336 +206,6 @@ Here is the call graph for this function:</div>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="ae1a76e21cb3934368d01cea7672d3906" name="ae1a76e21cb3934368d01cea7672d3906"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae1a76e21cb3934368d01cea7672d3906">◆ </a></span>printMat()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<size_t V> </div>
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void backtracking::printMat </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > & </td>
|
||||
<td class="paramname"><em>mat</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > & </td>
|
||||
<td class="paramname"><em>starting_mat</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>n</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >Utility function to print matrix </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">V</td><td>number of vertices in array </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">mat</td><td>matrix where numbers are saved </td></tr>
|
||||
<tr><td class="paramname">starting_mat</td><td>copy of mat, required by printMat for highlighting the differences </td></tr>
|
||||
<tr><td class="paramname">n</td><td>number of times loop will run </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> {</div>
|
||||
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||||
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < n; j++) {</div>
|
||||
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keywordflow">if</span> (starting_mat[i][j] != mat[i][j]) {</div>
|
||||
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\033[93m"</span> << mat[i][j] << <span class="stringliteral">"\033[0m"</span> << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << mat[i][j] << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> }</div>
|
||||
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keywordflow">if</span> ((j + 1) % 3 == 0) {</div>
|
||||
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="charliteral">'\t'</span>;</div>
|
||||
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> }</div>
|
||||
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> }</div>
|
||||
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="keywordflow">if</span> ((i + 1) % 3 == 0) {</div>
|
||||
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> }</div>
|
||||
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> }</div>
|
||||
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> }</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><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/dc0/namespacebacktracking_ae1a76e21cb3934368d01cea7672d3906_cgraph.svg" width="283" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="a8cfb2d08840766ac4402196079308a36" name="a8cfb2d08840766ac4402196079308a36"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a8cfb2d08840766ac4402196079308a36">◆ </a></span>printSolution()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<size_t V> </div>
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void backtracking::printSolution </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > & </td>
|
||||
<td class="paramname"><em>color</em></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >A utility function to print solution </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">V</td><td>number of vertices in the graph </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">color</td><td>array of colors assigned to the nodes </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> {</div>
|
||||
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Following are the assigned colors"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span>& col : color) {</div>
|
||||
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << col;</div>
|
||||
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> }</div>
|
||||
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/dc0/namespacebacktracking_a8cfb2d08840766ac4402196079308a36_cgraph.svg" width="310" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="a932e38e8912742cedf7b5a837168e03a" name="a932e38e8912742cedf7b5a837168e03a"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a932e38e8912742cedf7b5a837168e03a">◆ </a></span>solve()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<size_t V> </div>
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">bool backtracking::solve </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>x</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>y</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>mov</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > & </td>
|
||||
<td class="paramname"><em>sol</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > & </td>
|
||||
<td class="paramname"><em>xmov</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V > & </td>
|
||||
<td class="paramname"><em>ymov</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >Knight's tour algorithm </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">V</td><td>number of vertices in array </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">x</td><td>current index in rows </td></tr>
|
||||
<tr><td class="paramname">y</td><td>current index in columns </td></tr>
|
||||
<tr><td class="paramname">mov</td><td>movement to be done </td></tr>
|
||||
<tr><td class="paramname">sol</td><td>matrix where numbers are saved </td></tr>
|
||||
<tr><td class="paramname">xmov</td><td>next move of knight (x coordinate) </td></tr>
|
||||
<tr><td class="paramname">ymov</td><td>next move of knight (y coordinate) </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if solution exists </dd>
|
||||
<dd>
|
||||
<code>false</code> if solution does not exist </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> {</div>
|
||||
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="keywordtype">int</span> k, xnext, ynext;</div>
|
||||
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> </div>
|
||||
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a> == V * V) {</div>
|
||||
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> }</div>
|
||||
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> </div>
|
||||
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="keywordflow">for</span> (k = 0; k < V; k++) {</div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> xnext = x + xmov[k];</div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> ynext = y + ymov[k];</div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> </div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">if</span> (backtracking::issafe<V>(xnext, ynext, sol)) {</div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> sol[xnext][ynext] = <a class="code hl_function" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a>;</div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> </div>
|
||||
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordflow">if</span> (backtracking::solve<V>(xnext, ynext, <a class="code hl_function" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a> + 1, sol, xmov, ymov) == <span class="keyword">true</span>) {</div>
|
||||
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> }</div>
|
||||
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> sol[xnext][ynext] = -1;</div>
|
||||
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> }</div>
|
||||
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> }</div>
|
||||
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> }</div>
|
||||
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> }</div>
|
||||
<div class="ttc" id="atower__of__hanoi_8cpp_html_af4cfc41e546f1f8d25f01e0804e8b61d"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a></div><div class="ttdeci">void mov(tower *From, tower *To)</div><div class="ttdef"><b>Definition:</b> tower_of_hanoi.cpp:39</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/dc0/namespacebacktracking_a932e38e8912742cedf7b5a837168e03a_cgraph.svg" width="242" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="a2b98ee79cdbc02ffd7b1f786f9696892" name="a2b98ee79cdbc02ffd7b1f786f9696892"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a2b98ee79cdbc02ffd7b1f786f9696892">◆ </a></span>solveSudoku()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<size_t V> </div>
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">bool backtracking::solveSudoku </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > & </td>
|
||||
<td class="paramname"><em>mat</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, V >, V > & </td>
|
||||
<td class="paramname"><em>starting_mat</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>i</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>j</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >Sudoku algorithm </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">V</td><td>number of vertices in array </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">mat</td><td>matrix where numbers are saved </td></tr>
|
||||
<tr><td class="paramname">starting_mat</td><td>copy of mat, required by printMat for highlighting the differences </td></tr>
|
||||
<tr><td class="paramname">i</td><td>current index in rows </td></tr>
|
||||
<tr><td class="paramname">j</td><td>current index in columns </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if 'no' was placed </dd>
|
||||
<dd>
|
||||
<code>false</code> 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 no.</p>
|
||||
<p ><a class="el" href="../../dd/d4f/class_solution.html">Solution</a> couldn't be found for any of the numbers provided</p>
|
||||
<div class="fragment"><div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> {<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span><span class="comment"> /// Base Case</span></div>
|
||||
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span><span class="comment"></span> <span class="keywordflow">if</span> (i == 9) {<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span><span class="comment"> /// Solved for 9 rows already</span></div>
|
||||
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span><span class="comment"></span> backtracking::printMat<V>(mat, starting_mat, 9);</div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> }</div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span><span class="comment"></span> </div>
|
||||
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span><span class="comment"> /// Crossed the last Cell in the row</span></div>
|
||||
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span><span class="comment"></span> <span class="keywordflow">if</span> (j == 9) {</div>
|
||||
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="keywordflow">return</span> backtracking::solveSudoku<V>(mat, starting_mat, i + 1, 0);</div>
|
||||
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> }</div>
|
||||
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span><span class="comment"></span> </div>
|
||||
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span><span class="comment"> /// Blue Cell - Skip</span></div>
|
||||
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span><span class="comment"></span> <span class="keywordflow">if</span> (mat[i][j] != 0) {</div>
|
||||
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="keywordflow">return</span> backtracking::solveSudoku<V>(mat, starting_mat, i, j + 1);</div>
|
||||
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> }<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span><span class="comment"> /// White Cell</span></div>
|
||||
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span><span class="comment"> /// Try to place every possible no</span></div>
|
||||
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span><span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> no = 1; no <= 9; no++) {</div>
|
||||
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keywordflow">if</span> (backtracking::isPossible<V>(mat, i, j, no, 9)) {<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span><span class="comment"> /// Place the 'no' - assuming a solution will exist</span></div>
|
||||
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span><span class="comment"></span> mat[i][j] = no;</div>
|
||||
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="keywordtype">bool</span> solution_found = backtracking::solveSudoku<V>(mat, starting_mat, i, j + 1);</div>
|
||||
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="keywordflow">if</span> (solution_found) {</div>
|
||||
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> }<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span><span class="comment"> /// Couldn't find a solution</span></div>
|
||||
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span><span class="comment"> /// loop will place the next no.</span></div>
|
||||
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span><span class="comment"></span> }</div>
|
||||
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> }<span class="comment"></span></div>
|
||||
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span><span class="comment"> /// Solution couldn't be found for any of the numbers provided</span></div>
|
||||
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span><span class="comment"></span> mat[i][j] = 0;</div>
|
||||
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -1,5 +1,5 @@
|
||||
<map id="backtracking::minimax" name="backtracking::minimax">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,56,159,83"/>
|
||||
<area shape="rect" id="node1" title="Check which is the maximum/minimum number in the array." alt="" coords="5,56,159,83"/>
|
||||
<area shape="rect" id="node2" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="213,5,272,32"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="207,56,279,83"/>
|
||||
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="208,107,277,133"/>
|
||||
|
||||
@@ -1 +1 @@
|
||||
64ee8950ed22a67c715fd9a460d662f0
|
||||
1d910c5a5ea702bdd1d2160747d7f1e5
|
||||
@@ -12,7 +12,7 @@
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<g id="a_node1"><a xlink:title="Check which is the maximum/minimum number in the array.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-38.5 0,-57.5 115,-57.5 115,-38.5 0,-38.5"/>
|
||||
<text text-anchor="middle" x="57.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::minimax</text>
|
||||
</a>
|
||||
|
||||
|
Before Width: | Height: | Size: 3.4 KiB After Width: | Height: | Size: 3.4 KiB |
@@ -1,4 +0,0 @@
|
||||
<map id="backtracking::printSolution" name="backtracking::printSolution">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,5,184,32"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="232,5,304,32"/>
|
||||
</map>
|
||||
@@ -1 +0,0 @@
|
||||
76aa189ff29434eb83d299f7fe02693a
|
||||
@@ -1,37 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
|
||||
-->
|
||||
<!-- Title: backtracking::printSolution Pages: 1 -->
|
||||
<svg width="232pt" height="28pt"
|
||||
viewBox="0.00 0.00 232.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
|
||||
<title>backtracking::printSolution</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 228,-24 228,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 134,-19.5 134,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="67" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::printSolution</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="170,-0.5 170,-19.5 224,-19.5 224,-0.5 170,-0.5"/>
|
||||
<text text-anchor="middle" x="197" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M134.25,-10C143.07,-10 151.84,-10 159.87,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="159.96,-13.5 169.96,-10 159.96,-6.5 159.96,-13.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 1.6 KiB |
@@ -1,4 +0,0 @@
|
||||
<map id="backtracking::solve" name="backtracking::solve">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,5,141,32"/>
|
||||
<area shape="rect" id="node2" href="$db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d" title=" " alt="" coords="189,5,236,32"/>
|
||||
</map>
|
||||
@@ -1 +0,0 @@
|
||||
a7ca739f6b1309a5ce6b2d8f07809d6e
|
||||
@@ -1,37 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
|
||||
-->
|
||||
<!-- Title: backtracking::solve Pages: 1 -->
|
||||
<svg width="181pt" height="28pt"
|
||||
viewBox="0.00 0.00 181.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
|
||||
<title>backtracking::solve</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 177,-24 177,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 102,-19.5 102,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="51" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::solve</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="138,-0.5 138,-19.5 173,-19.5 173,-0.5 138,-0.5"/>
|
||||
<text text-anchor="middle" x="155.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">mov</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M102.05,-10C110.85,-10 119.7,-10 127.56,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="127.57,-13.5 137.57,-10 127.57,-6.5 127.57,-13.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 1.6 KiB |
@@ -1,4 +0,0 @@
|
||||
<map id="backtracking::printMat" name="backtracking::printMat">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,5,157,32"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="205,5,277,32"/>
|
||||
</map>
|
||||
@@ -1 +0,0 @@
|
||||
024c41812a26be6509cf4d5996b5e6fc
|
||||
@@ -1,37 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
|
||||
-->
|
||||
<!-- Title: backtracking::printMat Pages: 1 -->
|
||||
<svg width="212pt" height="28pt"
|
||||
viewBox="0.00 0.00 212.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
|
||||
<title>backtracking::printMat</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 208,-24 208,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 114,-19.5 114,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="57" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::printMat</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="150,-0.5 150,-19.5 204,-19.5 204,-0.5 150,-0.5"/>
|
||||
<text text-anchor="middle" x="177" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M114.24,-10C122.9,-10 131.65,-10 139.73,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="139.89,-13.5 149.89,-10 139.89,-6.5 139.89,-13.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 1.6 KiB |
@@ -113,7 +113,7 @@ Include dependency graph for wildcard_matching.cpp:</div>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:db/dc0/namespacebacktracking"><td class="memItemLeft" align="right" valign="top">namespace  </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"> </td><td class="mdescRight">Backtracking algorithms. <br /></td></tr>
|
||||
<tr class="memdesc:db/dc0/namespacebacktracking"><td class="mdescLeft"> </td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:db/d03/namespacewildcard__matching"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d03/namespacewildcard__matching.html">wildcard_matching</a></td></tr>
|
||||
<tr class="memdesc:db/d03/namespacewildcard__matching"><td class="mdescLeft"> </td><td class="mdescRight">Functions for the <a href="https://www.geeksforgeeks.org/wildcard-pattern-matching/" target="_blank">Wildcard Matching</a> problem. <br /></td></tr>
|
||||
|
||||
@@ -101,8 +101,8 @@ $(document).ready(function(){initNavTree('dc/d5a/rat__maze_8cpp.html','../../');
|
||||
solve-a-rat-in-a-maze-c-java-pytho/".
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <array></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
<code>#include <cassert></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for rat_maze.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -113,7 +113,7 @@ Include dependency graph for rat_maze.cpp:</div>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:db/dc0/namespacebacktracking"><td class="memItemLeft" align="right" valign="top">namespace  </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"> </td><td class="mdescRight">Backtracking algorithms. <br /></td></tr>
|
||||
<tr class="memdesc:db/dc0/namespacebacktracking"><td class="mdescLeft"> </td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:d9/d60/namespacerat__maze"><td class="memItemLeft" align="right" valign="top">namespace  </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"> </td><td class="mdescRight">Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to-
|
||||
@@ -127,7 +127,7 @@ Functions</h2></td></tr>
|
||||
<tr class="memdesc:ab99107bfb4c6934cd4691868c66c0aa3"><td class="mdescLeft"> </td><td class="mdescRight">Solve rat maze problem. <a href="../../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3">More...</a><br /></td></tr>
|
||||
<tr class="separator:ab99107bfb4c6934cd4691868c66c0aa3"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
|
||||
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft"> </td><td class="mdescRight">Test implementations. <a href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr>
|
||||
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft"> </td><td class="mdescRight">Self-test implementations. <a href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr>
|
||||
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
||||
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <a href="../../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
|
||||
@@ -160,11 +160,11 @@ solve-a-rat-in-a-maze-c-java-pytho/". </p>
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> {</div>
|
||||
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <a class="code hl_function" href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run the tests</span></div>
|
||||
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span>}</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 class="fragment"><div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> {</div>
|
||||
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <a class="code hl_function" href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
|
||||
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span>}</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">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> rat_maze.cpp:86</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -230,40 +230,42 @@ template<size_t size> </div>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on end </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> {</div>
|
||||
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keywordflow">if</span> ((currposrow == size - 1) && (currposcol == size - 1)) {</div>
|
||||
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> soln[currposrow][currposcol] = 1;</div>
|
||||
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < size; ++j) {</div>
|
||||
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << soln[i][j] << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> }</div>
|
||||
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> }</div>
|
||||
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> soln[currposrow][currposcol] = 1;</div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> </div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="comment">// if there exist a solution by moving one step ahead in a column</span></div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keywordflow">if</span> ((currposcol < size - 1) && maze[currposrow][currposcol + 1] == 1 &&</div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <a class="code hl_function" href="../../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3">solveMaze</a>(currposrow, currposcol + 1, maze, soln)) {</div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> }</div>
|
||||
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> </div>
|
||||
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="comment">// if there exists a solution by moving one step ahead in a row</span></div>
|
||||
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="keywordflow">if</span> ((currposrow < size - 1) && maze[currposrow + 1][currposcol] == 1 &&</div>
|
||||
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <a class="code hl_function" href="../../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3">solveMaze</a>(currposrow + 1, currposcol, maze, soln)) {</div>
|
||||
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> }</div>
|
||||
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> </div>
|
||||
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// the backtracking part</span></div>
|
||||
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> soln[currposrow][currposcol] = 0;</div>
|
||||
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> }</div>
|
||||
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span>}</div>
|
||||
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if there exists a solution to move one step ahead in a column or in a row </dd>
|
||||
<dd>
|
||||
<code>false</code> for the backtracking part </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> {</div>
|
||||
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keywordflow">if</span> ((currposrow == size - 1) && (currposcol == size - 1)) {</div>
|
||||
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> soln[currposrow][currposcol] = 1;</div>
|
||||
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < size; ++j) {</div>
|
||||
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << soln[i][j] << <span class="stringliteral">" "</span>;</div>
|
||||
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> }</div>
|
||||
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> }</div>
|
||||
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> soln[currposrow][currposcol] = 1;</div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> </div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// if there exist a solution by moving one step ahead in a column</span></div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordflow">if</span> ((currposcol < size - 1) && maze[currposrow][currposcol + 1] == 1 &&</div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <a class="code hl_function" href="../../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3">solveMaze</a>(currposrow, currposcol + 1, maze, soln)) {</div>
|
||||
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> }</div>
|
||||
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> </div>
|
||||
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="comment">// if there exists a solution by moving one step ahead in a row</span></div>
|
||||
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">if</span> ((currposrow < size - 1) && maze[currposrow + 1][currposcol] == 1 &&</div>
|
||||
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <a class="code hl_function" href="../../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3">solveMaze</a>(currposrow + 1, currposcol, maze, soln)) {</div>
|
||||
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> }</div>
|
||||
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> </div>
|
||||
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// the backtracking part</span></div>
|
||||
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> soln[currposrow][currposcol] = 0;</div>
|
||||
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> }</div>
|
||||
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span>}</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< std::array< int, size >, size > &maze, std::array< std::array< int, size >, size > 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="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< std::array< int, size >, size > &maze, std::array< std::array< int, size >, size > soln)</div><div class="ttdoc">Solve rat maze problem.</div><div class="ttdef"><b>Definition:</b> rat_maze.cpp:47</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -296,31 +298,31 @@ Here is the call graph for this function:</div>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Test implementations. </p>
|
||||
<p>Self-test implementations. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html#a4">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp</a>, and <a class="el" href="../../dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html#a7">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp</a>.</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> {</div>
|
||||
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keyword">const</span> <span class="keywordtype">int</span> size = 4;</div>
|
||||
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<std::array<int, size></a>, size> maze = {</div>
|
||||
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, size></a>{1, 0, 1, 0}, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, size></a>{1, 0, 1, 1},</div>
|
||||
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, size></a>{1, 0, 0, 1}, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, size></a>{1, 1, 1, 1}};</div>
|
||||
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> </div>
|
||||
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<std::array<int, size></a>, size> soln{};</div>
|
||||
<div class="fragment"><div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> {</div>
|
||||
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="keyword">const</span> <span class="keywordtype">int</span> size = 4;</div>
|
||||
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<std::array<int, size></a>, size> maze = {</div>
|
||||
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, size></a>{1, 0, 1, 0}, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, size></a>{1, 0, 1, 1},</div>
|
||||
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, size></a>{1, 0, 0, 1}, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, size></a>{1, 1, 1, 1}};</div>
|
||||
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> </div>
|
||||
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="comment">// Backtracking: setup matrix solution to zero</span></div>
|
||||
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < size; ++j) {</div>
|
||||
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> soln[i][j] = 0;</div>
|
||||
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> }</div>
|
||||
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> }</div>
|
||||
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> </div>
|
||||
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordtype">int</span> currposrow = 0; <span class="comment">// Current position in rows</span></div>
|
||||
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="keywordtype">int</span> currposcol = 0; <span class="comment">// Current position in columns</span></div>
|
||||
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> </div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> assert(backtracking::rat_maze::solveMaze<size>(currposrow, currposcol, maze,</div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> soln) == 1);</div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span>}</div>
|
||||
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<std::array<int, size></a>, size> soln{};</div>
|
||||
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> </div>
|
||||
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="comment">// Backtracking: setup matrix solution to zero</span></div>
|
||||
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < size; ++j) {</div>
|
||||
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> soln[i][j] = 0;</div>
|
||||
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> }</div>
|
||||
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> }</div>
|
||||
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> </div>
|
||||
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="keywordtype">int</span> currposrow = 0; <span class="comment">// Current position in the rows</span></div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keywordtype">int</span> currposcol = 0; <span class="comment">// Current position in the columns</span></div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> </div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> assert(backtracking::rat_maze::solveMaze<size>(currposrow, currposcol, maze,</div>
|
||||
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> soln) == 1);</div>
|
||||
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span>}</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>
|
||||
|
||||
@@ -1,4 +1,4 @@
|
||||
<map id="main" name="main">
|
||||
<area shape="rect" id="node1" title="Main function." alt="" coords="5,5,56,32"/>
|
||||
<area shape="rect" id="node2" href="$dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Test implementations." alt="" coords="104,5,148,32"/>
|
||||
<area shape="rect" id="node2" href="$dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self-test implementations." alt="" coords="104,5,148,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
e9cb2c320b334c5cfdea47f24a882076
|
||||
7ba10ac4483e50558f203ca54a99561b
|
||||
@@ -21,7 +21,7 @@
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
|
||||
<g id="a_node2"><a xlink:href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self-test implementations.">
|
||||
<polygon fill="white" stroke="black" points="74,-0.5 74,-19.5 107,-19.5 107,-0.5 74,-0.5"/>
|
||||
<text text-anchor="middle" x="90.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
|
||||
</a>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.6 KiB After Width: | Height: | Size: 1.6 KiB |
@@ -228,11 +228,11 @@ $(document).ready(function(){initNavTree('dc/dc4/_2_users_2runner_2work_2_c-_plu
|
||||
<div class="line"> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line">}</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="agraph__coloring_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> graph_coloring.cpp:100</div></div>
|
||||
<div class="ttc" id="agraph__coloring_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> graph_coloring.cpp:112</div></div>
|
||||
<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:45</div></div>
|
||||
<div class="ttc" id="anamespacenumerical__methods_html"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></div><div class="ttdoc">for io operations</div></div>
|
||||
<div class="ttc" id="anamespacerunge__kutta_html"><div class="ttname"><a href="../../d2/de7/namespacerunge__kutta.html">runge_kutta</a></div><div class="ttdoc">Functions for Runge Kutta fourth order method.</div></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 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">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> rat_maze.cpp:86</div></div>
|
||||
<div class="ttc" id="arungekutta_8cpp_html_a450497475f5607333f9aca8f88901579"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a></div><div class="ttdeci">static double change(double x, double y)</div><div class="ttdoc">for using the vector container</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:33</div></div>
|
||||
<div class="ttc" id="arungekutta_8cpp_html_a7b9f40c7b5e9749cc550f19be3dc8856"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a></div><div class="ttdeci">double rungeKutta(double init_x, const double &init_y, const double &x, const double &h)</div><div class="ttdoc">the Runge Kutta method finds the value of integration of a function in the given limits....</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:57</div></div>
|
||||
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
|
||||
|
||||
@@ -228,12 +228,12 @@ $(document).ready(function(){initNavTree('dd/db0/_2_users_2runner_2work_2_c-_plu
|
||||
<div class="line"><span class="comment">/** @} */</span></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="agraph__coloring_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> graph_coloring.cpp:100</div></div>
|
||||
<div class="ttc" id="agraph__coloring_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> graph_coloring.cpp:112</div></div>
|
||||
<div class="ttc" id="agroup__sorting_html_ga135e4c638e3bcf548bd122b5f49a3e72"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a></div><div class="ttdeci">static void displayElements(const std::vector< T > &arr)</div><div class="ttdoc">Utility function used for printing the elements. Prints elements of the array after they're sorted us...</div><div class="ttdef"><b>Definition:</b> wiggle_sort.cpp:85</div></div>
|
||||
<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">Sorting algorithms.</div></div>
|
||||
<div class="ttc" id="anamespacewiggle__sort_html"><div class="ttname"><a href="../../d0/d52/namespacewiggle__sort.html">wiggle_sort</a></div><div class="ttdoc">Functions for Wiggle Sort algorithm.</div></div>
|
||||
<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></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 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">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> rat_maze.cpp:86</div></div>
|
||||
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
|
||||
<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
|
||||
<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
|
||||
|
||||
@@ -1,5 +1,5 @@
|
||||
<map id="backtracking/nqueen_print_all_solutions.cpp" name="backtracking/nqueen_print_all_solutions.cpp">
|
||||
<area shape="rect" id="node1" title="Eight Queens puzzle, printing all solutions" alt="" coords="5,5,167,47"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="7,95,80,121"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="104,95,156,121"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="17,95,69,121"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="93,95,167,121"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
d8d6c187a7d5e98f4d547bc61dc0153a
|
||||
aa60cc05e010af4966a4a6a3f8fdadb8
|
||||
@@ -23,8 +23,8 @@
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="1,-0.5 1,-19.5 56,-19.5 56,-0.5 1,-0.5"/>
|
||||
<text text-anchor="middle" x="28.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="9,-0.5 9,-19.5 48,-19.5 48,-0.5 9,-0.5"/>
|
||||
<text text-anchor="middle" x="28.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -38,8 +38,8 @@
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="74,-0.5 74,-19.5 113,-19.5 113,-0.5 74,-0.5"/>
|
||||
<text text-anchor="middle" x="93.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="66,-0.5 66,-19.5 121,-19.5 121,-0.5 66,-0.5"/>
|
||||
<text text-anchor="middle" x="93.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 2.4 KiB After Width: | Height: | Size: 2.4 KiB |
@@ -1,5 +1,5 @@
|
||||
<map id="backtracking/knight_tour.cpp" name="backtracking/knight_tour.cpp">
|
||||
<area shape="rect" id="node1" title="Knight's tour algorithm" alt="" coords="17,5,153,47"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="5,95,79,121"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="103,95,155,121"/>
|
||||
<area shape="rect" id="node1" title="Knight's tour algorithm" alt="" coords="6,5,142,47"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="5,95,57,121"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="81,95,155,121"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
774723c31e197f4fbb98e4ef59440a11
|
||||
f6922c2a0e708d2f83c28fee61231702
|
||||
@@ -13,9 +13,9 @@
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Knight's tour algorithm">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="8.5,-56.5 8.5,-86.5 110.5,-86.5 110.5,-56.5 8.5,-56.5"/>
|
||||
<text text-anchor="start" x="16.5" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking/knight</text>
|
||||
<text text-anchor="middle" x="59.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_tour.cpp</text>
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0.5,-56.5 0.5,-86.5 102.5,-86.5 102.5,-56.5 0.5,-56.5"/>
|
||||
<text text-anchor="start" x="8.5" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking/knight</text>
|
||||
<text text-anchor="middle" x="51.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_tour.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -23,31 +23,31 @@
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 55,-19.5 55,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="27.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 39,-19.5 39,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="19.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M51.92,-56.4C47.46,-48.11 41.78,-37.55 37.02,-28.71"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="39.98,-26.81 32.16,-19.66 33.81,-30.12 39.98,-26.81"/>
|
||||
<path fill="none" stroke="midnightblue" d="M43.92,-56.4C39.46,-48.11 33.78,-37.55 29.02,-28.71"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="31.98,-26.81 24.16,-19.66 25.81,-30.12 31.98,-26.81"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="73,-0.5 73,-19.5 112,-19.5 112,-0.5 73,-0.5"/>
|
||||
<text text-anchor="middle" x="92.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="57,-0.5 57,-19.5 112,-19.5 112,-0.5 57,-0.5"/>
|
||||
<text text-anchor="middle" x="84.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M67.32,-56.4C71.97,-48.02 77.9,-37.33 82.84,-28.42"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="85.91,-30.1 87.7,-19.66 79.79,-26.71 85.91,-30.1"/>
|
||||
<path fill="none" stroke="midnightblue" d="M59.32,-56.4C63.97,-48.02 69.9,-37.33 74.84,-28.42"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="77.91,-30.1 79.7,-19.66 71.79,-26.71 77.91,-30.1"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 2.3 KiB After Width: | Height: | Size: 2.3 KiB |
@@ -1,7 +1,7 @@
|
||||
<map id="backtracking/minimax.cpp" name="backtracking/minimax.cpp">
|
||||
<area shape="rect" id="node1" title="returns which is the longest/shortest number using minimax algorithm" alt="" coords="93,5,269,32"/>
|
||||
<area shape="rect" id="node1" title="returns which is the longest/shortest number using minimax algorithm" alt="" coords="85,5,261,32"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="5,80,83,107"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="107,80,165,107"/>
|
||||
<area shape="rect" id="node4" title=" " alt="" coords="190,80,263,107"/>
|
||||
<area shape="rect" id="node5" title=" " alt="" coords="287,80,339,107"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="107,80,159,107"/>
|
||||
<area shape="rect" id="node4" title=" " alt="" coords="184,80,243,107"/>
|
||||
<area shape="rect" id="node5" title=" " alt="" coords="267,80,341,107"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
bc0558b64a56f937ea7767c0dccc1311
|
||||
0eb1d84b8effa42335e0d15c5be7ddb2
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
|
||||
-->
|
||||
<!-- Title: backtracking/minimax.cpp Pages: 1 -->
|
||||
<svg width="259pt" height="84pt"
|
||||
viewBox="0.00 0.00 258.50 84.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="260pt" height="84pt"
|
||||
viewBox="0.00 0.00 259.50 84.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 80)">
|
||||
<title>backtracking/minimax.cpp</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 254.5,-80 254.5,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 255.5,-80 255.5,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="returns which is the longest/shortest number using minimax algorithm">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="66,-56.5 66,-75.5 198,-75.5 198,-56.5 66,-56.5"/>
|
||||
<text text-anchor="middle" x="132" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking/minimax.cpp</text>
|
||||
<polygon fill="#bfbfbf" stroke="black" points="60,-56.5 60,-75.5 192,-75.5 192,-56.5 60,-56.5"/>
|
||||
<text text-anchor="middle" x="126" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking/minimax.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -30,53 +30,53 @@
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M115.45,-56.32C99.01,-47.7 73.57,-34.36 54.53,-24.39"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="55.99,-21.2 45.51,-19.65 52.74,-27.4 55.99,-21.2"/>
|
||||
<path fill="none" stroke="midnightblue" d="M110.42,-56.32C95,-47.74 71.19,-34.49 53.29,-24.52"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="54.99,-21.46 44.55,-19.65 51.58,-27.58 54.99,-21.46"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="76,-0.5 76,-19.5 120,-19.5 120,-0.5 76,-0.5"/>
|
||||
<text text-anchor="middle" x="98" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cmath</text>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="76.5,-0.5 76.5,-19.5 115.5,-19.5 115.5,-0.5 76.5,-0.5"/>
|
||||
<text text-anchor="middle" x="96" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M126.39,-56.08C121.63,-48.53 114.68,-37.49 108.85,-28.23"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="111.8,-26.35 103.51,-19.75 105.88,-30.08 111.8,-26.35"/>
|
||||
<path fill="none" stroke="midnightblue" d="M121.05,-56.08C116.9,-48.61 110.85,-37.72 105.73,-28.52"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="108.78,-26.79 100.86,-19.75 102.66,-30.19 108.78,-26.79"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="138.5,-0.5 138.5,-19.5 193.5,-19.5 193.5,-0.5 138.5,-0.5"/>
|
||||
<text text-anchor="middle" x="166" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="134,-0.5 134,-19.5 178,-19.5 178,-0.5 134,-0.5"/>
|
||||
<text text-anchor="middle" x="156" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cmath</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M137.61,-56.08C142.37,-48.53 149.32,-37.49 155.15,-28.23"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="158.12,-30.08 160.49,-19.75 152.2,-26.35 158.12,-30.08"/>
|
||||
<path fill="none" stroke="midnightblue" d="M130.95,-56.08C135.1,-48.61 141.15,-37.72 146.27,-28.52"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="149.34,-30.19 151.14,-19.75 143.22,-26.79 149.34,-30.19"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="211.5,-0.5 211.5,-19.5 250.5,-19.5 250.5,-0.5 211.5,-0.5"/>
|
||||
<text text-anchor="middle" x="231" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
|
||||
<polygon fill="white" stroke="#bfbfbf" points="196.5,-0.5 196.5,-19.5 251.5,-19.5 251.5,-0.5 196.5,-0.5"/>
|
||||
<text text-anchor="middle" x="224" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M147.91,-56.32C163.64,-47.74 187.94,-34.49 206.21,-24.52"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="208.03,-27.52 215.13,-19.65 204.68,-21.37 208.03,-27.52"/>
|
||||
<path fill="none" stroke="midnightblue" d="M141.75,-56.32C157.32,-47.74 181.38,-34.49 199.46,-24.52"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="201.22,-27.55 208.29,-19.65 197.85,-21.42 201.22,-27.55"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 3.5 KiB After Width: | Height: | Size: 3.5 KiB |
@@ -94,10 +94,10 @@ $(document).ready(function(){initNavTree('df/d44/namespacen__queens__all__soluti
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle with all solutions.
|
||||
<p>Functions for the <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle with all solutions.
|
||||
<a href="../../df/d44/namespacen__queens__all__solutions.html#details">More...</a></p>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p >Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle with all solutions. </p>
|
||||
<div class="textblock"><p >Functions for the <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle with all solutions. </p>
|
||||
</div></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
|
||||
@@ -113,7 +113,7 @@ Include dependency graph for subarray_sum.cpp:</div>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:db/dc0/namespacebacktracking"><td class="memItemLeft" align="right" valign="top">namespace  </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"> </td><td class="mdescRight">Backtracking algorithms. <br /></td></tr>
|
||||
<tr class="memdesc:db/dc0/namespacebacktracking"><td class="mdescLeft"> </td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:df/d74/namespacesubarray__sum"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d74/namespacesubarray__sum.html">subarray_sum</a></td></tr>
|
||||
<tr class="memdesc:df/d74/namespacesubarray__sum"><td class="mdescLeft"> </td><td class="mdescRight">Functions for the <a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset sum</a> implementation. <br /></td></tr>
|
||||
|
||||
@@ -100,28 +100,30 @@ $(document).ready(function(){initNavTree('df/dfb/minimax_8cpp.html','../../'); i
|
||||
<p>returns which is the longest/shortest number using <a href="https://en.wikipedia.org/wiki/Minimax" target="_blank">minimax</a> algorithm
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <algorithm></code><br />
|
||||
<code>#include <array></code><br />
|
||||
<code>#include <cmath></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
<code>#include <array></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for minimax.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d36/minimax_8cpp__incl.svg" width="346" height="112"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d36/minimax_8cpp__incl.svg" width="347" height="112"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
</div><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:db/dc0/namespacebacktracking"><td class="memItemLeft" align="right" valign="top">namespace  </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"> </td><td class="mdescRight">Backtracking algorithms. <br /></td></tr>
|
||||
<tr class="memdesc:db/dc0/namespacebacktracking"><td class="mdescLeft"> </td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:a78540bcb5ef3473b2348cbc34748ec50"><td class="memTemplParams" colspan="2">template<size_t T> </td></tr>
|
||||
<tr class="memitem:a78540bcb5ef3473b2348cbc34748ec50"><td class="memTemplItemLeft" align="right" valign="top">int </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">backtracking::minimax</a> (int depth, int node_index, bool is_max, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, T > &scores, double <a class="el" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>)</td></tr>
|
||||
<tr class="memdesc:a78540bcb5ef3473b2348cbc34748ec50"><td class="mdescLeft"> </td><td class="mdescRight">Check which is the maximum/minimum number in the array. <a href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">More...</a><br /></td></tr>
|
||||
<tr class="separator:a78540bcb5ef3473b2348cbc34748ec50"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
||||
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <a href="../../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
|
||||
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
@@ -146,20 +148,22 @@ Functions</h2></td></tr>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p >Main function </p>
|
||||
<div class="fragment"><div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> {</div>
|
||||
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, 8></a> scores = {90, 23, 6, 33, 21, 65, 123, 34423};</div>
|
||||
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keywordtype">double</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> = log2(scores.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>());</div>
|
||||
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> </div>
|
||||
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Optimal value: "</span> << <a class="code hl_function" href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">backtracking::minimax</a>(0, 0, <span class="keyword">true</span>, scores, <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>)</div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span>}</div>
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> {</div>
|
||||
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int, 8></a> scores = {90, 23, 6, 33, 21, 65, 123, 34423};</div>
|
||||
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="keywordtype">double</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> = log2(scores.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>());</div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> </div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Optimal value: "</span></div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> << <a class="code hl_function" href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">backtracking::minimax</a>(0, 0, <span class="keyword">true</span>, scores, <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>) << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span>}</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 class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition:</b> avltree.cpp:31</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="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="anamespacebacktracking_html_a78540bcb5ef3473b2348cbc34748ec50"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">backtracking::minimax</a></div><div class="ttdeci">int minimax(int depth, int node_index, bool is_max, const std::array< int, T > &scores, double height)</div><div class="ttdef"><b>Definition:</b> minimax.cpp:38</div></div>
|
||||
<div class="ttc" id="anamespacebacktracking_html_a78540bcb5ef3473b2348cbc34748ec50"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">backtracking::minimax</a></div><div class="ttdeci">int minimax(int depth, int node_index, bool is_max, const std::array< int, T > &scores, double height)</div><div class="ttdoc">Check which is the maximum/minimum number in the array.</div><div class="ttdef"><b>Definition:</b> minimax.cpp:39</div></div>
|
||||
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/size.html">std::array::size</a></div><div class="ttdeci">T size(T... args)</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
|
||||
@@ -1,8 +1,8 @@
|
||||
<map id="main" name="main">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,93,56,120"/>
|
||||
<area shape="rect" id="node1" title="Main function." alt="" coords="5,93,56,120"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="145,5,217,32"/>
|
||||
<area shape="rect" id="node3" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="312,63,371,89"/>
|
||||
<area shape="rect" id="node4" href="$db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50" title=" " alt="" coords="104,131,257,157"/>
|
||||
<area shape="rect" id="node4" href="$db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50" title="Check which is the maximum/minimum number in the array." alt="" coords="104,131,257,157"/>
|
||||
<area shape="rect" id="node7" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="126,181,235,208"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="305,119,377,145"/>
|
||||
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="307,169,376,196"/>
|
||||
|
||||
@@ -1 +1 @@
|
||||
f820e35b382c1ac58f720143716559a6
|
||||
532bf98a357cd1689a34da98aa3c01fb
|
||||
@@ -12,7 +12,7 @@
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<g id="a_node1"><a xlink:title="Main function.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-66.5 0,-85.5 38,-85.5 38,-66.5 0,-66.5"/>
|
||||
<text text-anchor="middle" x="19" y="-73.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
|
||||
</a>
|
||||
@@ -51,7 +51,7 @@
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50" target="_top" xlink:title=" ">
|
||||
<g id="a_node4"><a xlink:href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50" target="_top" xlink:title="Check which is the maximum/minimum number in the array.">
|
||||
<polygon fill="white" stroke="black" points="74,-38.5 74,-57.5 189,-57.5 189,-38.5 74,-38.5"/>
|
||||
<text text-anchor="middle" x="131.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::minimax</text>
|
||||
</a>
|
||||
|
||||
|
Before Width: | Height: | Size: 6.0 KiB After Width: | Height: | Size: 6.0 KiB |
@@ -149,7 +149,6 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza
|
||||
<li>getConnectedComponents() : <a class="el" href="df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">graph</a></li>
|
||||
<li>getFailureArray() : <a class="el" href="d9/d03/namespacestring__search.html#a996573527312d5255e1495b879e8a34f">string_search</a></li>
|
||||
<li>gnomeSort() : <a class="el" href="d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting</a></li>
|
||||
<li>graphColoring() : <a class="el" href="db/dc0/namespacebacktracking.html#a29360ddb1bad75caa61ec895b6e71986">backtracking</a></li>
|
||||
</ul>
|
||||
|
||||
|
||||
@@ -164,9 +163,6 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza
|
||||
<li>insertionSort() : <a class="el" href="d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting</a></li>
|
||||
<li>integral_approx() : <a class="el" href="dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">math</a></li>
|
||||
<li>isBipartite() : <a class="el" href="df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b">graph</a></li>
|
||||
<li>isPossible() : <a class="el" href="db/dc0/namespacebacktracking.html#a80af16e57cfb6aaab2bf1da4c4db3308">backtracking</a></li>
|
||||
<li>issafe() : <a class="el" href="db/dc0/namespacebacktracking.html#a531de8cb2d4d16ca63353d9c72158257">backtracking</a></li>
|
||||
<li>isSafe() : <a class="el" href="db/dc0/namespacebacktracking.html#a5a6c3c2b065ea1c07adf2f638f8efc43">backtracking</a></li>
|
||||
</ul>
|
||||
|
||||
|
||||
@@ -222,8 +218,6 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza
|
||||
<li>power() : <a class="el" href="dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math</a></li>
|
||||
<li>power_of_two() : <a class="el" href="dd/d47/namespacemath.html#a89ab7d6c3e3ee72a8cbaa85127986185">math</a></li>
|
||||
<li>print() : <a class="el" href="da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures</a></li>
|
||||
<li>printMat() : <a class="el" href="db/dc0/namespacebacktracking.html#ae1a76e21cb3934368d01cea7672d3906">backtracking</a></li>
|
||||
<li>printSolution() : <a class="el" href="db/dc0/namespacebacktracking.html#a8cfb2d08840766ac4402196079308a36">backtracking</a></li>
|
||||
<li>PROBABILITY : <a class="el" href="d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61">data_structures</a></li>
|
||||
<li>putProber() : <a class="el" href="d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">double_hashing</a>, <a class="el" href="d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">linear_probing</a>, <a class="el" href="d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b">quadratic_probing</a></li>
|
||||
<li>pyramid_volume() : <a class="el" href="dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c">math</a></li>
|
||||
@@ -258,8 +252,6 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza
|
||||
<li>shift_left() : <a class="el" href="da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8">operations_on_datastructures</a></li>
|
||||
<li>shift_right() : <a class="el" href="da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86">operations_on_datastructures</a></li>
|
||||
<li>shuffle() : <a class="el" href="d5/d91/namespacesorting.html#a7bfe11bd4703eacd1dab93f25ec639c5">sorting</a></li>
|
||||
<li>solve() : <a class="el" href="db/dc0/namespacebacktracking.html#a932e38e8912742cedf7b5a837168e03a">backtracking</a></li>
|
||||
<li>solveSudoku() : <a class="el" href="db/dc0/namespacebacktracking.html#a2b98ee79cdbc02ffd7b1f786f9696892">backtracking</a></li>
|
||||
<li>sphere_surface_area() : <a class="el" href="dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656">math</a></li>
|
||||
<li>sphere_volume() : <a class="el" href="dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551">math</a></li>
|
||||
<li>spirograph() : <a class="el" href="da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac">spirograph</a></li>
|
||||
|
||||
@@ -149,7 +149,6 @@ $(document).ready(function(){initNavTree('namespacemembers_func.html',''); initR
|
||||
<li>getConnectedComponents() : <a class="el" href="df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">graph</a></li>
|
||||
<li>getFailureArray() : <a class="el" href="d9/d03/namespacestring__search.html#a996573527312d5255e1495b879e8a34f">string_search</a></li>
|
||||
<li>gnomeSort() : <a class="el" href="d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting</a></li>
|
||||
<li>graphColoring() : <a class="el" href="db/dc0/namespacebacktracking.html#a29360ddb1bad75caa61ec895b6e71986">backtracking</a></li>
|
||||
</ul>
|
||||
|
||||
|
||||
@@ -164,9 +163,6 @@ $(document).ready(function(){initNavTree('namespacemembers_func.html',''); initR
|
||||
<li>insertionSort() : <a class="el" href="d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting</a></li>
|
||||
<li>integral_approx() : <a class="el" href="dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">math</a></li>
|
||||
<li>isBipartite() : <a class="el" href="df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b">graph</a></li>
|
||||
<li>isPossible() : <a class="el" href="db/dc0/namespacebacktracking.html#a80af16e57cfb6aaab2bf1da4c4db3308">backtracking</a></li>
|
||||
<li>issafe() : <a class="el" href="db/dc0/namespacebacktracking.html#a531de8cb2d4d16ca63353d9c72158257">backtracking</a></li>
|
||||
<li>isSafe() : <a class="el" href="db/dc0/namespacebacktracking.html#a5a6c3c2b065ea1c07adf2f638f8efc43">backtracking</a></li>
|
||||
</ul>
|
||||
|
||||
|
||||
@@ -219,8 +215,6 @@ $(document).ready(function(){initNavTree('namespacemembers_func.html',''); initR
|
||||
<li>power() : <a class="el" href="dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math</a></li>
|
||||
<li>power_of_two() : <a class="el" href="dd/d47/namespacemath.html#a89ab7d6c3e3ee72a8cbaa85127986185">math</a></li>
|
||||
<li>print() : <a class="el" href="da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures</a></li>
|
||||
<li>printMat() : <a class="el" href="db/dc0/namespacebacktracking.html#ae1a76e21cb3934368d01cea7672d3906">backtracking</a></li>
|
||||
<li>printSolution() : <a class="el" href="db/dc0/namespacebacktracking.html#a8cfb2d08840766ac4402196079308a36">backtracking</a></li>
|
||||
<li>putProber() : <a class="el" href="d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">double_hashing</a>, <a class="el" href="d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">linear_probing</a>, <a class="el" href="d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b">quadratic_probing</a></li>
|
||||
<li>pyramid_volume() : <a class="el" href="dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c">math</a></li>
|
||||
</ul>
|
||||
@@ -254,8 +248,6 @@ $(document).ready(function(){initNavTree('namespacemembers_func.html',''); initR
|
||||
<li>shift_left() : <a class="el" href="da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8">operations_on_datastructures</a></li>
|
||||
<li>shift_right() : <a class="el" href="da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86">operations_on_datastructures</a></li>
|
||||
<li>shuffle() : <a class="el" href="d5/d91/namespacesorting.html#a7bfe11bd4703eacd1dab93f25ec639c5">sorting</a></li>
|
||||
<li>solve() : <a class="el" href="db/dc0/namespacebacktracking.html#a932e38e8912742cedf7b5a837168e03a">backtracking</a></li>
|
||||
<li>solveSudoku() : <a class="el" href="db/dc0/namespacebacktracking.html#a2b98ee79cdbc02ffd7b1f786f9696892">backtracking</a></li>
|
||||
<li>sphere_surface_area() : <a class="el" href="dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656">math</a></li>
|
||||
<li>sphere_volume() : <a class="el" href="dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551">math</a></li>
|
||||
<li>spirograph() : <a class="el" href="da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac">spirograph</a></li>
|
||||
|
||||
307
namespaces.html
307
namespaces.html
@@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
|
||||
<tr id="row_2_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d39/namespaceactivations.html" target="_self">activations</a></td><td class="desc">Various activation functions used in Neural network </td></tr>
|
||||
<tr id="row_3_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/db3/namespaceatbash.html" target="_self">atbash</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Atbash" target="_blank">Atbash Cipher</a> implementation </td></tr>
|
||||
<tr id="row_4_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="db/ddc/namespaceaystar__search.html" target="_self">aystar_search</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">A* Search</a> implementation </td></tr>
|
||||
<tr id="row_5_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="db/dc0/namespacebacktracking.html" target="_self">backtracking</a></td><td class="desc">Backtracking algorithms </td></tr>
|
||||
<tr id="row_5_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="db/dc0/namespacebacktracking.html" target="_self">backtracking</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
|
||||
<tr id="row_6_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/dc9/namespacebase64__encoding.html" target="_self">base64_encoding</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Base64" target="_blank">Base64 Encoding and Decoding</a> implementation </td></tr>
|
||||
<tr id="row_7_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d13/namespacebidirectional__dijkstra.html" target="_self">bidirectional_dijkstra</a></td><td class="desc">Functions for <a href="https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra" target="_blank">Bidirectional Dijkstra Shortest Path</a> algorithm </td></tr>
|
||||
<tr id="row_8_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d7a/namespacebinomial.html" target="_self">binomial</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Binomial_coefficient" target="_blank">Binomial coefficients</a> implementation </td></tr>
|
||||
@@ -169,158 +169,161 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
|
||||
<tr id="row_30_5_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html" target="_self">HKGraph</a></td><td class="desc">Represents Bipartite graph for Hopcroft Karp implementation </td></tr>
|
||||
<tr id="row_30_6_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_self">LowestCommonAncestor</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_30_7_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html" target="_self">RootedTree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_31_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d1c/namespacehamming__distance.html" target="_self">hamming_distance</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Hamming_distance" target="_blank">Hamming distance</a> implementation </td></tr>
|
||||
<tr id="row_32_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d0c/namespacehashing.html" target="_self">hashing</a></td><td class="desc">Hashing algorithms </td></tr>
|
||||
<tr id="row_33_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="db/d6f/namespaceheavy__light__decomposition.html" target="_self">heavy_light_decomposition</a></td><td class="desc">Heavy light decomposition algorithm </td></tr>
|
||||
<tr id="row_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d02/namespacehorspool.html" target="_self">horspool</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm" target="_blank">Horspool's</a> algorithm </td></tr>
|
||||
<tr id="row_35_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/de1/namespacehouse__robber.html" target="_self">house_robber</a></td><td class="desc">Functions for the <a href="https://labuladong.gitbook.io/algo-en/i.-dynamic-programming/houserobber" target="_blank">House Robber</a> algorithm </td></tr>
|
||||
<tr id="row_36_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d74/namespaceinorder__successor__of__bst.html" target="_self">inorder_successor_of_bst</a></td><td class="desc">Functions for the <a href="https://www.youtube.com/watch?v=5cPbNCrdotA" target="_blank">Inorder successor of a binary search tree</a> implementation </td></tr>
|
||||
<tr id="row_37_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d13/namespaceinversion.html" target="_self">inversion</a></td><td class="desc">Functions for counting inversions using Merge Sort algorithm </td></tr>
|
||||
<tr id="row_38_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d83/namespaceis__graph__bipartite.html" target="_self">is_graph_bipartite</a></td><td class="desc">Functions for checking whether a graph is bipartite or not </td></tr>
|
||||
<tr id="row_39_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d73/namespaceiterative__tree__traversals.html" target="_self">iterative_tree_traversals</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Tree_traversal" target="_blank">Traversal of the Tree</a> algorithm </td></tr>
|
||||
<tr id="row_40_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/da7/namespacejarvis.html" target="_self">jarvis</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm" target="_blank">Jarvis’s</a> algorithm </td></tr>
|
||||
<tr id="row_41_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d74/namespacekadane.html" target="_self">kadane</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm" target="_blank">Kadane</a> algorithm </td></tr>
|
||||
<tr id="row_42_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d41/namespacekaratsuba__algorithm.html" target="_self">karatsuba_algorithm</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Karatsuba_algorithm" target="_blank">Karatsuba algorithm for fast multiplication</a> </td></tr>
|
||||
<tr id="row_43_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/daf/namespace_knapsack.html" target="_self">Knapsack</a></td><td class="desc">Implementation of 0-1 <a class="el" href="d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> problem </td></tr>
|
||||
<tr id="row_44_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d2c/namespacelayers.html" target="_self">layers</a></td><td class="desc">This namespace contains layers used in MLP </td></tr>
|
||||
<tr id="row_45_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/d78/namespacelinear__algebra.html" target="_self">linear_algebra</a></td><td class="desc">For io operations </td></tr>
|
||||
<tr id="row_46_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_46_" class="arrow" onclick="toggleFolder('46_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d89/namespacelinear__probing.html" target="_self">linear_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Linear_probing" target="_blank">linear probing</a> algorithm </td></tr>
|
||||
<tr id="row_46_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d19/structlinear__probing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_47_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/dd1/namespacelinear__recurrence__matrix.html" target="_self">linear_recurrence_matrix</a></td><td class="desc">Functions for <a href="https://www.hackerearth.com/practice/notes/matrix-exponentiation-1/" target="_blank">Linear Recurrence Matrix</a> implementation </td></tr>
|
||||
<tr id="row_48_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/db0/namespacelinked__list.html" target="_self">linked_list</a></td><td class="desc">Functions for singly linked list algorithm </td></tr>
|
||||
<tr id="row_49_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d27/namespacelist__array.html" target="_self">list_array</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Dynamic_array" target="_blank">Dynamic Array</a> algorithm </td></tr>
|
||||
<tr id="row_50_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/dcd/namespacelru__cache.html" target="_self">lru_cache</a></td><td class="desc">Implementation of the <a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)" target="_blank">LRU caching algorithm</a> </td></tr>
|
||||
<tr id="row_51_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>lru_tests</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_52_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_52_" class="arrow" onclick="toggleFolder('52_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d77/namespacemachine__learning.html" target="_self">machine_learning</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">A* search algorithm</a> </td></tr>
|
||||
<tr id="row_52_0_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_52_0_" class="arrow" onclick="toggleFolder('52_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>aystar_search</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_52_0_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_52_0_0_" class="arrow" onclick="toggleFolder('52_0_0_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html" target="_self">AyStarSearch</a></td><td class="desc">A class defining <a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">A* search algorithm</a>. for some initial state and final state </td></tr>
|
||||
<tr id="row_52_0_0_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html" target="_self">comparison_operator</a></td><td class="desc">Custom comparator for open_list </td></tr>
|
||||
<tr id="row_52_0_0_1_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html" target="_self">Info</a></td><td class="desc">Struct that handles all the information related to the current state </td></tr>
|
||||
<tr id="row_52_0_1_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" target="_self">EightPuzzle</a></td><td class="desc">A class defining <a href="https://en.wikipedia.org/wiki/15_puzzle" target="_blank">EightPuzzle/15-Puzzle game</a> </td></tr>
|
||||
<tr id="row_52_1_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_52_1_" class="arrow" onclick="toggleFolder('52_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>neural_network</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_52_1_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>activations</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_52_1_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_52_1_1_" class="arrow" onclick="toggleFolder('52_1_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>layers</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_52_1_1_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html" target="_self">DenseLayer</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_52_1_2_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>util_functions</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_52_1_3_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" target="_self">NeuralNetwork</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_52_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d30/classmachine__learning_1_1adaline.html" target="_self">adaline</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_53_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d93/namespacemagic__sequence.html" target="_self">magic_sequence</a></td><td class="desc">Functions for the <a href="https://www.csplib.org/Problems/prob019/" target="_blank">Magic sequence</a> implementation </td></tr>
|
||||
<tr id="row_54_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/dc6/namespacemanacher.html" target="_self">manacher</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Longest_palindromic_substring" target="_blank">Manacher's Algorithm</a> implementation </td></tr>
|
||||
<tr id="row_55_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_55_" class="arrow" onclick="toggleFolder('55_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d47/namespacemath.html" target="_self">math</a></td><td class="desc">For M_PI definition and pow() </td></tr>
|
||||
<tr id="row_55_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>binomial</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_55_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>fibonacci_sum</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_55_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>modular_division</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_55_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>monte_carlo</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_55_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>n_bonacci</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_55_5_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_55_5_" class="arrow" onclick="toggleFolder('55_5_')">►</span><span class="icona"><span class="icon">N</span></span><b>ncr_modulo_p</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_55_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" target="_self">NCRModuloP</a></td><td class="desc">Class which contains all methods required for calculating nCr mod p </td></tr>
|
||||
<tr id="row_55_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>vector_cross</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_56_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d43/namespace_m_d5.html" target="_self">MD5</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/MD5" target="_blank">MD5</a> algorithm implementation </td></tr>
|
||||
<tr id="row_57_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/dd4/namespacemedian__search.html" target="_self">median_search</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Median_search" target="_blank">Median search</a> algorithm </td></tr>
|
||||
<tr id="row_58_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d0a/namespacemerge__insertion.html" target="_self">merge_insertion</a></td><td class="desc">Combined Intersion-Merge sorting algorithm </td></tr>
|
||||
<tr id="row_59_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/db8/namespacemincoins__topdown.html" target="_self">mincoins_topdown</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/coin-change/" target="_blank">minimum coin exchange</a> problem </td></tr>
|
||||
<tr id="row_60_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d12/namespace_minimum.html" target="_self">Minimum</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Edit_distance" target="_blank">Minimum Edit Distance</a> algorithm </td></tr>
|
||||
<tr id="row_61_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d1/d64/namespacemodular__division.html" target="_self">modular_division</a></td><td class="desc">Functions for <a href="https://www.geeksforgeeks.org/modular-division" target="_blank">Modular Division</a> implementation </td></tr>
|
||||
<tr id="row_62_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/da4/namespacemonte__carlo.html" target="_self">monte_carlo</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> implementation </td></tr>
|
||||
<tr id="row_63_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d8d/namespacemorse.html" target="_self">morse</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Morse_code" target="_blank">Morse Code</a> </td></tr>
|
||||
<tr id="row_64_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d36/namespacen__bonacci.html" target="_self">n_bonacci</a></td><td class="desc">Functions for the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> implementation </td></tr>
|
||||
<tr id="row_65_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/da1/namespacen__queens.html" target="_self">n_queens</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle </td></tr>
|
||||
<tr id="row_66_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d44/namespacen__queens__all__solutions.html" target="_self">n_queens_all_solutions</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle with all solutions </td></tr>
|
||||
<tr id="row_67_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d14/namespacen__queens__optimized.html" target="_self">n_queens_optimized</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle optimized </td></tr>
|
||||
<tr id="row_68_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/db9/namespacencr__modulo__p.html" target="_self">ncr_modulo_p</a></td><td class="desc">Functions for <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a> implementation </td></tr>
|
||||
<tr id="row_69_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d2e/namespaceneural__network.html" target="_self">neural_network</a></td><td class="desc">Neural Network or Multilayer Perceptron </td></tr>
|
||||
<tr id="row_70_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d1/de0/namespacenumerical__methods.html" target="_self">numerical_methods</a></td><td class="desc">For io operations </td></tr>
|
||||
<tr id="row_71_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_71_" class="arrow" onclick="toggleFolder('71_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/d6d/namespaceoperations__on__datastructures.html" target="_self">operations_on_datastructures</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
|
||||
<tr id="row_71_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_71_0_" class="arrow" onclick="toggleFolder('71_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>inorder_traversal_of_bst</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_71_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST.">Node</a> structure representing a single node in BST </td></tr>
|
||||
<tr id="row_71_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_71_1_" class="arrow" onclick="toggleFolder('71_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>reverse_binary_tree</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_71_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html" target="_self">BinaryTree</a></td><td class="desc">A Binary Tree class that implements a Binary Search Tree (BST) by default </td></tr>
|
||||
<tr id="row_71_1_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a> struct that represents a single node in a Binary Tree </td></tr>
|
||||
<tr id="row_71_2_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_71_2_" class="arrow" onclick="toggleFolder('71_2_')">►</span><span class="icona"><span class="icon">N</span></span><b>trie_operations</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_71_2_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
|
||||
<tr id="row_72_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_72_" class="arrow" onclick="toggleFolder('72_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d6f/namespaceothers.html" target="_self">others</a></td><td class="desc">For <code>vector</code> </td></tr>
|
||||
<tr id="row_72_0_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_72_0_" class="arrow" onclick="toggleFolder('72_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>iterative_tree_traversals</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_72_0_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html" target="_self">BinaryTree</a></td><td class="desc">Defines the functions associated with the binary tree </td></tr>
|
||||
<tr id="row_72_0_1_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_self">Node</a></td><td class="desc">Defines the structure of a node of the tree </td></tr>
|
||||
<tr id="row_72_1_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_72_1_" class="arrow" onclick="toggleFolder('72_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>lru_cache</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_72_1_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html" target="_self">LRUCache</a></td><td class="desc">LRU cache class </td></tr>
|
||||
<tr id="row_72_2_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_72_2_" class="arrow" onclick="toggleFolder('72_2_')">►</span><span class="icona"><span class="icon">N</span></span><b>postfix_expression</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_72_2_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
|
||||
<tr id="row_73_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d89/namespacepalindrome__partitioning.html" target="_self">palindrome_partitioning</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/palindrome-partitioning-ii/" target="_blank">Palindrome Partitioning</a> algorithm </td></tr>
|
||||
<tr id="row_74_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d10/namespacepancake__sort.html" target="_self">pancake_sort</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Pancake_sorting" target="_blank">Pancake sort</a> algorithm </td></tr>
|
||||
<tr id="row_75_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/de6/namespacepostfix__expression.html" target="_self">postfix_expression</a></td><td class="desc">Functions for Postfix Expression algorithm </td></tr>
|
||||
<tr id="row_76_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d88/namespaceprefix__sum__array.html" target="_self">prefix_sum_array</a></td><td class="desc">Range sum queries using prefix-sum-array </td></tr>
|
||||
<tr id="row_77_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_77_" class="arrow" onclick="toggleFolder('77_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/ded/namespaceprobability.html" target="_self">probability</a></td><td class="desc">Probability algorithms </td></tr>
|
||||
<tr id="row_77_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_77_0_" class="arrow" onclick="toggleFolder('77_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>geometric_dist</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_77_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html" target="_self">geometric_distribution</a></td><td class="desc">A class to model the geometric distribution </td></tr>
|
||||
<tr id="row_77_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_77_1_" class="arrow" onclick="toggleFolder('77_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>windowed_median</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_77_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" target="_self">WindowedMedian</a></td><td class="desc">A class to calculate the median of a leading sliding window at the back of a stream of integer values </td></tr>
|
||||
<tr id="row_78_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/d3b/namespaceqr__algorithm.html" target="_self">qr_algorithm</a></td><td class="desc">Functions to compute <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> of any rectangular matrix </td></tr>
|
||||
<tr id="row_79_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_79_" class="arrow" onclick="toggleFolder('79_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/dd2/namespacequadratic__probing.html" target="_self">quadratic_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Quadratic_probing" target="_blank">quadratic probing</a> algorithm </td></tr>
|
||||
<tr id="row_79_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_80_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d70/namespacequeue__using__array.html" target="_self">queue_using_array</a></td><td class="desc">Functions for <a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/" target="_blank">Queue using Array</a> implementation </td></tr>
|
||||
<tr id="row_81_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/dda/namespaceradix__sort.html" target="_self">radix_sort</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Radix_sort" target="_blank">Radix sort</a> algorithm </td></tr>
|
||||
<tr id="row_82_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d6b/namespacerandom__pivot__quick__sort.html" target="_self">random_pivot_quick_sort</a></td><td class="desc">Functions for the <a href="https://www.sanfoundry.com/cpp-program-implement-quick-sort-using-randomisation" target="_blank">Random Pivot Quick Sort</a> implementation </td></tr>
|
||||
<tr id="row_83_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_83_" class="arrow" onclick="toggleFolder('83_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d69/namespacerange__queries.html" target="_self">range_queries</a></td><td class="desc">Algorithms and Data Structures that support range queries and updates </td></tr>
|
||||
<tr id="row_83_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_83_0_" class="arrow" onclick="toggleFolder('83_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>heavy_light_decomposition</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_83_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">HLD</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
|
||||
<tr id="row_83_0_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">SG</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr>
|
||||
<tr id="row_83_0_2_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">Tree</a></td><td class="desc">A Basic <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting </td></tr>
|
||||
<tr id="row_83_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>prefix_sum_array</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_83_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>sparse_table</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_83_3_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_83_3_" class="arrow" onclick="toggleFolder('83_3_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html" target="_self">perSegTree</a></td><td class="desc">Range query here is range sum, but the code can be modified to make different queries like range max or min </td></tr>
|
||||
<tr id="row_83_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_84_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d60/namespacerat__maze.html" target="_self">rat_maze</a></td><td class="desc">Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to-
|
||||
<tr id="row_31_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d08/namespacegraph__coloring.html" target="_self">graph_coloring</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Graph_coloring" target="_blank">Graph Coloring</a> algorithm, </td></tr>
|
||||
<tr id="row_32_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d1c/namespacehamming__distance.html" target="_self">hamming_distance</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Hamming_distance" target="_blank">Hamming distance</a> implementation </td></tr>
|
||||
<tr id="row_33_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d0c/namespacehashing.html" target="_self">hashing</a></td><td class="desc">Hashing algorithms </td></tr>
|
||||
<tr id="row_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="db/d6f/namespaceheavy__light__decomposition.html" target="_self">heavy_light_decomposition</a></td><td class="desc">Heavy light decomposition algorithm </td></tr>
|
||||
<tr id="row_35_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d02/namespacehorspool.html" target="_self">horspool</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm" target="_blank">Horspool's</a> algorithm </td></tr>
|
||||
<tr id="row_36_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/de1/namespacehouse__robber.html" target="_self">house_robber</a></td><td class="desc">Functions for the <a href="https://labuladong.gitbook.io/algo-en/i.-dynamic-programming/houserobber" target="_blank">House Robber</a> algorithm </td></tr>
|
||||
<tr id="row_37_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d74/namespaceinorder__successor__of__bst.html" target="_self">inorder_successor_of_bst</a></td><td class="desc">Functions for the <a href="https://www.youtube.com/watch?v=5cPbNCrdotA" target="_blank">Inorder successor of a binary search tree</a> implementation </td></tr>
|
||||
<tr id="row_38_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d13/namespaceinversion.html" target="_self">inversion</a></td><td class="desc">Functions for counting inversions using Merge Sort algorithm </td></tr>
|
||||
<tr id="row_39_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d83/namespaceis__graph__bipartite.html" target="_self">is_graph_bipartite</a></td><td class="desc">Functions for checking whether a graph is bipartite or not </td></tr>
|
||||
<tr id="row_40_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d73/namespaceiterative__tree__traversals.html" target="_self">iterative_tree_traversals</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Tree_traversal" target="_blank">Traversal of the Tree</a> algorithm </td></tr>
|
||||
<tr id="row_41_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/da7/namespacejarvis.html" target="_self">jarvis</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm" target="_blank">Jarvis’s</a> algorithm </td></tr>
|
||||
<tr id="row_42_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d74/namespacekadane.html" target="_self">kadane</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm" target="_blank">Kadane</a> algorithm </td></tr>
|
||||
<tr id="row_43_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d41/namespacekaratsuba__algorithm.html" target="_self">karatsuba_algorithm</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Karatsuba_algorithm" target="_blank">Karatsuba algorithm for fast multiplication</a> </td></tr>
|
||||
<tr id="row_44_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/daf/namespace_knapsack.html" target="_self">Knapsack</a></td><td class="desc">Implementation of 0-1 <a class="el" href="d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> problem </td></tr>
|
||||
<tr id="row_45_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d1/db6/namespaceknight__tour.html" target="_self">knight_tour</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Knight%27s_tour" target="_blank">Knight's tour</a> algorithm </td></tr>
|
||||
<tr id="row_46_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d2c/namespacelayers.html" target="_self">layers</a></td><td class="desc">This namespace contains layers used in MLP </td></tr>
|
||||
<tr id="row_47_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/d78/namespacelinear__algebra.html" target="_self">linear_algebra</a></td><td class="desc">For io operations </td></tr>
|
||||
<tr id="row_48_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_48_" class="arrow" onclick="toggleFolder('48_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d89/namespacelinear__probing.html" target="_self">linear_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Linear_probing" target="_blank">linear probing</a> algorithm </td></tr>
|
||||
<tr id="row_48_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d19/structlinear__probing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_49_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/dd1/namespacelinear__recurrence__matrix.html" target="_self">linear_recurrence_matrix</a></td><td class="desc">Functions for <a href="https://www.hackerearth.com/practice/notes/matrix-exponentiation-1/" target="_blank">Linear Recurrence Matrix</a> implementation </td></tr>
|
||||
<tr id="row_50_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/db0/namespacelinked__list.html" target="_self">linked_list</a></td><td class="desc">Functions for singly linked list algorithm </td></tr>
|
||||
<tr id="row_51_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d27/namespacelist__array.html" target="_self">list_array</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Dynamic_array" target="_blank">Dynamic Array</a> algorithm </td></tr>
|
||||
<tr id="row_52_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/dcd/namespacelru__cache.html" target="_self">lru_cache</a></td><td class="desc">Implementation of the <a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)" target="_blank">LRU caching algorithm</a> </td></tr>
|
||||
<tr id="row_53_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>lru_tests</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_54_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_54_" class="arrow" onclick="toggleFolder('54_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d77/namespacemachine__learning.html" target="_self">machine_learning</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">A* search algorithm</a> </td></tr>
|
||||
<tr id="row_54_0_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_54_0_" class="arrow" onclick="toggleFolder('54_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>aystar_search</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_54_0_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_54_0_0_" class="arrow" onclick="toggleFolder('54_0_0_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html" target="_self">AyStarSearch</a></td><td class="desc">A class defining <a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">A* search algorithm</a>. for some initial state and final state </td></tr>
|
||||
<tr id="row_54_0_0_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html" target="_self">comparison_operator</a></td><td class="desc">Custom comparator for open_list </td></tr>
|
||||
<tr id="row_54_0_0_1_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html" target="_self">Info</a></td><td class="desc">Struct that handles all the information related to the current state </td></tr>
|
||||
<tr id="row_54_0_1_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" target="_self">EightPuzzle</a></td><td class="desc">A class defining <a href="https://en.wikipedia.org/wiki/15_puzzle" target="_blank">EightPuzzle/15-Puzzle game</a> </td></tr>
|
||||
<tr id="row_54_1_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_54_1_" class="arrow" onclick="toggleFolder('54_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>neural_network</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_54_1_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>activations</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_54_1_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_54_1_1_" class="arrow" onclick="toggleFolder('54_1_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>layers</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_54_1_1_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html" target="_self">DenseLayer</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_54_1_2_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>util_functions</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_54_1_3_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" target="_self">NeuralNetwork</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_54_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d30/classmachine__learning_1_1adaline.html" target="_self">adaline</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_55_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d93/namespacemagic__sequence.html" target="_self">magic_sequence</a></td><td class="desc">Functions for the <a href="https://www.csplib.org/Problems/prob019/" target="_blank">Magic sequence</a> implementation </td></tr>
|
||||
<tr id="row_56_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/dc6/namespacemanacher.html" target="_self">manacher</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Longest_palindromic_substring" target="_blank">Manacher's Algorithm</a> implementation </td></tr>
|
||||
<tr id="row_57_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_57_" class="arrow" onclick="toggleFolder('57_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d47/namespacemath.html" target="_self">math</a></td><td class="desc">For M_PI definition and pow() </td></tr>
|
||||
<tr id="row_57_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>binomial</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_57_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>fibonacci_sum</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_57_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>modular_division</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_57_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>monte_carlo</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_57_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>n_bonacci</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_57_5_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_57_5_" class="arrow" onclick="toggleFolder('57_5_')">►</span><span class="icona"><span class="icon">N</span></span><b>ncr_modulo_p</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_57_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" target="_self">NCRModuloP</a></td><td class="desc">Class which contains all methods required for calculating nCr mod p </td></tr>
|
||||
<tr id="row_57_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>vector_cross</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_58_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d43/namespace_m_d5.html" target="_self">MD5</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/MD5" target="_blank">MD5</a> algorithm implementation </td></tr>
|
||||
<tr id="row_59_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/dd4/namespacemedian__search.html" target="_self">median_search</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Median_search" target="_blank">Median search</a> algorithm </td></tr>
|
||||
<tr id="row_60_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d0a/namespacemerge__insertion.html" target="_self">merge_insertion</a></td><td class="desc">Combined Intersion-Merge sorting algorithm </td></tr>
|
||||
<tr id="row_61_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/db8/namespacemincoins__topdown.html" target="_self">mincoins_topdown</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/coin-change/" target="_blank">minimum coin exchange</a> problem </td></tr>
|
||||
<tr id="row_62_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d12/namespace_minimum.html" target="_self">Minimum</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Edit_distance" target="_blank">Minimum Edit Distance</a> algorithm </td></tr>
|
||||
<tr id="row_63_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d1/d64/namespacemodular__division.html" target="_self">modular_division</a></td><td class="desc">Functions for <a href="https://www.geeksforgeeks.org/modular-division" target="_blank">Modular Division</a> implementation </td></tr>
|
||||
<tr id="row_64_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/da4/namespacemonte__carlo.html" target="_self">monte_carlo</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> implementation </td></tr>
|
||||
<tr id="row_65_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d8d/namespacemorse.html" target="_self">morse</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Morse_code" target="_blank">Morse Code</a> </td></tr>
|
||||
<tr id="row_66_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d36/namespacen__bonacci.html" target="_self">n_bonacci</a></td><td class="desc">Functions for the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> implementation </td></tr>
|
||||
<tr id="row_67_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/da1/namespacen__queens.html" target="_self">n_queens</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle </td></tr>
|
||||
<tr id="row_68_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d44/namespacen__queens__all__solutions.html" target="_self">n_queens_all_solutions</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle with all solutions </td></tr>
|
||||
<tr id="row_69_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d14/namespacen__queens__optimized.html" target="_self">n_queens_optimized</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle optimized </td></tr>
|
||||
<tr id="row_70_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/db9/namespacencr__modulo__p.html" target="_self">ncr_modulo_p</a></td><td class="desc">Functions for <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a> implementation </td></tr>
|
||||
<tr id="row_71_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d2e/namespaceneural__network.html" target="_self">neural_network</a></td><td class="desc">Neural Network or Multilayer Perceptron </td></tr>
|
||||
<tr id="row_72_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d1/de0/namespacenumerical__methods.html" target="_self">numerical_methods</a></td><td class="desc">For io operations </td></tr>
|
||||
<tr id="row_73_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_73_" class="arrow" onclick="toggleFolder('73_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/d6d/namespaceoperations__on__datastructures.html" target="_self">operations_on_datastructures</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
|
||||
<tr id="row_73_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_73_0_" class="arrow" onclick="toggleFolder('73_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>inorder_traversal_of_bst</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_73_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST.">Node</a> structure representing a single node in BST </td></tr>
|
||||
<tr id="row_73_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_73_1_" class="arrow" onclick="toggleFolder('73_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>reverse_binary_tree</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_73_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html" target="_self">BinaryTree</a></td><td class="desc">A Binary Tree class that implements a Binary Search Tree (BST) by default </td></tr>
|
||||
<tr id="row_73_1_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a> struct that represents a single node in a Binary Tree </td></tr>
|
||||
<tr id="row_73_2_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_73_2_" class="arrow" onclick="toggleFolder('73_2_')">►</span><span class="icona"><span class="icon">N</span></span><b>trie_operations</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_73_2_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
|
||||
<tr id="row_74_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_74_" class="arrow" onclick="toggleFolder('74_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d6f/namespaceothers.html" target="_self">others</a></td><td class="desc">For <code>vector</code> </td></tr>
|
||||
<tr id="row_74_0_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_74_0_" class="arrow" onclick="toggleFolder('74_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>iterative_tree_traversals</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_74_0_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html" target="_self">BinaryTree</a></td><td class="desc">Defines the functions associated with the binary tree </td></tr>
|
||||
<tr id="row_74_0_1_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_self">Node</a></td><td class="desc">Defines the structure of a node of the tree </td></tr>
|
||||
<tr id="row_74_1_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_74_1_" class="arrow" onclick="toggleFolder('74_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>lru_cache</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_74_1_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html" target="_self">LRUCache</a></td><td class="desc">LRU cache class </td></tr>
|
||||
<tr id="row_74_2_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_74_2_" class="arrow" onclick="toggleFolder('74_2_')">►</span><span class="icona"><span class="icon">N</span></span><b>postfix_expression</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_74_2_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
|
||||
<tr id="row_75_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d89/namespacepalindrome__partitioning.html" target="_self">palindrome_partitioning</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/palindrome-partitioning-ii/" target="_blank">Palindrome Partitioning</a> algorithm </td></tr>
|
||||
<tr id="row_76_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d10/namespacepancake__sort.html" target="_self">pancake_sort</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Pancake_sorting" target="_blank">Pancake sort</a> algorithm </td></tr>
|
||||
<tr id="row_77_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/de6/namespacepostfix__expression.html" target="_self">postfix_expression</a></td><td class="desc">Functions for Postfix Expression algorithm </td></tr>
|
||||
<tr id="row_78_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d88/namespaceprefix__sum__array.html" target="_self">prefix_sum_array</a></td><td class="desc">Range sum queries using prefix-sum-array </td></tr>
|
||||
<tr id="row_79_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_79_" class="arrow" onclick="toggleFolder('79_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/ded/namespaceprobability.html" target="_self">probability</a></td><td class="desc">Probability algorithms </td></tr>
|
||||
<tr id="row_79_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_79_0_" class="arrow" onclick="toggleFolder('79_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>geometric_dist</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_79_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html" target="_self">geometric_distribution</a></td><td class="desc">A class to model the geometric distribution </td></tr>
|
||||
<tr id="row_79_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_79_1_" class="arrow" onclick="toggleFolder('79_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>windowed_median</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_79_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" target="_self">WindowedMedian</a></td><td class="desc">A class to calculate the median of a leading sliding window at the back of a stream of integer values </td></tr>
|
||||
<tr id="row_80_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/d3b/namespaceqr__algorithm.html" target="_self">qr_algorithm</a></td><td class="desc">Functions to compute <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> of any rectangular matrix </td></tr>
|
||||
<tr id="row_81_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_81_" class="arrow" onclick="toggleFolder('81_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/dd2/namespacequadratic__probing.html" target="_self">quadratic_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Quadratic_probing" target="_blank">quadratic probing</a> algorithm </td></tr>
|
||||
<tr id="row_81_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_82_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d70/namespacequeue__using__array.html" target="_self">queue_using_array</a></td><td class="desc">Functions for <a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/" target="_blank">Queue using Array</a> implementation </td></tr>
|
||||
<tr id="row_83_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/dda/namespaceradix__sort.html" target="_self">radix_sort</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Radix_sort" target="_blank">Radix sort</a> algorithm </td></tr>
|
||||
<tr id="row_84_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d6b/namespacerandom__pivot__quick__sort.html" target="_self">random_pivot_quick_sort</a></td><td class="desc">Functions for the <a href="https://www.sanfoundry.com/cpp-program-implement-quick-sort-using-randomisation" target="_blank">Random Pivot Quick Sort</a> implementation </td></tr>
|
||||
<tr id="row_85_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_85_" class="arrow" onclick="toggleFolder('85_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d69/namespacerange__queries.html" target="_self">range_queries</a></td><td class="desc">Algorithms and Data Structures that support range queries and updates </td></tr>
|
||||
<tr id="row_85_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_85_0_" class="arrow" onclick="toggleFolder('85_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>heavy_light_decomposition</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_85_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">HLD</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
|
||||
<tr id="row_85_0_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">SG</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr>
|
||||
<tr id="row_85_0_2_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">Tree</a></td><td class="desc">A Basic <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting </td></tr>
|
||||
<tr id="row_85_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>prefix_sum_array</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_85_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>sparse_table</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_85_3_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_85_3_" class="arrow" onclick="toggleFolder('85_3_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html" target="_self">perSegTree</a></td><td class="desc">Range query here is range sum, but the code can be modified to make different queries like range max or min </td></tr>
|
||||
<tr id="row_85_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_86_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d60/namespacerat__maze.html" target="_self">rat_maze</a></td><td class="desc">Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to-
|
||||
solve-a-rat-in-a-maze-c-java-pytho/" </td></tr>
|
||||
<tr id="row_85_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="dc/dc5/namespacereverse__binary__tree.html" target="_self">reverse_binary_tree</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/reverse-tree-path/" target="_blank">Reverse a Binary Tree</a> implementation </td></tr>
|
||||
<tr id="row_86_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/de7/namespacerunge__kutta.html" target="_self">runge_kutta</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods" target="_blank">Runge Kutta fourth order</a> method </td></tr>
|
||||
<tr id="row_87_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/dda/namespacesaddleback.html" target="_self">saddleback</a></td><td class="desc">Function for implementing <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a> </td></tr>
|
||||
<tr id="row_88_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_88_" class="arrow" onclick="toggleFolder('88_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/dca/namespacesearch.html" target="_self">search</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
|
||||
<tr id="row_88_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>cycle_detection</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_88_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>median_search</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_88_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>saddleback</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_88_3_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_88_3_" class="arrow" onclick="toggleFolder('88_3_')">►</span><span class="icona"><span class="icon">N</span></span><b>sublist_search</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_88_3_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
|
||||
<tr id="row_89_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d4a/namespaceselection__sort__recursive.html" target="_self">selection_sort_recursive</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection sort</a> implementation using recursion </td></tr>
|
||||
<tr id="row_90_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/dd3/namespace_s_h_a.html" target="_self">SHA</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/SHA-1" target="_blank">SHA-1</a> algorithm implementation </td></tr>
|
||||
<tr id="row_91_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/deb/namespaceshortest__common__supersequence.html" target="_self">shortest_common_supersequence</a></td><td class="desc">Shortest Common Super Sequence algorithm </td></tr>
|
||||
<tr id="row_92_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d91/namespacesorting.html" target="_self">sorting</a></td><td class="desc">Sorting algorithms </td></tr>
|
||||
<tr id="row_93_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d55/namespacesparse__table.html" target="_self">sparse_table</a></td><td class="desc">Functions for Implementation of <a href="https://brilliant.org/wiki/sparse-table/" target="_blank">Sparse Table</a> </td></tr>
|
||||
<tr id="row_94_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/dd3/namespacespirograph.html" target="_self">spirograph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_95_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d1c/namespacestack__using__queue.html" target="_self">stack_using_queue</a></td><td class="desc">Functions for the <a href="https://www.studytonight.com/data-structures/stack-using-queue" target="_blank">Stack Using Queue</a> implementation </td></tr>
|
||||
<tr id="row_96_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_96_" class="arrow" onclick="toggleFolder('96_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/dcf/namespacestatistics.html" target="_self">statistics</a></td><td class="desc">Statistical algorithms </td></tr>
|
||||
<tr id="row_96_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">stats_computer1</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_96_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">stats_computer2</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_97_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_97_" class="arrow" onclick="toggleFolder('97_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/dcc/namespacestd.html" target="_self">std</a></td><td class="desc">STL namespace </td></tr>
|
||||
<tr id="row_97_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>chrono</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_97_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>experimental</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_97_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>rel_ops</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_97_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>this_thread</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_97_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">is_arithmetic< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_97_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">is_arithmetic< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_97_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">is_integral< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_97_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">is_integral< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_97_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">is_unsigned< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_97_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">is_unsigned< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_98_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d1d/namespacestrand.html" target="_self">strand</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Strand_sort" target="_blank">Strand Sort</a> algorithm </td></tr>
|
||||
<tr id="row_99_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d03/namespacestring__search.html" target="_self">string_search</a></td><td class="desc">String search algorithms </td></tr>
|
||||
<tr id="row_100_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/dcb/namespacestrings.html" target="_self">strings</a></td><td class="desc">Algorithms with strings </td></tr>
|
||||
<tr id="row_101_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d74/namespacesubarray__sum.html" target="_self">subarray_sum</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset sum</a> implementation </td></tr>
|
||||
<tr id="row_102_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/def/namespacesublist__search.html" target="_self">sublist_search</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list" target="_blank">Sublist Search</a> implementation </td></tr>
|
||||
<tr id="row_103_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d95/namespace_subsets.html" target="_self">Subsets</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset Sum</a> problem </td></tr>
|
||||
<tr id="row_104_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/df4/namespacetests.html" target="_self">tests</a></td><td class="desc">Testcases to check Union of Two Arrays </td></tr>
|
||||
<tr id="row_105_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/dab/namespacetree__234.html" target="_self">tree_234</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree" target="_blank">2–3–4 tree</a> </td></tr>
|
||||
<tr id="row_106_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d8e/namespacetrie__operations.html" target="_self">trie_operations</a></td><td class="desc">Functions for <a href="https://iq.opengenus.org/autocomplete-using-trie-data-structure/" target="_blank">Trie datastructure</a> implementation </td></tr>
|
||||
<tr id="row_107_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d0a/namespacetrie__using__hashmap.html" target="_self">trie_using_hashmap</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure using hashmap implementation </td></tr>
|
||||
<tr id="row_108_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/d17/namespaceutil__functions.html" target="_self">util_functions</a></td><td class="desc">Various utility functions used in Neural network </td></tr>
|
||||
<tr id="row_109_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d91/namespacevector__cross.html" target="_self">vector_cross</a></td><td class="desc">Functions for Vector Cross Product algorithms </td></tr>
|
||||
<tr id="row_110_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/da2/namespacevigenere.html" target="_self">vigenere</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Vigen%C3%A8re_cipher" target="_blank">vigenère cipher</a> algorithm </td></tr>
|
||||
<tr id="row_111_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d21/namespacewave__sort.html" target="_self">wave_sort</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/sort-array-wave-form-2/" target="_blank">Wave sort</a> implementation </td></tr>
|
||||
<tr id="row_112_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d52/namespacewiggle__sort.html" target="_self">wiggle_sort</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/wiggle-sort-ii/" target="_blank">Wiggle Sort</a> algorithm </td></tr>
|
||||
<tr id="row_113_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="db/d03/namespacewildcard__matching.html" target="_self">wildcard_matching</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/wildcard-pattern-matching/" target="_blank">Wildcard Matching</a> problem </td></tr>
|
||||
<tr id="row_114_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d21/namespacewindowed__median.html" target="_self">windowed_median</a></td><td class="desc">Functions for the Windowed Median algorithm implementation </td></tr>
|
||||
<tr id="row_115_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d53/namespaceword__break.html" target="_self">word_break</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/word-break/" target="_blank">Word Break</a> problem </td></tr>
|
||||
<tr id="row_116_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d47/namespace_x_o_r.html" target="_self">XOR</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/XOR_cipher" target="_blank">XOR cipher</a> algorithm </td></tr>
|
||||
<tr id="row_87_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="dc/dc5/namespacereverse__binary__tree.html" target="_self">reverse_binary_tree</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/reverse-tree-path/" target="_blank">Reverse a Binary Tree</a> implementation </td></tr>
|
||||
<tr id="row_88_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/de7/namespacerunge__kutta.html" target="_self">runge_kutta</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods" target="_blank">Runge Kutta fourth order</a> method </td></tr>
|
||||
<tr id="row_89_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/dda/namespacesaddleback.html" target="_self">saddleback</a></td><td class="desc">Function for implementing <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a> </td></tr>
|
||||
<tr id="row_90_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_90_" class="arrow" onclick="toggleFolder('90_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/dca/namespacesearch.html" target="_self">search</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
|
||||
<tr id="row_90_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>cycle_detection</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_90_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>median_search</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_90_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>saddleback</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_90_3_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_90_3_" class="arrow" onclick="toggleFolder('90_3_')">►</span><span class="icona"><span class="icon">N</span></span><b>sublist_search</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_90_3_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
|
||||
<tr id="row_91_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d4a/namespaceselection__sort__recursive.html" target="_self">selection_sort_recursive</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection sort</a> implementation using recursion </td></tr>
|
||||
<tr id="row_92_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/dd3/namespace_s_h_a.html" target="_self">SHA</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/SHA-1" target="_blank">SHA-1</a> algorithm implementation </td></tr>
|
||||
<tr id="row_93_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/deb/namespaceshortest__common__supersequence.html" target="_self">shortest_common_supersequence</a></td><td class="desc">Shortest Common Super Sequence algorithm </td></tr>
|
||||
<tr id="row_94_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d91/namespacesorting.html" target="_self">sorting</a></td><td class="desc">Sorting algorithms </td></tr>
|
||||
<tr id="row_95_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d55/namespacesparse__table.html" target="_self">sparse_table</a></td><td class="desc">Functions for Implementation of <a href="https://brilliant.org/wiki/sparse-table/" target="_blank">Sparse Table</a> </td></tr>
|
||||
<tr id="row_96_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/dd3/namespacespirograph.html" target="_self">spirograph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_97_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d1c/namespacestack__using__queue.html" target="_self">stack_using_queue</a></td><td class="desc">Functions for the <a href="https://www.studytonight.com/data-structures/stack-using-queue" target="_blank">Stack Using Queue</a> implementation </td></tr>
|
||||
<tr id="row_98_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_98_" class="arrow" onclick="toggleFolder('98_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/dcf/namespacestatistics.html" target="_self">statistics</a></td><td class="desc">Statistical algorithms </td></tr>
|
||||
<tr id="row_98_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">stats_computer1</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_98_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">stats_computer2</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_99_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_99_" class="arrow" onclick="toggleFolder('99_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/dcc/namespacestd.html" target="_self">std</a></td><td class="desc">STL namespace </td></tr>
|
||||
<tr id="row_99_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>chrono</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_99_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>experimental</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_99_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>rel_ops</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_99_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><b>this_thread</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_99_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">is_arithmetic< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_99_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">is_arithmetic< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_99_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">is_integral< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_99_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">is_integral< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_99_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">is_unsigned< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_99_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">is_unsigned< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_100_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d1d/namespacestrand.html" target="_self">strand</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Strand_sort" target="_blank">Strand Sort</a> algorithm </td></tr>
|
||||
<tr id="row_101_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d03/namespacestring__search.html" target="_self">string_search</a></td><td class="desc">String search algorithms </td></tr>
|
||||
<tr id="row_102_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/dcb/namespacestrings.html" target="_self">strings</a></td><td class="desc">Algorithms with strings </td></tr>
|
||||
<tr id="row_103_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d74/namespacesubarray__sum.html" target="_self">subarray_sum</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset sum</a> implementation </td></tr>
|
||||
<tr id="row_104_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/def/namespacesublist__search.html" target="_self">sublist_search</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list" target="_blank">Sublist Search</a> implementation </td></tr>
|
||||
<tr id="row_105_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d95/namespace_subsets.html" target="_self">Subsets</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset Sum</a> problem </td></tr>
|
||||
<tr id="row_106_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d9f/namespacesudoku__solver.html" target="_self">sudoku_solver</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Sudoku" target="_blank">Sudoku Solver</a> implementation </td></tr>
|
||||
<tr id="row_107_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/df4/namespacetests.html" target="_self">tests</a></td><td class="desc">Testcases to check Union of Two Arrays </td></tr>
|
||||
<tr id="row_108_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/dab/namespacetree__234.html" target="_self">tree_234</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree" target="_blank">2–3–4 tree</a> </td></tr>
|
||||
<tr id="row_109_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d8e/namespacetrie__operations.html" target="_self">trie_operations</a></td><td class="desc">Functions for <a href="https://iq.opengenus.org/autocomplete-using-trie-data-structure/" target="_blank">Trie datastructure</a> implementation </td></tr>
|
||||
<tr id="row_110_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d0a/namespacetrie__using__hashmap.html" target="_self">trie_using_hashmap</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure using hashmap implementation </td></tr>
|
||||
<tr id="row_111_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/d17/namespaceutil__functions.html" target="_self">util_functions</a></td><td class="desc">Various utility functions used in Neural network </td></tr>
|
||||
<tr id="row_112_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d91/namespacevector__cross.html" target="_self">vector_cross</a></td><td class="desc">Functions for Vector Cross Product algorithms </td></tr>
|
||||
<tr id="row_113_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/da2/namespacevigenere.html" target="_self">vigenere</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Vigen%C3%A8re_cipher" target="_blank">vigenère cipher</a> algorithm </td></tr>
|
||||
<tr id="row_114_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d21/namespacewave__sort.html" target="_self">wave_sort</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/sort-array-wave-form-2/" target="_blank">Wave sort</a> implementation </td></tr>
|
||||
<tr id="row_115_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d52/namespacewiggle__sort.html" target="_self">wiggle_sort</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/wiggle-sort-ii/" target="_blank">Wiggle Sort</a> algorithm </td></tr>
|
||||
<tr id="row_116_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="db/d03/namespacewildcard__matching.html" target="_self">wildcard_matching</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/wildcard-pattern-matching/" target="_blank">Wildcard Matching</a> problem </td></tr>
|
||||
<tr id="row_117_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d21/namespacewindowed__median.html" target="_self">windowed_median</a></td><td class="desc">Functions for the Windowed Median algorithm implementation </td></tr>
|
||||
<tr id="row_118_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d53/namespaceword__break.html" target="_self">word_break</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/word-break/" target="_blank">Word Break</a> problem </td></tr>
|
||||
<tr id="row_119_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d47/namespace_x_o_r.html" target="_self">XOR</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/XOR_cipher" target="_blank">XOR cipher</a> algorithm </td></tr>
|
||||
</table>
|
||||
</div><!-- directory -->
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -6,6 +6,15 @@ var namespaces_dup =
|
||||
[ "atbash", "de/db3/namespaceatbash.html", null ],
|
||||
[ "aystar_search", "db/ddc/namespaceaystar__search.html", null ],
|
||||
[ "backtracking", "db/dc0/namespacebacktracking.html", [
|
||||
[ "graph_coloring", null, [
|
||||
[ "graphColoring", "d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c", null ],
|
||||
[ "isSafe", "d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d", null ],
|
||||
[ "printSolution", "d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07", null ]
|
||||
] ],
|
||||
[ "knight_tour", null, [
|
||||
[ "issafe", "d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2", null ],
|
||||
[ "solve", "d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9", null ]
|
||||
] ],
|
||||
[ "n_queens", null, [
|
||||
[ "isSafe", "d4/d3e/n__queens_8cpp.html#a5730b6683f6adcf5c5ef75cf53dc7160", null ],
|
||||
[ "printSolution", "d4/d3e/n__queens_8cpp.html#a40ae0c7fd04eb20e7f3bff13fc6a5808", null ],
|
||||
@@ -30,18 +39,15 @@ var namespaces_dup =
|
||||
[ "subset_sum", null, [
|
||||
[ "number_of_subsets", "d2/d5a/subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99", null ]
|
||||
] ],
|
||||
[ "sudoku_solver", null, [
|
||||
[ "isPossible", "d6/d7b/sudoku__solve_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0", null ],
|
||||
[ "printMat", "d6/d7b/sudoku__solve_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac", null ],
|
||||
[ "solveSudoku", "d6/d7b/sudoku__solve_8cpp.html#ac911c8bca8556206ff64461b2424866b", null ]
|
||||
] ],
|
||||
[ "wildcard_matching", null, [
|
||||
[ "dpTable", "dc/d14/wildcard__matching_8cpp.html#a4a5b107f93db24e424b12899fa692c5a", null ]
|
||||
] ],
|
||||
[ "graphColoring", "db/dc0/namespacebacktracking.html#a29360ddb1bad75caa61ec895b6e71986", null ],
|
||||
[ "isPossible", "db/dc0/namespacebacktracking.html#a80af16e57cfb6aaab2bf1da4c4db3308", null ],
|
||||
[ "isSafe", "db/dc0/namespacebacktracking.html#a5a6c3c2b065ea1c07adf2f638f8efc43", null ],
|
||||
[ "issafe", "db/dc0/namespacebacktracking.html#a531de8cb2d4d16ca63353d9c72158257", null ],
|
||||
[ "minimax", "db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50", null ],
|
||||
[ "printMat", "db/dc0/namespacebacktracking.html#ae1a76e21cb3934368d01cea7672d3906", null ],
|
||||
[ "printSolution", "db/dc0/namespacebacktracking.html#a8cfb2d08840766ac4402196079308a36", null ],
|
||||
[ "solve", "db/dc0/namespacebacktracking.html#a932e38e8912742cedf7b5a837168e03a", null ],
|
||||
[ "solveSudoku", "db/dc0/namespacebacktracking.html#a2b98ee79cdbc02ffd7b1f786f9696892", null ]
|
||||
[ "minimax", "db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50", null ]
|
||||
] ],
|
||||
[ "base64_encoding", "d9/dc9/namespacebase64__encoding.html", null ],
|
||||
[ "bidirectional_dijkstra", "d4/d13/namespacebidirectional__dijkstra.html", null ],
|
||||
@@ -104,6 +110,7 @@ var namespaces_dup =
|
||||
[ "geometry", "d5/d5f/namespacegeometry.html", "d5/d5f/namespacegeometry" ],
|
||||
[ "gram_schmidt", "d4/d0f/namespacegram__schmidt.html", null ],
|
||||
[ "graph", "df/dce/namespacegraph.html", "df/dce/namespacegraph" ],
|
||||
[ "graph_coloring", "d7/d08/namespacegraph__coloring.html", null ],
|
||||
[ "hamming_distance", "d4/d1c/namespacehamming__distance.html", null ],
|
||||
[ "hashing", "d6/d0c/namespacehashing.html", null ],
|
||||
[ "heavy_light_decomposition", "db/d6f/namespaceheavy__light__decomposition.html", null ],
|
||||
@@ -117,6 +124,7 @@ var namespaces_dup =
|
||||
[ "kadane", "d6/d74/namespacekadane.html", null ],
|
||||
[ "karatsuba_algorithm", "de/d41/namespacekaratsuba__algorithm.html", null ],
|
||||
[ "Knapsack", "d7/daf/namespace_knapsack.html", null ],
|
||||
[ "knight_tour", "d1/db6/namespaceknight__tour.html", null ],
|
||||
[ "layers", "d5/d2c/namespacelayers.html", null ],
|
||||
[ "linear_algebra", "d3/d78/namespacelinear__algebra.html", null ],
|
||||
[ "linear_probing", "d8/d89/namespacelinear__probing.html", "d8/d89/namespacelinear__probing" ],
|
||||
@@ -267,6 +275,7 @@ var namespaces_dup =
|
||||
[ "subarray_sum", "df/d74/namespacesubarray__sum.html", null ],
|
||||
[ "sublist_search", "d9/def/namespacesublist__search.html", null ],
|
||||
[ "Subsets", "de/d95/namespace_subsets.html", null ],
|
||||
[ "sudoku_solver", "d8/d9f/namespacesudoku__solver.html", null ],
|
||||
[ "tests", "d9/df4/namespacetests.html", [
|
||||
[ "test1", "d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5", null ],
|
||||
[ "test2", "d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669", null ],
|
||||
|
||||
@@ -133,18 +133,18 @@ var NAVTREEINDEX =
|
||||
"annotated.html",
|
||||
"cpp/iterator/distance.html",
|
||||
"cpp/thread/lock.html",
|
||||
"d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963",
|
||||
"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57",
|
||||
"d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4",
|
||||
"d5/d67/complex__numbers_8cpp.html#a44d5f25b573e870accdf26fd32b8484d",
|
||||
"d6/d57/array__right__rotation_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d",
|
||||
"d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817",
|
||||
"d9/d03/namespacestring__search.html#a26a58225ce7d3fa9d4c2f5349a65ed93",
|
||||
"da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d",
|
||||
"db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705",
|
||||
"dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff",
|
||||
"de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0",
|
||||
"dir_0eaa691bd54ab0922ca7f50599de6d22.html"
|
||||
"d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363",
|
||||
"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24",
|
||||
"d4/d3e/n__queens_8cpp.html#a40ae0c7fd04eb20e7f3bff13fc6a5808",
|
||||
"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf",
|
||||
"d6/d4e/namespaceciphers.html",
|
||||
"d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d",
|
||||
"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f",
|
||||
"da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e",
|
||||
"db/d9a/classuint128__t.html",
|
||||
"dd/d1c/classhash__chain.html#a28d3adffc0126beeef63bce0846fb8f5",
|
||||
"de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d",
|
||||
"df/dfb/minimax_8cpp.html#a78540bcb5ef3473b2348cbc34748ec50"
|
||||
];
|
||||
|
||||
var SYNCONMSG = 'click to disable panel synchronisation';
|
||||
|
||||
496
navtreeindex0.js
496
navtreeindex0.js
@@ -2,252 +2,252 @@ var NAVTREEINDEX0 =
|
||||
{
|
||||
"annotated.html":[10,0],
|
||||
"classes.html":[10,1],
|
||||
"cpp/algorithm/accumulate.html":[9,0,97,14],
|
||||
"cpp/algorithm/adjacent_difference.html":[9,0,97,18],
|
||||
"cpp/algorithm/adjacent_find.html":[9,0,97,19],
|
||||
"cpp/algorithm/all_any_none_of.html":[9,0,97,299],
|
||||
"cpp/algorithm/all_any_none_of.html":[9,0,97,22],
|
||||
"cpp/algorithm/all_any_none_of.html":[9,0,97,24],
|
||||
"cpp/algorithm/binary_search.html":[9,0,97,64],
|
||||
"cpp/algorithm/bsearch.html":[9,0,97,67],
|
||||
"cpp/algorithm/copy.html":[9,0,97,80],
|
||||
"cpp/algorithm/copy.html":[9,0,97,78],
|
||||
"cpp/algorithm/copy_backward.html":[9,0,97,79],
|
||||
"cpp/algorithm/copy_n.html":[9,0,97,81],
|
||||
"cpp/algorithm/count.html":[9,0,97,86],
|
||||
"cpp/algorithm/count.html":[9,0,97,85],
|
||||
"cpp/algorithm/equal.html":[9,0,97,102],
|
||||
"cpp/algorithm/equal_range.html":[9,0,97,103],
|
||||
"cpp/algorithm/fill.html":[9,0,97,132],
|
||||
"cpp/algorithm/fill_n.html":[9,0,97,133],
|
||||
"cpp/algorithm/find.html":[9,0,97,134],
|
||||
"cpp/algorithm/find.html":[9,0,97,137],
|
||||
"cpp/algorithm/find.html":[9,0,97,138],
|
||||
"cpp/algorithm/find_end.html":[9,0,97,135],
|
||||
"cpp/algorithm/find_first_of.html":[9,0,97,136],
|
||||
"cpp/algorithm/for_each.html":[9,0,97,147],
|
||||
"cpp/algorithm/generate.html":[9,0,97,169],
|
||||
"cpp/algorithm/generate_n.html":[9,0,97,171],
|
||||
"cpp/algorithm/includes.html":[9,0,97,192],
|
||||
"cpp/algorithm/inner_product.html":[9,0,97,193],
|
||||
"cpp/algorithm/inplace_merge.html":[9,0,97,194],
|
||||
"cpp/algorithm/iota.html":[9,0,97,197],
|
||||
"cpp/algorithm/is_heap.html":[9,0,97,198],
|
||||
"cpp/algorithm/is_heap_until.html":[9,0,97,199],
|
||||
"cpp/algorithm/is_partitioned.html":[9,0,97,200],
|
||||
"cpp/algorithm/is_permutation.html":[9,0,97,201],
|
||||
"cpp/algorithm/is_sorted.html":[9,0,97,202],
|
||||
"cpp/algorithm/is_sorted_until.html":[9,0,97,203],
|
||||
"cpp/algorithm/iter_swap.html":[9,0,97,233],
|
||||
"cpp/algorithm/lexicographical_compare.html":[9,0,97,239],
|
||||
"cpp/algorithm/lower_bound.html":[9,0,97,252],
|
||||
"cpp/algorithm/make_heap.html":[9,0,97,256],
|
||||
"cpp/algorithm/max.html":[9,0,97,262],
|
||||
"cpp/algorithm/max_element.html":[9,0,97,263],
|
||||
"cpp/algorithm/merge.html":[9,0,97,279],
|
||||
"cpp/algorithm/min.html":[9,0,97,280],
|
||||
"cpp/algorithm/min_element.html":[9,0,97,281],
|
||||
"cpp/algorithm/minmax.html":[9,0,97,282],
|
||||
"cpp/algorithm/minmax_element.html":[9,0,97,283],
|
||||
"cpp/algorithm/mismatch.html":[9,0,97,284],
|
||||
"cpp/algorithm/move_backward.html":[9,0,97,288],
|
||||
"cpp/algorithm/next_permutation.html":[9,0,97,295],
|
||||
"cpp/algorithm/nth_element.html":[9,0,97,309],
|
||||
"cpp/algorithm/partial_sort.html":[9,0,97,311],
|
||||
"cpp/algorithm/partial_sort_copy.html":[9,0,97,312],
|
||||
"cpp/algorithm/partial_sum.html":[9,0,97,313],
|
||||
"cpp/algorithm/partition.html":[9,0,97,314],
|
||||
"cpp/algorithm/partition_copy.html":[9,0,97,315],
|
||||
"cpp/algorithm/partition_point.html":[9,0,97,316],
|
||||
"cpp/algorithm/pop_heap.html":[9,0,97,318],
|
||||
"cpp/algorithm/prev_permutation.html":[9,0,97,321],
|
||||
"cpp/algorithm/push_heap.html":[9,0,97,323],
|
||||
"cpp/algorithm/qsort.html":[9,0,97,330],
|
||||
"cpp/algorithm/random_shuffle.html":[9,0,97,387],
|
||||
"cpp/algorithm/random_shuffle.html":[9,0,97,334],
|
||||
"cpp/algorithm/remove.html":[9,0,97,341],
|
||||
"cpp/algorithm/remove.html":[9,0,97,344],
|
||||
"cpp/algorithm/remove_copy.html":[9,0,97,342],
|
||||
"cpp/algorithm/remove_copy.html":[9,0,97,343],
|
||||
"cpp/algorithm/replace.html":[9,0,97,347],
|
||||
"cpp/algorithm/replace.html":[9,0,97,350],
|
||||
"cpp/algorithm/replace_copy.html":[9,0,97,348],
|
||||
"cpp/algorithm/replace_copy.html":[9,0,97,349],
|
||||
"cpp/algorithm/reverse.html":[9,0,97,355],
|
||||
"cpp/algorithm/reverse_copy.html":[9,0,97,356],
|
||||
"cpp/algorithm/rotate.html":[9,0,97,360],
|
||||
"cpp/algorithm/rotate_copy.html":[9,0,97,361],
|
||||
"cpp/algorithm/search.html":[9,0,97,367],
|
||||
"cpp/algorithm/search_n.html":[9,0,97,368],
|
||||
"cpp/algorithm/set_difference.html":[9,0,97,369],
|
||||
"cpp/algorithm/set_intersection.html":[9,0,97,370],
|
||||
"cpp/algorithm/set_symmetric_difference.html":[9,0,97,372],
|
||||
"cpp/algorithm/set_union.html":[9,0,97,375],
|
||||
"cpp/algorithm/sort.html":[9,0,97,394],
|
||||
"cpp/algorithm/sort_heap.html":[9,0,97,395],
|
||||
"cpp/algorithm/stable_partition.html":[9,0,97,400],
|
||||
"cpp/algorithm/stable_sort.html":[9,0,97,401],
|
||||
"cpp/algorithm/swap.html":[9,0,97,438],
|
||||
"cpp/algorithm/swap_ranges.html":[9,0,97,439],
|
||||
"cpp/algorithm/transform.html":[9,0,97,460],
|
||||
"cpp/algorithm/unique.html":[9,0,97,474],
|
||||
"cpp/algorithm/unique_copy.html":[9,0,97,475],
|
||||
"cpp/algorithm/upper_bound.html":[9,0,97,477],
|
||||
"cpp/atomic/atomic_compare_exchange.html":[9,0,97,41],
|
||||
"cpp/atomic/atomic_compare_exchange.html":[9,0,97,40],
|
||||
"cpp/atomic/atomic_compare_exchange.html":[9,0,97,39],
|
||||
"cpp/atomic/atomic_compare_exchange.html":[9,0,97,38],
|
||||
"cpp/atomic/atomic_exchange.html":[9,0,97,42],
|
||||
"cpp/atomic/atomic_exchange.html":[9,0,97,43],
|
||||
"cpp/atomic/atomic_fetch_add.html":[9,0,97,44],
|
||||
"cpp/atomic/atomic_fetch_add.html":[9,0,97,45],
|
||||
"cpp/atomic/atomic_fetch_or.html":[9,0,97,49],
|
||||
"cpp/atomic/atomic_fetch_or.html":[9,0,97,48],
|
||||
"cpp/atomic/atomic_fetch_sub.html":[9,0,97,47],
|
||||
"cpp/atomic/atomic_fetch_sub.html":[9,0,97,50],
|
||||
"cpp/atomic/atomic_fetch_sub.html":[9,0,97,46],
|
||||
"cpp/atomic/atomic_fetch_sub.html":[9,0,97,51],
|
||||
"cpp/atomic/atomic_fetch_xor.html":[9,0,97,52],
|
||||
"cpp/atomic/atomic_fetch_xor.html":[9,0,97,53],
|
||||
"cpp/atomic/atomic_init.html":[9,0,97,54],
|
||||
"cpp/atomic/atomic_is_lock_free.html":[9,0,97,55],
|
||||
"cpp/atomic/atomic_load.html":[9,0,97,57],
|
||||
"cpp/atomic/atomic_load.html":[9,0,97,56],
|
||||
"cpp/atomic/atomic_signal_fence.html":[9,0,97,58],
|
||||
"cpp/atomic/atomic_store.html":[9,0,97,59],
|
||||
"cpp/atomic/atomic_store.html":[9,0,97,60],
|
||||
"cpp/atomic/atomic_thread_fence.html":[9,0,97,61],
|
||||
"cpp/atomic/kill_dependency.html":[9,0,97,234],
|
||||
"cpp/chrono/c/asctime.html":[9,0,97,25],
|
||||
"cpp/chrono/c/clock.html":[9,0,97,76],
|
||||
"cpp/chrono/c/ctime.html":[9,0,97,88],
|
||||
"cpp/chrono/c/difftime.html":[9,0,97,95],
|
||||
"cpp/chrono/c/gmtime.html":[9,0,97,186],
|
||||
"cpp/chrono/c/localtime.html":[9,0,97,245],
|
||||
"cpp/chrono/c/mktime.html":[9,0,97,285],
|
||||
"cpp/chrono/c/strftime.html":[9,0,97,418],
|
||||
"cpp/chrono/c/time.html":[9,0,97,450],
|
||||
"cpp/chrono/c/wcsftime.html":[9,0,97,500],
|
||||
"cpp/chrono/duration/duration_cast.html":[9,0,97,0,0],
|
||||
"cpp/chrono/time_point/time_point_cast.html":[9,0,97,0,1],
|
||||
"cpp/error/current_exception.html":[9,0,97,89],
|
||||
"cpp/error/generic_category.html":[9,0,97,172],
|
||||
"cpp/error/get_terminate.html":[9,0,97,177],
|
||||
"cpp/error/get_unexpected.html":[9,0,97,179],
|
||||
"cpp/error/make_exception_ptr.html":[9,0,97,255],
|
||||
"cpp/error/rethrow_exception.html":[9,0,97,352],
|
||||
"cpp/error/rethrow_if_nested.html":[9,0,97,353],
|
||||
"cpp/error/set_terminate.html":[9,0,97,373],
|
||||
"cpp/error/set_unexpected.html":[9,0,97,374],
|
||||
"cpp/error/system_category.html":[9,0,97,443],
|
||||
"cpp/error/terminate.html":[9,0,97,446],
|
||||
"cpp/error/throw_with_nested.html":[9,0,97,448],
|
||||
"cpp/error/uncaught_exception.html":[9,0,97,464],
|
||||
"cpp/error/unexpected.html":[9,0,97,467],
|
||||
"cpp/experimental/optional/make_optional.html":[9,0,97,1,0],
|
||||
"cpp/io/c/clearerr.html":[9,0,97,75],
|
||||
"cpp/io/c/fclose.html":[9,0,97,111],
|
||||
"cpp/io/c/feof.html":[9,0,97,118],
|
||||
"cpp/io/c/ferror.html":[9,0,97,120],
|
||||
"cpp/io/c/fflush.html":[9,0,97,126],
|
||||
"cpp/io/c/fgetc.html":[9,0,97,180],
|
||||
"cpp/io/c/fgetc.html":[9,0,97,127],
|
||||
"cpp/io/c/fgetpos.html":[9,0,97,128],
|
||||
"cpp/io/c/fgets.html":[9,0,97,129],
|
||||
"cpp/io/c/fgetwc.html":[9,0,97,130],
|
||||
"cpp/io/c/fgetws.html":[9,0,97,131],
|
||||
"cpp/io/c/fopen.html":[9,0,97,146],
|
||||
"cpp/io/c/fprintf.html":[9,0,97,393],
|
||||
"cpp/io/c/fprintf.html":[9,0,97,322],
|
||||
"cpp/io/c/fprintf.html":[9,0,97,151],
|
||||
"cpp/io/c/fprintf.html":[9,0,97,396],
|
||||
"cpp/io/c/fputc.html":[9,0,97,326],
|
||||
"cpp/io/c/fputc.html":[9,0,97,152],
|
||||
"cpp/io/c/fputs.html":[9,0,97,153],
|
||||
"cpp/io/c/fputwc.html":[9,0,97,154],
|
||||
"cpp/io/c/fputws.html":[9,0,97,155],
|
||||
"cpp/io/c/fread.html":[9,0,97,156],
|
||||
"cpp/io/c/freopen.html":[9,0,97,158],
|
||||
"cpp/io/c/fscanf.html":[9,0,97,365],
|
||||
"cpp/io/c/fscanf.html":[9,0,97,161],
|
||||
"cpp/io/c/fscanf.html":[9,0,97,399],
|
||||
"cpp/io/c/fseek.html":[9,0,97,162],
|
||||
"cpp/io/c/fsetpos.html":[9,0,97,163],
|
||||
"cpp/io/c/ftell.html":[9,0,97,164],
|
||||
"cpp/io/c/fwprintf.html":[9,0,97,166],
|
||||
"cpp/io/c/fwprintf.html":[9,0,97,440],
|
||||
"cpp/io/c/fwprintf.html":[9,0,97,530],
|
||||
"cpp/io/c/fwrite.html":[9,0,97,167],
|
||||
"cpp/io/c/fwscanf.html":[9,0,97,168],
|
||||
"cpp/io/c/fwscanf.html":[9,0,97,441],
|
||||
"cpp/io/c/fwscanf.html":[9,0,97,532],
|
||||
"cpp/io/c/getchar.html":[9,0,97,181],
|
||||
"cpp/io/c/gets.html":[9,0,97,184],
|
||||
"cpp/io/c/getwchar.html":[9,0,97,185],
|
||||
"cpp/io/c/perror.html":[9,0,97,317],
|
||||
"cpp/io/c/putchar.html":[9,0,97,327],
|
||||
"cpp/io/c/puts.html":[9,0,97,328],
|
||||
"cpp/io/c/putwchar.html":[9,0,97,329],
|
||||
"cpp/io/c/rename.html":[9,0,97,346],
|
||||
"cpp/io/c/rewind.html":[9,0,97,357],
|
||||
"cpp/io/c/setbuf.html":[9,0,97,377],
|
||||
"cpp/io/c/setvbuf.html":[9,0,97,382],
|
||||
"cpp/io/c/tmpfile.html":[9,0,97,451],
|
||||
"cpp/io/c/tmpnam.html":[9,0,97,452],
|
||||
"cpp/io/c/ungetc.html":[9,0,97,468],
|
||||
"cpp/io/c/ungetwc.html":[9,0,97,469],
|
||||
"cpp/io/c/vfprintf.html":[9,0,97,484],
|
||||
"cpp/io/c/vfprintf.html":[9,0,97,487],
|
||||
"cpp/io/c/vfprintf.html":[9,0,97,486],
|
||||
"cpp/io/c/vfprintf.html":[9,0,97,480],
|
||||
"cpp/io/c/vfscanf.html":[9,0,97,485],
|
||||
"cpp/io/c/vfscanf.html":[9,0,97,488],
|
||||
"cpp/io/c/vfscanf.html":[9,0,97,481],
|
||||
"cpp/io/c/vfwprintf.html":[9,0,97,489],
|
||||
"cpp/io/c/vfwprintf.html":[9,0,97,491],
|
||||
"cpp/io/c/vfwprintf.html":[9,0,97,482],
|
||||
"cpp/io/c/vfwscanf.html":[9,0,97,490],
|
||||
"cpp/io/c/vfwscanf.html":[9,0,97,483],
|
||||
"cpp/io/c/vfwscanf.html":[9,0,97,492],
|
||||
"cpp/io/manip/boolalpha.html":[9,0,97,298],
|
||||
"cpp/io/manip/boolalpha.html":[9,0,97,66],
|
||||
"cpp/io/manip/endl.html":[9,0,97,100],
|
||||
"cpp/io/manip/ends.html":[9,0,97,101],
|
||||
"cpp/io/manip/fixed.html":[9,0,97,94],
|
||||
"cpp/io/manip/fixed.html":[9,0,97,366],
|
||||
"cpp/io/manip/fixed.html":[9,0,97,139],
|
||||
"cpp/io/manip/fixed.html":[9,0,97,189],
|
||||
"cpp/io/manip/flush.html":[9,0,97,141],
|
||||
"cpp/io/manip/get_money.html":[9,0,97,173],
|
||||
"cpp/io/manip/get_time.html":[9,0,97,178],
|
||||
"cpp/io/manip/hex.html":[9,0,97,310],
|
||||
"cpp/io/manip/hex.html":[9,0,97,90],
|
||||
"cpp/io/manip/hex.html":[9,0,97,188],
|
||||
"cpp/io/manip/left.html":[9,0,97,196],
|
||||
"cpp/io/manip/left.html":[9,0,97,238],
|
||||
"cpp/io/manip/left.html":[9,0,97,358],
|
||||
"cpp/io/manip/put_money.html":[9,0,97,324],
|
||||
"cpp/io/manip/put_time.html":[9,0,97,325],
|
||||
"cpp/io/manip/resetiosflags.html":[9,0,97,351],
|
||||
"cpp/io/manip/setbase.html":[9,0,97,376],
|
||||
"cpp/io/manip/setfill.html":[9,0,97,378],
|
||||
"cpp/io/manip/setiosflags.html":[9,0,97,379],
|
||||
"cpp/io/manip/setprecision.html":[9,0,97,381],
|
||||
"cpp/io/manip/setw.html":[9,0,97,383],
|
||||
"cpp/io/manip/showbase.html":[9,0,97,384],
|
||||
"cpp/io/manip/showbase.html":[9,0,97,300],
|
||||
"cpp/io/manip/showpoint.html":[9,0,97,385],
|
||||
"cpp/io/manip/showpoint.html":[9,0,97,301],
|
||||
"cpp/io/manip/showpos.html":[9,0,97,302],
|
||||
"cpp/io/manip/showpos.html":[9,0,97,386],
|
||||
"cpp/io/manip/skipws.html":[9,0,97,303],
|
||||
"cpp/io/manip/skipws.html":[9,0,97,392],
|
||||
"cpp/io/manip/unitbuf.html":[9,0,97,307],
|
||||
"cpp/io/manip/unitbuf.html":[9,0,97,476],
|
||||
"cpp/io/manip/uppercase.html":[9,0,97,478],
|
||||
"cpp/io/manip/uppercase.html":[9,0,97,308],
|
||||
"cpp/io/manip/ws.html":[9,0,97,531],
|
||||
"cpp/iterator/advance.html":[9,0,97,20],
|
||||
"cpp/iterator/back_inserter.html":[9,0,97,62],
|
||||
"cpp/iterator/begin.html":[9,0,97,63]
|
||||
"cpp/algorithm/accumulate.html":[9,0,99,14],
|
||||
"cpp/algorithm/adjacent_difference.html":[9,0,99,18],
|
||||
"cpp/algorithm/adjacent_find.html":[9,0,99,19],
|
||||
"cpp/algorithm/all_any_none_of.html":[9,0,99,24],
|
||||
"cpp/algorithm/all_any_none_of.html":[9,0,99,299],
|
||||
"cpp/algorithm/all_any_none_of.html":[9,0,99,22],
|
||||
"cpp/algorithm/binary_search.html":[9,0,99,64],
|
||||
"cpp/algorithm/bsearch.html":[9,0,99,67],
|
||||
"cpp/algorithm/copy.html":[9,0,99,80],
|
||||
"cpp/algorithm/copy.html":[9,0,99,78],
|
||||
"cpp/algorithm/copy_backward.html":[9,0,99,79],
|
||||
"cpp/algorithm/copy_n.html":[9,0,99,81],
|
||||
"cpp/algorithm/count.html":[9,0,99,85],
|
||||
"cpp/algorithm/count.html":[9,0,99,86],
|
||||
"cpp/algorithm/equal.html":[9,0,99,102],
|
||||
"cpp/algorithm/equal_range.html":[9,0,99,103],
|
||||
"cpp/algorithm/fill.html":[9,0,99,132],
|
||||
"cpp/algorithm/fill_n.html":[9,0,99,133],
|
||||
"cpp/algorithm/find.html":[9,0,99,134],
|
||||
"cpp/algorithm/find.html":[9,0,99,137],
|
||||
"cpp/algorithm/find.html":[9,0,99,138],
|
||||
"cpp/algorithm/find_end.html":[9,0,99,135],
|
||||
"cpp/algorithm/find_first_of.html":[9,0,99,136],
|
||||
"cpp/algorithm/for_each.html":[9,0,99,147],
|
||||
"cpp/algorithm/generate.html":[9,0,99,169],
|
||||
"cpp/algorithm/generate_n.html":[9,0,99,171],
|
||||
"cpp/algorithm/includes.html":[9,0,99,192],
|
||||
"cpp/algorithm/inner_product.html":[9,0,99,193],
|
||||
"cpp/algorithm/inplace_merge.html":[9,0,99,194],
|
||||
"cpp/algorithm/iota.html":[9,0,99,197],
|
||||
"cpp/algorithm/is_heap.html":[9,0,99,198],
|
||||
"cpp/algorithm/is_heap_until.html":[9,0,99,199],
|
||||
"cpp/algorithm/is_partitioned.html":[9,0,99,200],
|
||||
"cpp/algorithm/is_permutation.html":[9,0,99,201],
|
||||
"cpp/algorithm/is_sorted.html":[9,0,99,202],
|
||||
"cpp/algorithm/is_sorted_until.html":[9,0,99,203],
|
||||
"cpp/algorithm/iter_swap.html":[9,0,99,233],
|
||||
"cpp/algorithm/lexicographical_compare.html":[9,0,99,239],
|
||||
"cpp/algorithm/lower_bound.html":[9,0,99,252],
|
||||
"cpp/algorithm/make_heap.html":[9,0,99,256],
|
||||
"cpp/algorithm/max.html":[9,0,99,262],
|
||||
"cpp/algorithm/max_element.html":[9,0,99,263],
|
||||
"cpp/algorithm/merge.html":[9,0,99,279],
|
||||
"cpp/algorithm/min.html":[9,0,99,280],
|
||||
"cpp/algorithm/min_element.html":[9,0,99,281],
|
||||
"cpp/algorithm/minmax.html":[9,0,99,282],
|
||||
"cpp/algorithm/minmax_element.html":[9,0,99,283],
|
||||
"cpp/algorithm/mismatch.html":[9,0,99,284],
|
||||
"cpp/algorithm/move_backward.html":[9,0,99,288],
|
||||
"cpp/algorithm/next_permutation.html":[9,0,99,295],
|
||||
"cpp/algorithm/nth_element.html":[9,0,99,309],
|
||||
"cpp/algorithm/partial_sort.html":[9,0,99,311],
|
||||
"cpp/algorithm/partial_sort_copy.html":[9,0,99,312],
|
||||
"cpp/algorithm/partial_sum.html":[9,0,99,313],
|
||||
"cpp/algorithm/partition.html":[9,0,99,314],
|
||||
"cpp/algorithm/partition_copy.html":[9,0,99,315],
|
||||
"cpp/algorithm/partition_point.html":[9,0,99,316],
|
||||
"cpp/algorithm/pop_heap.html":[9,0,99,318],
|
||||
"cpp/algorithm/prev_permutation.html":[9,0,99,321],
|
||||
"cpp/algorithm/push_heap.html":[9,0,99,323],
|
||||
"cpp/algorithm/qsort.html":[9,0,99,330],
|
||||
"cpp/algorithm/random_shuffle.html":[9,0,99,387],
|
||||
"cpp/algorithm/random_shuffle.html":[9,0,99,334],
|
||||
"cpp/algorithm/remove.html":[9,0,99,341],
|
||||
"cpp/algorithm/remove.html":[9,0,99,344],
|
||||
"cpp/algorithm/remove_copy.html":[9,0,99,343],
|
||||
"cpp/algorithm/remove_copy.html":[9,0,99,342],
|
||||
"cpp/algorithm/replace.html":[9,0,99,347],
|
||||
"cpp/algorithm/replace.html":[9,0,99,350],
|
||||
"cpp/algorithm/replace_copy.html":[9,0,99,348],
|
||||
"cpp/algorithm/replace_copy.html":[9,0,99,349],
|
||||
"cpp/algorithm/reverse.html":[9,0,99,355],
|
||||
"cpp/algorithm/reverse_copy.html":[9,0,99,356],
|
||||
"cpp/algorithm/rotate.html":[9,0,99,360],
|
||||
"cpp/algorithm/rotate_copy.html":[9,0,99,361],
|
||||
"cpp/algorithm/search.html":[9,0,99,367],
|
||||
"cpp/algorithm/search_n.html":[9,0,99,368],
|
||||
"cpp/algorithm/set_difference.html":[9,0,99,369],
|
||||
"cpp/algorithm/set_intersection.html":[9,0,99,370],
|
||||
"cpp/algorithm/set_symmetric_difference.html":[9,0,99,372],
|
||||
"cpp/algorithm/set_union.html":[9,0,99,375],
|
||||
"cpp/algorithm/sort.html":[9,0,99,394],
|
||||
"cpp/algorithm/sort_heap.html":[9,0,99,395],
|
||||
"cpp/algorithm/stable_partition.html":[9,0,99,400],
|
||||
"cpp/algorithm/stable_sort.html":[9,0,99,401],
|
||||
"cpp/algorithm/swap.html":[9,0,99,438],
|
||||
"cpp/algorithm/swap_ranges.html":[9,0,99,439],
|
||||
"cpp/algorithm/transform.html":[9,0,99,460],
|
||||
"cpp/algorithm/unique.html":[9,0,99,474],
|
||||
"cpp/algorithm/unique_copy.html":[9,0,99,475],
|
||||
"cpp/algorithm/upper_bound.html":[9,0,99,477],
|
||||
"cpp/atomic/atomic_compare_exchange.html":[9,0,99,38],
|
||||
"cpp/atomic/atomic_compare_exchange.html":[9,0,99,39],
|
||||
"cpp/atomic/atomic_compare_exchange.html":[9,0,99,41],
|
||||
"cpp/atomic/atomic_compare_exchange.html":[9,0,99,40],
|
||||
"cpp/atomic/atomic_exchange.html":[9,0,99,43],
|
||||
"cpp/atomic/atomic_exchange.html":[9,0,99,42],
|
||||
"cpp/atomic/atomic_fetch_add.html":[9,0,99,44],
|
||||
"cpp/atomic/atomic_fetch_add.html":[9,0,99,45],
|
||||
"cpp/atomic/atomic_fetch_or.html":[9,0,99,49],
|
||||
"cpp/atomic/atomic_fetch_or.html":[9,0,99,48],
|
||||
"cpp/atomic/atomic_fetch_sub.html":[9,0,99,51],
|
||||
"cpp/atomic/atomic_fetch_sub.html":[9,0,99,46],
|
||||
"cpp/atomic/atomic_fetch_sub.html":[9,0,99,47],
|
||||
"cpp/atomic/atomic_fetch_sub.html":[9,0,99,50],
|
||||
"cpp/atomic/atomic_fetch_xor.html":[9,0,99,52],
|
||||
"cpp/atomic/atomic_fetch_xor.html":[9,0,99,53],
|
||||
"cpp/atomic/atomic_init.html":[9,0,99,54],
|
||||
"cpp/atomic/atomic_is_lock_free.html":[9,0,99,55],
|
||||
"cpp/atomic/atomic_load.html":[9,0,99,57],
|
||||
"cpp/atomic/atomic_load.html":[9,0,99,56],
|
||||
"cpp/atomic/atomic_signal_fence.html":[9,0,99,58],
|
||||
"cpp/atomic/atomic_store.html":[9,0,99,59],
|
||||
"cpp/atomic/atomic_store.html":[9,0,99,60],
|
||||
"cpp/atomic/atomic_thread_fence.html":[9,0,99,61],
|
||||
"cpp/atomic/kill_dependency.html":[9,0,99,234],
|
||||
"cpp/chrono/c/asctime.html":[9,0,99,25],
|
||||
"cpp/chrono/c/clock.html":[9,0,99,76],
|
||||
"cpp/chrono/c/ctime.html":[9,0,99,88],
|
||||
"cpp/chrono/c/difftime.html":[9,0,99,95],
|
||||
"cpp/chrono/c/gmtime.html":[9,0,99,186],
|
||||
"cpp/chrono/c/localtime.html":[9,0,99,245],
|
||||
"cpp/chrono/c/mktime.html":[9,0,99,285],
|
||||
"cpp/chrono/c/strftime.html":[9,0,99,418],
|
||||
"cpp/chrono/c/time.html":[9,0,99,450],
|
||||
"cpp/chrono/c/wcsftime.html":[9,0,99,500],
|
||||
"cpp/chrono/duration/duration_cast.html":[9,0,99,0,0],
|
||||
"cpp/chrono/time_point/time_point_cast.html":[9,0,99,0,1],
|
||||
"cpp/error/current_exception.html":[9,0,99,89],
|
||||
"cpp/error/generic_category.html":[9,0,99,172],
|
||||
"cpp/error/get_terminate.html":[9,0,99,177],
|
||||
"cpp/error/get_unexpected.html":[9,0,99,179],
|
||||
"cpp/error/make_exception_ptr.html":[9,0,99,255],
|
||||
"cpp/error/rethrow_exception.html":[9,0,99,352],
|
||||
"cpp/error/rethrow_if_nested.html":[9,0,99,353],
|
||||
"cpp/error/set_terminate.html":[9,0,99,373],
|
||||
"cpp/error/set_unexpected.html":[9,0,99,374],
|
||||
"cpp/error/system_category.html":[9,0,99,443],
|
||||
"cpp/error/terminate.html":[9,0,99,446],
|
||||
"cpp/error/throw_with_nested.html":[9,0,99,448],
|
||||
"cpp/error/uncaught_exception.html":[9,0,99,464],
|
||||
"cpp/error/unexpected.html":[9,0,99,467],
|
||||
"cpp/experimental/optional/make_optional.html":[9,0,99,1,0],
|
||||
"cpp/io/c/clearerr.html":[9,0,99,75],
|
||||
"cpp/io/c/fclose.html":[9,0,99,111],
|
||||
"cpp/io/c/feof.html":[9,0,99,118],
|
||||
"cpp/io/c/ferror.html":[9,0,99,120],
|
||||
"cpp/io/c/fflush.html":[9,0,99,126],
|
||||
"cpp/io/c/fgetc.html":[9,0,99,127],
|
||||
"cpp/io/c/fgetc.html":[9,0,99,180],
|
||||
"cpp/io/c/fgetpos.html":[9,0,99,128],
|
||||
"cpp/io/c/fgets.html":[9,0,99,129],
|
||||
"cpp/io/c/fgetwc.html":[9,0,99,130],
|
||||
"cpp/io/c/fgetws.html":[9,0,99,131],
|
||||
"cpp/io/c/fopen.html":[9,0,99,146],
|
||||
"cpp/io/c/fprintf.html":[9,0,99,322],
|
||||
"cpp/io/c/fprintf.html":[9,0,99,393],
|
||||
"cpp/io/c/fprintf.html":[9,0,99,151],
|
||||
"cpp/io/c/fprintf.html":[9,0,99,396],
|
||||
"cpp/io/c/fputc.html":[9,0,99,152],
|
||||
"cpp/io/c/fputc.html":[9,0,99,326],
|
||||
"cpp/io/c/fputs.html":[9,0,99,153],
|
||||
"cpp/io/c/fputwc.html":[9,0,99,154],
|
||||
"cpp/io/c/fputws.html":[9,0,99,155],
|
||||
"cpp/io/c/fread.html":[9,0,99,156],
|
||||
"cpp/io/c/freopen.html":[9,0,99,158],
|
||||
"cpp/io/c/fscanf.html":[9,0,99,399],
|
||||
"cpp/io/c/fscanf.html":[9,0,99,161],
|
||||
"cpp/io/c/fscanf.html":[9,0,99,365],
|
||||
"cpp/io/c/fseek.html":[9,0,99,162],
|
||||
"cpp/io/c/fsetpos.html":[9,0,99,163],
|
||||
"cpp/io/c/ftell.html":[9,0,99,164],
|
||||
"cpp/io/c/fwprintf.html":[9,0,99,530],
|
||||
"cpp/io/c/fwprintf.html":[9,0,99,166],
|
||||
"cpp/io/c/fwprintf.html":[9,0,99,440],
|
||||
"cpp/io/c/fwrite.html":[9,0,99,167],
|
||||
"cpp/io/c/fwscanf.html":[9,0,99,168],
|
||||
"cpp/io/c/fwscanf.html":[9,0,99,532],
|
||||
"cpp/io/c/fwscanf.html":[9,0,99,441],
|
||||
"cpp/io/c/getchar.html":[9,0,99,181],
|
||||
"cpp/io/c/gets.html":[9,0,99,184],
|
||||
"cpp/io/c/getwchar.html":[9,0,99,185],
|
||||
"cpp/io/c/perror.html":[9,0,99,317],
|
||||
"cpp/io/c/putchar.html":[9,0,99,327],
|
||||
"cpp/io/c/puts.html":[9,0,99,328],
|
||||
"cpp/io/c/putwchar.html":[9,0,99,329],
|
||||
"cpp/io/c/rename.html":[9,0,99,346],
|
||||
"cpp/io/c/rewind.html":[9,0,99,357],
|
||||
"cpp/io/c/setbuf.html":[9,0,99,377],
|
||||
"cpp/io/c/setvbuf.html":[9,0,99,382],
|
||||
"cpp/io/c/tmpfile.html":[9,0,99,451],
|
||||
"cpp/io/c/tmpnam.html":[9,0,99,452],
|
||||
"cpp/io/c/ungetc.html":[9,0,99,468],
|
||||
"cpp/io/c/ungetwc.html":[9,0,99,469],
|
||||
"cpp/io/c/vfprintf.html":[9,0,99,486],
|
||||
"cpp/io/c/vfprintf.html":[9,0,99,484],
|
||||
"cpp/io/c/vfprintf.html":[9,0,99,487],
|
||||
"cpp/io/c/vfprintf.html":[9,0,99,480],
|
||||
"cpp/io/c/vfscanf.html":[9,0,99,481],
|
||||
"cpp/io/c/vfscanf.html":[9,0,99,485],
|
||||
"cpp/io/c/vfscanf.html":[9,0,99,488],
|
||||
"cpp/io/c/vfwprintf.html":[9,0,99,489],
|
||||
"cpp/io/c/vfwprintf.html":[9,0,99,482],
|
||||
"cpp/io/c/vfwprintf.html":[9,0,99,491],
|
||||
"cpp/io/c/vfwscanf.html":[9,0,99,490],
|
||||
"cpp/io/c/vfwscanf.html":[9,0,99,492],
|
||||
"cpp/io/c/vfwscanf.html":[9,0,99,483],
|
||||
"cpp/io/manip/boolalpha.html":[9,0,99,298],
|
||||
"cpp/io/manip/boolalpha.html":[9,0,99,66],
|
||||
"cpp/io/manip/endl.html":[9,0,99,100],
|
||||
"cpp/io/manip/ends.html":[9,0,99,101],
|
||||
"cpp/io/manip/fixed.html":[9,0,99,366],
|
||||
"cpp/io/manip/fixed.html":[9,0,99,139],
|
||||
"cpp/io/manip/fixed.html":[9,0,99,94],
|
||||
"cpp/io/manip/fixed.html":[9,0,99,189],
|
||||
"cpp/io/manip/flush.html":[9,0,99,141],
|
||||
"cpp/io/manip/get_money.html":[9,0,99,173],
|
||||
"cpp/io/manip/get_time.html":[9,0,99,178],
|
||||
"cpp/io/manip/hex.html":[9,0,99,188],
|
||||
"cpp/io/manip/hex.html":[9,0,99,90],
|
||||
"cpp/io/manip/hex.html":[9,0,99,310],
|
||||
"cpp/io/manip/left.html":[9,0,99,238],
|
||||
"cpp/io/manip/left.html":[9,0,99,358],
|
||||
"cpp/io/manip/left.html":[9,0,99,196],
|
||||
"cpp/io/manip/put_money.html":[9,0,99,324],
|
||||
"cpp/io/manip/put_time.html":[9,0,99,325],
|
||||
"cpp/io/manip/resetiosflags.html":[9,0,99,351],
|
||||
"cpp/io/manip/setbase.html":[9,0,99,376],
|
||||
"cpp/io/manip/setfill.html":[9,0,99,378],
|
||||
"cpp/io/manip/setiosflags.html":[9,0,99,379],
|
||||
"cpp/io/manip/setprecision.html":[9,0,99,381],
|
||||
"cpp/io/manip/setw.html":[9,0,99,383],
|
||||
"cpp/io/manip/showbase.html":[9,0,99,384],
|
||||
"cpp/io/manip/showbase.html":[9,0,99,300],
|
||||
"cpp/io/manip/showpoint.html":[9,0,99,301],
|
||||
"cpp/io/manip/showpoint.html":[9,0,99,385],
|
||||
"cpp/io/manip/showpos.html":[9,0,99,302],
|
||||
"cpp/io/manip/showpos.html":[9,0,99,386],
|
||||
"cpp/io/manip/skipws.html":[9,0,99,303],
|
||||
"cpp/io/manip/skipws.html":[9,0,99,392],
|
||||
"cpp/io/manip/unitbuf.html":[9,0,99,476],
|
||||
"cpp/io/manip/unitbuf.html":[9,0,99,307],
|
||||
"cpp/io/manip/uppercase.html":[9,0,99,308],
|
||||
"cpp/io/manip/uppercase.html":[9,0,99,478],
|
||||
"cpp/io/manip/ws.html":[9,0,99,531],
|
||||
"cpp/iterator/advance.html":[9,0,99,20],
|
||||
"cpp/iterator/back_inserter.html":[9,0,99,62],
|
||||
"cpp/iterator/begin.html":[9,0,99,63]
|
||||
};
|
||||
|
||||
500
navtreeindex1.js
500
navtreeindex1.js
@@ -1,253 +1,253 @@
|
||||
var NAVTREEINDEX1 =
|
||||
{
|
||||
"cpp/iterator/distance.html":[9,0,97,96],
|
||||
"cpp/iterator/end.html":[9,0,97,99],
|
||||
"cpp/iterator/front_inserter.html":[9,0,97,160],
|
||||
"cpp/iterator/inserter.html":[9,0,97,195],
|
||||
"cpp/iterator/make_move_iterator.html":[9,0,97,257],
|
||||
"cpp/iterator/next.html":[9,0,97,294],
|
||||
"cpp/iterator/prev.html":[9,0,97,320],
|
||||
"cpp/locale/has_facet.html":[9,0,97,187],
|
||||
"cpp/locale/localeconv.html":[9,0,97,244],
|
||||
"cpp/locale/setlocale.html":[9,0,97,380],
|
||||
"cpp/locale/use_facet.html":[9,0,97,479],
|
||||
"cpp/memory/addressof.html":[9,0,97,17],
|
||||
"cpp/memory/align.html":[9,0,97,21],
|
||||
"cpp/memory/c/calloc.html":[9,0,97,72],
|
||||
"cpp/memory/c/free.html":[9,0,97,157],
|
||||
"cpp/memory/c/malloc.html":[9,0,97,261],
|
||||
"cpp/memory/c/realloc.html":[9,0,97,335],
|
||||
"cpp/memory/gc/declare_no_pointers.html":[9,0,97,91],
|
||||
"cpp/memory/gc/declare_reachable.html":[9,0,97,92],
|
||||
"cpp/memory/gc/get_pointer_safety.html":[9,0,97,175],
|
||||
"cpp/memory/gc/undeclare_no_pointers.html":[9,0,97,465],
|
||||
"cpp/memory/gc/undeclare_reachable.html":[9,0,97,466],
|
||||
"cpp/memory/get_temporary_buffer.html":[9,0,97,176],
|
||||
"cpp/memory/new/get_new_handler.html":[9,0,97,174],
|
||||
"cpp/memory/new/set_new_handler.html":[9,0,97,371],
|
||||
"cpp/memory/return_temporary_buffer.html":[9,0,97,354],
|
||||
"cpp/memory/shared_ptr/allocate_shared.html":[9,0,97,23],
|
||||
"cpp/memory/shared_ptr/make_shared.html":[9,0,97,259],
|
||||
"cpp/memory/shared_ptr/pointer_cast.html":[9,0,97,402],
|
||||
"cpp/memory/shared_ptr/pointer_cast.html":[9,0,97,98],
|
||||
"cpp/memory/shared_ptr/pointer_cast.html":[9,0,97,77],
|
||||
"cpp/memory/uninitialized_copy.html":[9,0,97,470],
|
||||
"cpp/memory/uninitialized_copy_n.html":[9,0,97,471],
|
||||
"cpp/memory/uninitialized_fill.html":[9,0,97,472],
|
||||
"cpp/memory/uninitialized_fill_n.html":[9,0,97,473],
|
||||
"cpp/numeric/fenv/feclearexcept.html":[9,0,97,113],
|
||||
"cpp/numeric/fenv/feenv.html":[9,0,97,121],
|
||||
"cpp/numeric/fenv/feenv.html":[9,0,97,114],
|
||||
"cpp/numeric/fenv/feexceptflag.html":[9,0,97,122],
|
||||
"cpp/numeric/fenv/feexceptflag.html":[9,0,97,115],
|
||||
"cpp/numeric/fenv/feholdexcept.html":[9,0,97,117],
|
||||
"cpp/numeric/fenv/feraiseexcept.html":[9,0,97,119],
|
||||
"cpp/numeric/fenv/feround.html":[9,0,97,123],
|
||||
"cpp/numeric/fenv/feround.html":[9,0,97,116],
|
||||
"cpp/numeric/fenv/fetestexcept.html":[9,0,97,124],
|
||||
"cpp/numeric/fenv/feupdateenv.html":[9,0,97,125],
|
||||
"cpp/numeric/math/abs.html":[9,0,97,241],
|
||||
"cpp/numeric/math/abs.html":[9,0,97,13],
|
||||
"cpp/numeric/math/abs.html":[9,0,97,235],
|
||||
"cpp/numeric/math/acos.html":[9,0,97,15],
|
||||
"cpp/numeric/math/acosh.html":[9,0,97,16],
|
||||
"cpp/numeric/math/asin.html":[9,0,97,26],
|
||||
"cpp/numeric/math/asinh.html":[9,0,97,27],
|
||||
"cpp/numeric/math/atan.html":[9,0,97,30],
|
||||
"cpp/numeric/math/atan2.html":[9,0,97,31],
|
||||
"cpp/numeric/math/atanh.html":[9,0,97,32],
|
||||
"cpp/numeric/math/cbrt.html":[9,0,97,73],
|
||||
"cpp/numeric/math/ceil.html":[9,0,97,74],
|
||||
"cpp/numeric/math/copysign.html":[9,0,97,82],
|
||||
"cpp/numeric/math/cos.html":[9,0,97,83],
|
||||
"cpp/numeric/math/cosh.html":[9,0,97,84],
|
||||
"cpp/numeric/math/div.html":[9,0,97,237],
|
||||
"cpp/numeric/math/div.html":[9,0,97,97],
|
||||
"cpp/numeric/math/erf.html":[9,0,97,104],
|
||||
"cpp/numeric/math/erfc.html":[9,0,97,105],
|
||||
"cpp/numeric/math/exp.html":[9,0,97,107],
|
||||
"cpp/numeric/math/exp2.html":[9,0,97,108],
|
||||
"cpp/numeric/math/expm1.html":[9,0,97,109],
|
||||
"cpp/numeric/math/fabs.html":[9,0,97,12],
|
||||
"cpp/numeric/math/fabs.html":[9,0,97,110],
|
||||
"cpp/numeric/math/fdim.html":[9,0,97,112],
|
||||
"cpp/numeric/math/floor.html":[9,0,97,140],
|
||||
"cpp/numeric/math/fma.html":[9,0,97,142],
|
||||
"cpp/numeric/math/fmax.html":[9,0,97,143],
|
||||
"cpp/numeric/math/fmin.html":[9,0,97,144],
|
||||
"cpp/numeric/math/fmod.html":[9,0,97,145],
|
||||
"cpp/numeric/math/fpclassify.html":[9,0,97,150],
|
||||
"cpp/numeric/math/frexp.html":[9,0,97,159],
|
||||
"cpp/numeric/math/hypot.html":[9,0,97,190],
|
||||
"cpp/numeric/math/ilogb.html":[9,0,97,191],
|
||||
"cpp/numeric/math/isfinite.html":[9,0,97,209],
|
||||
"cpp/numeric/math/isinf.html":[9,0,97,211],
|
||||
"cpp/numeric/math/isnan.html":[9,0,97,213],
|
||||
"cpp/numeric/math/isnormal.html":[9,0,97,214],
|
||||
"cpp/numeric/math/ldexp.html":[9,0,97,236],
|
||||
"cpp/numeric/math/lgamma.html":[9,0,97,240],
|
||||
"cpp/numeric/math/log.html":[9,0,97,247],
|
||||
"cpp/numeric/math/log10.html":[9,0,97,248],
|
||||
"cpp/numeric/math/log1p.html":[9,0,97,249],
|
||||
"cpp/numeric/math/logb.html":[9,0,97,250],
|
||||
"cpp/numeric/math/modf.html":[9,0,97,286],
|
||||
"cpp/numeric/math/nan.html":[9,0,97,292],
|
||||
"cpp/numeric/math/nan.html":[9,0,97,291],
|
||||
"cpp/numeric/math/nan.html":[9,0,97,290],
|
||||
"cpp/numeric/math/nearbyint.html":[9,0,97,293],
|
||||
"cpp/numeric/math/nextafter.html":[9,0,97,297],
|
||||
"cpp/numeric/math/nextafter.html":[9,0,97,296],
|
||||
"cpp/numeric/math/pow.html":[9,0,97,319],
|
||||
"cpp/numeric/math/remainder.html":[9,0,97,340],
|
||||
"cpp/numeric/math/remquo.html":[9,0,97,345],
|
||||
"cpp/numeric/math/rint.html":[9,0,97,242],
|
||||
"cpp/numeric/math/rint.html":[9,0,97,359],
|
||||
"cpp/numeric/math/rint.html":[9,0,97,253],
|
||||
"cpp/numeric/math/round.html":[9,0,97,243],
|
||||
"cpp/numeric/math/round.html":[9,0,97,254],
|
||||
"cpp/numeric/math/round.html":[9,0,97,362],
|
||||
"cpp/numeric/math/scalbn.html":[9,0,97,364],
|
||||
"cpp/numeric/math/scalbn.html":[9,0,97,363],
|
||||
"cpp/numeric/math/signbit.html":[9,0,97,389],
|
||||
"cpp/numeric/math/sin.html":[9,0,97,390],
|
||||
"cpp/numeric/math/sinh.html":[9,0,97,391],
|
||||
"cpp/numeric/math/sqrt.html":[9,0,97,397],
|
||||
"cpp/numeric/math/tan.html":[9,0,97,444],
|
||||
"cpp/numeric/math/tanh.html":[9,0,97,445],
|
||||
"cpp/numeric/math/tgamma.html":[9,0,97,447],
|
||||
"cpp/numeric/math/trunc.html":[9,0,97,461],
|
||||
"cpp/numeric/random/generate_canonical.html":[9,0,97,170],
|
||||
"cpp/numeric/random/rand.html":[9,0,97,333],
|
||||
"cpp/numeric/random/srand.html":[9,0,97,398],
|
||||
"cpp/regex/regex_match.html":[9,0,97,337],
|
||||
"cpp/regex/regex_replace.html":[9,0,97,338],
|
||||
"cpp/regex/regex_search.html":[9,0,97,339],
|
||||
"cpp/string/basic_string/getline.html":[9,0,97,183],
|
||||
"cpp/string/basic_string/stof.html":[9,0,97,404],
|
||||
"cpp/string/basic_string/stof.html":[9,0,97,407],
|
||||
"cpp/string/basic_string/stof.html":[9,0,97,403],
|
||||
"cpp/string/basic_string/stol.html":[9,0,97,406],
|
||||
"cpp/string/basic_string/stol.html":[9,0,97,408],
|
||||
"cpp/string/basic_string/stol.html":[9,0,97,405],
|
||||
"cpp/string/basic_string/stoul.html":[9,0,97,410],
|
||||
"cpp/string/basic_string/stoul.html":[9,0,97,409],
|
||||
"cpp/string/basic_string/to_string.html":[9,0,97,453],
|
||||
"cpp/string/basic_string/to_wstring.html":[9,0,97,454],
|
||||
"cpp/string/byte/atof.html":[9,0,97,34],
|
||||
"cpp/string/byte/atoi.html":[9,0,97,36],
|
||||
"cpp/string/byte/atoi.html":[9,0,97,35],
|
||||
"cpp/string/byte/atoi.html":[9,0,97,37],
|
||||
"cpp/string/byte/isalnum.html":[9,0,97,204],
|
||||
"cpp/string/byte/isalpha.html":[9,0,97,205],
|
||||
"cpp/string/byte/isblank.html":[9,0,97,206],
|
||||
"cpp/string/byte/iscntrl.html":[9,0,97,207],
|
||||
"cpp/string/byte/isdigit.html":[9,0,97,208],
|
||||
"cpp/string/byte/isgraph.html":[9,0,97,210],
|
||||
"cpp/string/byte/islower.html":[9,0,97,212],
|
||||
"cpp/string/byte/isprint.html":[9,0,97,215],
|
||||
"cpp/string/byte/ispunct.html":[9,0,97,216],
|
||||
"cpp/string/byte/isspace.html":[9,0,97,217],
|
||||
"cpp/string/byte/isupper.html":[9,0,97,218],
|
||||
"cpp/string/byte/isxdigit.html":[9,0,97,232],
|
||||
"cpp/string/byte/memchr.html":[9,0,97,274],
|
||||
"cpp/string/byte/memcmp.html":[9,0,97,275],
|
||||
"cpp/string/byte/memcpy.html":[9,0,97,276],
|
||||
"cpp/string/byte/memmove.html":[9,0,97,277],
|
||||
"cpp/string/byte/memset.html":[9,0,97,278],
|
||||
"cpp/string/byte/strcat.html":[9,0,97,411],
|
||||
"cpp/string/byte/strchr.html":[9,0,97,412],
|
||||
"cpp/string/byte/strcmp.html":[9,0,97,413],
|
||||
"cpp/string/byte/strcoll.html":[9,0,97,414],
|
||||
"cpp/string/byte/strcpy.html":[9,0,97,415],
|
||||
"cpp/string/byte/strcspn.html":[9,0,97,416],
|
||||
"cpp/string/byte/strerror.html":[9,0,97,417],
|
||||
"cpp/string/byte/strlen.html":[9,0,97,419],
|
||||
"cpp/string/byte/strncat.html":[9,0,97,420],
|
||||
"cpp/string/byte/strncmp.html":[9,0,97,421],
|
||||
"cpp/string/byte/strncpy.html":[9,0,97,422],
|
||||
"cpp/string/byte/strpbrk.html":[9,0,97,423],
|
||||
"cpp/string/byte/strrchr.html":[9,0,97,424],
|
||||
"cpp/string/byte/strspn.html":[9,0,97,425],
|
||||
"cpp/string/byte/strstr.html":[9,0,97,426],
|
||||
"cpp/string/byte/strtof.html":[9,0,97,427],
|
||||
"cpp/string/byte/strtof.html":[9,0,97,428],
|
||||
"cpp/string/byte/strtof.html":[9,0,97,432],
|
||||
"cpp/string/byte/strtoimax.html":[9,0,97,429],
|
||||
"cpp/string/byte/strtoimax.html":[9,0,97,436],
|
||||
"cpp/string/byte/strtok.html":[9,0,97,430],
|
||||
"cpp/string/byte/strtol.html":[9,0,97,431],
|
||||
"cpp/string/byte/strtol.html":[9,0,97,433],
|
||||
"cpp/string/byte/strtoul.html":[9,0,97,435],
|
||||
"cpp/string/byte/strtoul.html":[9,0,97,434],
|
||||
"cpp/string/byte/strxfrm.html":[9,0,97,437],
|
||||
"cpp/string/byte/tolower.html":[9,0,97,455],
|
||||
"cpp/string/byte/toupper.html":[9,0,97,456],
|
||||
"cpp/string/multibyte/btowc.html":[9,0,97,68],
|
||||
"cpp/string/multibyte/c16rtomb.html":[9,0,97,69],
|
||||
"cpp/string/multibyte/c32rtomb.html":[9,0,97,70],
|
||||
"cpp/string/multibyte/mblen.html":[9,0,97,264],
|
||||
"cpp/string/multibyte/mbrlen.html":[9,0,97,265],
|
||||
"cpp/string/multibyte/mbrtoc16.html":[9,0,97,266],
|
||||
"cpp/string/multibyte/mbrtoc32.html":[9,0,97,267],
|
||||
"cpp/string/multibyte/mbrtowc.html":[9,0,97,268],
|
||||
"cpp/string/multibyte/mbsinit.html":[9,0,97,269],
|
||||
"cpp/string/multibyte/mbsrtowcs.html":[9,0,97,270],
|
||||
"cpp/string/multibyte/mbstowcs.html":[9,0,97,271],
|
||||
"cpp/string/multibyte/mbtowc.html":[9,0,97,272],
|
||||
"cpp/string/multibyte/wcrtomb.html":[9,0,97,493],
|
||||
"cpp/string/multibyte/wcstombs.html":[9,0,97,516],
|
||||
"cpp/string/multibyte/wctob.html":[9,0,97,521],
|
||||
"cpp/string/multibyte/wctomb.html":[9,0,97,522],
|
||||
"cpp/string/wide/iswalnum.html":[9,0,97,219],
|
||||
"cpp/string/wide/iswalpha.html":[9,0,97,220],
|
||||
"cpp/string/wide/iswblank.html":[9,0,97,221],
|
||||
"cpp/string/wide/iswcntrl.html":[9,0,97,222],
|
||||
"cpp/string/wide/iswctype.html":[9,0,97,223],
|
||||
"cpp/string/wide/iswdigit.html":[9,0,97,224],
|
||||
"cpp/string/wide/iswgraph.html":[9,0,97,225],
|
||||
"cpp/string/wide/iswlower.html":[9,0,97,226],
|
||||
"cpp/string/wide/iswprint.html":[9,0,97,227],
|
||||
"cpp/string/wide/iswpunct.html":[9,0,97,228],
|
||||
"cpp/string/wide/iswspace.html":[9,0,97,229],
|
||||
"cpp/string/wide/iswupper.html":[9,0,97,230],
|
||||
"cpp/string/wide/iswxdigit.html":[9,0,97,231],
|
||||
"cpp/string/wide/towctrans.html":[9,0,97,457],
|
||||
"cpp/string/wide/towlower.html":[9,0,97,458],
|
||||
"cpp/string/wide/towupper.html":[9,0,97,459],
|
||||
"cpp/string/wide/wcscat.html":[9,0,97,494],
|
||||
"cpp/string/wide/wcschr.html":[9,0,97,495],
|
||||
"cpp/string/wide/wcscmp.html":[9,0,97,496],
|
||||
"cpp/string/wide/wcscoll.html":[9,0,97,497],
|
||||
"cpp/string/wide/wcscpy.html":[9,0,97,498],
|
||||
"cpp/string/wide/wcscspn.html":[9,0,97,499],
|
||||
"cpp/string/wide/wcslen.html":[9,0,97,501],
|
||||
"cpp/string/wide/wcsncat.html":[9,0,97,502],
|
||||
"cpp/string/wide/wcsncmp.html":[9,0,97,503],
|
||||
"cpp/string/wide/wcsncpy.html":[9,0,97,504],
|
||||
"cpp/string/wide/wcspbrk.html":[9,0,97,505],
|
||||
"cpp/string/wide/wcsrchr.html":[9,0,97,506],
|
||||
"cpp/string/wide/wcsspn.html":[9,0,97,507],
|
||||
"cpp/string/wide/wcsstr.html":[9,0,97,508],
|
||||
"cpp/string/wide/wcstof.html":[9,0,97,509],
|
||||
"cpp/string/wide/wcstof.html":[9,0,97,510],
|
||||
"cpp/string/wide/wcstof.html":[9,0,97,514],
|
||||
"cpp/string/wide/wcstoimax.html":[9,0,97,511],
|
||||
"cpp/string/wide/wcstoimax.html":[9,0,97,519],
|
||||
"cpp/string/wide/wcstok.html":[9,0,97,512],
|
||||
"cpp/string/wide/wcstol.html":[9,0,97,513],
|
||||
"cpp/string/wide/wcstol.html":[9,0,97,515],
|
||||
"cpp/string/wide/wcstoul.html":[9,0,97,517],
|
||||
"cpp/string/wide/wcstoul.html":[9,0,97,518],
|
||||
"cpp/string/wide/wcsxfrm.html":[9,0,97,520],
|
||||
"cpp/string/wide/wctrans.html":[9,0,97,523],
|
||||
"cpp/string/wide/wctype.html":[9,0,97,524],
|
||||
"cpp/string/wide/wmemchr.html":[9,0,97,525],
|
||||
"cpp/string/wide/wmemcmp.html":[9,0,97,526],
|
||||
"cpp/string/wide/wmemcpy.html":[9,0,97,527],
|
||||
"cpp/string/wide/wmemmove.html":[9,0,97,528],
|
||||
"cpp/string/wide/wmemset.html":[9,0,97,529],
|
||||
"cpp/thread/async.html":[9,0,97,28],
|
||||
"cpp/thread/call_once.html":[9,0,97,71],
|
||||
"cpp/thread/future/future_category.html":[9,0,97,165],
|
||||
"cpp/thread/get_id.html":[9,0,97,3,0]
|
||||
"cpp/iterator/distance.html":[9,0,99,96],
|
||||
"cpp/iterator/end.html":[9,0,99,99],
|
||||
"cpp/iterator/front_inserter.html":[9,0,99,160],
|
||||
"cpp/iterator/inserter.html":[9,0,99,195],
|
||||
"cpp/iterator/make_move_iterator.html":[9,0,99,257],
|
||||
"cpp/iterator/next.html":[9,0,99,294],
|
||||
"cpp/iterator/prev.html":[9,0,99,320],
|
||||
"cpp/locale/has_facet.html":[9,0,99,187],
|
||||
"cpp/locale/localeconv.html":[9,0,99,244],
|
||||
"cpp/locale/setlocale.html":[9,0,99,380],
|
||||
"cpp/locale/use_facet.html":[9,0,99,479],
|
||||
"cpp/memory/addressof.html":[9,0,99,17],
|
||||
"cpp/memory/align.html":[9,0,99,21],
|
||||
"cpp/memory/c/calloc.html":[9,0,99,72],
|
||||
"cpp/memory/c/free.html":[9,0,99,157],
|
||||
"cpp/memory/c/malloc.html":[9,0,99,261],
|
||||
"cpp/memory/c/realloc.html":[9,0,99,335],
|
||||
"cpp/memory/gc/declare_no_pointers.html":[9,0,99,91],
|
||||
"cpp/memory/gc/declare_reachable.html":[9,0,99,92],
|
||||
"cpp/memory/gc/get_pointer_safety.html":[9,0,99,175],
|
||||
"cpp/memory/gc/undeclare_no_pointers.html":[9,0,99,465],
|
||||
"cpp/memory/gc/undeclare_reachable.html":[9,0,99,466],
|
||||
"cpp/memory/get_temporary_buffer.html":[9,0,99,176],
|
||||
"cpp/memory/new/get_new_handler.html":[9,0,99,174],
|
||||
"cpp/memory/new/set_new_handler.html":[9,0,99,371],
|
||||
"cpp/memory/return_temporary_buffer.html":[9,0,99,354],
|
||||
"cpp/memory/shared_ptr/allocate_shared.html":[9,0,99,23],
|
||||
"cpp/memory/shared_ptr/make_shared.html":[9,0,99,259],
|
||||
"cpp/memory/shared_ptr/pointer_cast.html":[9,0,99,402],
|
||||
"cpp/memory/shared_ptr/pointer_cast.html":[9,0,99,77],
|
||||
"cpp/memory/shared_ptr/pointer_cast.html":[9,0,99,98],
|
||||
"cpp/memory/uninitialized_copy.html":[9,0,99,470],
|
||||
"cpp/memory/uninitialized_copy_n.html":[9,0,99,471],
|
||||
"cpp/memory/uninitialized_fill.html":[9,0,99,472],
|
||||
"cpp/memory/uninitialized_fill_n.html":[9,0,99,473],
|
||||
"cpp/numeric/fenv/feclearexcept.html":[9,0,99,113],
|
||||
"cpp/numeric/fenv/feenv.html":[9,0,99,114],
|
||||
"cpp/numeric/fenv/feenv.html":[9,0,99,121],
|
||||
"cpp/numeric/fenv/feexceptflag.html":[9,0,99,115],
|
||||
"cpp/numeric/fenv/feexceptflag.html":[9,0,99,122],
|
||||
"cpp/numeric/fenv/feholdexcept.html":[9,0,99,117],
|
||||
"cpp/numeric/fenv/feraiseexcept.html":[9,0,99,119],
|
||||
"cpp/numeric/fenv/feround.html":[9,0,99,123],
|
||||
"cpp/numeric/fenv/feround.html":[9,0,99,116],
|
||||
"cpp/numeric/fenv/fetestexcept.html":[9,0,99,124],
|
||||
"cpp/numeric/fenv/feupdateenv.html":[9,0,99,125],
|
||||
"cpp/numeric/math/abs.html":[9,0,99,235],
|
||||
"cpp/numeric/math/abs.html":[9,0,99,241],
|
||||
"cpp/numeric/math/abs.html":[9,0,99,13],
|
||||
"cpp/numeric/math/acos.html":[9,0,99,15],
|
||||
"cpp/numeric/math/acosh.html":[9,0,99,16],
|
||||
"cpp/numeric/math/asin.html":[9,0,99,26],
|
||||
"cpp/numeric/math/asinh.html":[9,0,99,27],
|
||||
"cpp/numeric/math/atan.html":[9,0,99,30],
|
||||
"cpp/numeric/math/atan2.html":[9,0,99,31],
|
||||
"cpp/numeric/math/atanh.html":[9,0,99,32],
|
||||
"cpp/numeric/math/cbrt.html":[9,0,99,73],
|
||||
"cpp/numeric/math/ceil.html":[9,0,99,74],
|
||||
"cpp/numeric/math/copysign.html":[9,0,99,82],
|
||||
"cpp/numeric/math/cos.html":[9,0,99,83],
|
||||
"cpp/numeric/math/cosh.html":[9,0,99,84],
|
||||
"cpp/numeric/math/div.html":[9,0,99,97],
|
||||
"cpp/numeric/math/div.html":[9,0,99,237],
|
||||
"cpp/numeric/math/erf.html":[9,0,99,104],
|
||||
"cpp/numeric/math/erfc.html":[9,0,99,105],
|
||||
"cpp/numeric/math/exp.html":[9,0,99,107],
|
||||
"cpp/numeric/math/exp2.html":[9,0,99,108],
|
||||
"cpp/numeric/math/expm1.html":[9,0,99,109],
|
||||
"cpp/numeric/math/fabs.html":[9,0,99,12],
|
||||
"cpp/numeric/math/fabs.html":[9,0,99,110],
|
||||
"cpp/numeric/math/fdim.html":[9,0,99,112],
|
||||
"cpp/numeric/math/floor.html":[9,0,99,140],
|
||||
"cpp/numeric/math/fma.html":[9,0,99,142],
|
||||
"cpp/numeric/math/fmax.html":[9,0,99,143],
|
||||
"cpp/numeric/math/fmin.html":[9,0,99,144],
|
||||
"cpp/numeric/math/fmod.html":[9,0,99,145],
|
||||
"cpp/numeric/math/fpclassify.html":[9,0,99,150],
|
||||
"cpp/numeric/math/frexp.html":[9,0,99,159],
|
||||
"cpp/numeric/math/hypot.html":[9,0,99,190],
|
||||
"cpp/numeric/math/ilogb.html":[9,0,99,191],
|
||||
"cpp/numeric/math/isfinite.html":[9,0,99,209],
|
||||
"cpp/numeric/math/isinf.html":[9,0,99,211],
|
||||
"cpp/numeric/math/isnan.html":[9,0,99,213],
|
||||
"cpp/numeric/math/isnormal.html":[9,0,99,214],
|
||||
"cpp/numeric/math/ldexp.html":[9,0,99,236],
|
||||
"cpp/numeric/math/lgamma.html":[9,0,99,240],
|
||||
"cpp/numeric/math/log.html":[9,0,99,247],
|
||||
"cpp/numeric/math/log10.html":[9,0,99,248],
|
||||
"cpp/numeric/math/log1p.html":[9,0,99,249],
|
||||
"cpp/numeric/math/logb.html":[9,0,99,250],
|
||||
"cpp/numeric/math/modf.html":[9,0,99,286],
|
||||
"cpp/numeric/math/nan.html":[9,0,99,290],
|
||||
"cpp/numeric/math/nan.html":[9,0,99,292],
|
||||
"cpp/numeric/math/nan.html":[9,0,99,291],
|
||||
"cpp/numeric/math/nearbyint.html":[9,0,99,293],
|
||||
"cpp/numeric/math/nextafter.html":[9,0,99,297],
|
||||
"cpp/numeric/math/nextafter.html":[9,0,99,296],
|
||||
"cpp/numeric/math/pow.html":[9,0,99,319],
|
||||
"cpp/numeric/math/remainder.html":[9,0,99,340],
|
||||
"cpp/numeric/math/remquo.html":[9,0,99,345],
|
||||
"cpp/numeric/math/rint.html":[9,0,99,242],
|
||||
"cpp/numeric/math/rint.html":[9,0,99,253],
|
||||
"cpp/numeric/math/rint.html":[9,0,99,359],
|
||||
"cpp/numeric/math/round.html":[9,0,99,254],
|
||||
"cpp/numeric/math/round.html":[9,0,99,243],
|
||||
"cpp/numeric/math/round.html":[9,0,99,362],
|
||||
"cpp/numeric/math/scalbn.html":[9,0,99,364],
|
||||
"cpp/numeric/math/scalbn.html":[9,0,99,363],
|
||||
"cpp/numeric/math/signbit.html":[9,0,99,389],
|
||||
"cpp/numeric/math/sin.html":[9,0,99,390],
|
||||
"cpp/numeric/math/sinh.html":[9,0,99,391],
|
||||
"cpp/numeric/math/sqrt.html":[9,0,99,397],
|
||||
"cpp/numeric/math/tan.html":[9,0,99,444],
|
||||
"cpp/numeric/math/tanh.html":[9,0,99,445],
|
||||
"cpp/numeric/math/tgamma.html":[9,0,99,447],
|
||||
"cpp/numeric/math/trunc.html":[9,0,99,461],
|
||||
"cpp/numeric/random/generate_canonical.html":[9,0,99,170],
|
||||
"cpp/numeric/random/rand.html":[9,0,99,333],
|
||||
"cpp/numeric/random/srand.html":[9,0,99,398],
|
||||
"cpp/regex/regex_match.html":[9,0,99,337],
|
||||
"cpp/regex/regex_replace.html":[9,0,99,338],
|
||||
"cpp/regex/regex_search.html":[9,0,99,339],
|
||||
"cpp/string/basic_string/getline.html":[9,0,99,183],
|
||||
"cpp/string/basic_string/stof.html":[9,0,99,404],
|
||||
"cpp/string/basic_string/stof.html":[9,0,99,407],
|
||||
"cpp/string/basic_string/stof.html":[9,0,99,403],
|
||||
"cpp/string/basic_string/stol.html":[9,0,99,406],
|
||||
"cpp/string/basic_string/stol.html":[9,0,99,408],
|
||||
"cpp/string/basic_string/stol.html":[9,0,99,405],
|
||||
"cpp/string/basic_string/stoul.html":[9,0,99,409],
|
||||
"cpp/string/basic_string/stoul.html":[9,0,99,410],
|
||||
"cpp/string/basic_string/to_string.html":[9,0,99,453],
|
||||
"cpp/string/basic_string/to_wstring.html":[9,0,99,454],
|
||||
"cpp/string/byte/atof.html":[9,0,99,34],
|
||||
"cpp/string/byte/atoi.html":[9,0,99,37],
|
||||
"cpp/string/byte/atoi.html":[9,0,99,35],
|
||||
"cpp/string/byte/atoi.html":[9,0,99,36],
|
||||
"cpp/string/byte/isalnum.html":[9,0,99,204],
|
||||
"cpp/string/byte/isalpha.html":[9,0,99,205],
|
||||
"cpp/string/byte/isblank.html":[9,0,99,206],
|
||||
"cpp/string/byte/iscntrl.html":[9,0,99,207],
|
||||
"cpp/string/byte/isdigit.html":[9,0,99,208],
|
||||
"cpp/string/byte/isgraph.html":[9,0,99,210],
|
||||
"cpp/string/byte/islower.html":[9,0,99,212],
|
||||
"cpp/string/byte/isprint.html":[9,0,99,215],
|
||||
"cpp/string/byte/ispunct.html":[9,0,99,216],
|
||||
"cpp/string/byte/isspace.html":[9,0,99,217],
|
||||
"cpp/string/byte/isupper.html":[9,0,99,218],
|
||||
"cpp/string/byte/isxdigit.html":[9,0,99,232],
|
||||
"cpp/string/byte/memchr.html":[9,0,99,274],
|
||||
"cpp/string/byte/memcmp.html":[9,0,99,275],
|
||||
"cpp/string/byte/memcpy.html":[9,0,99,276],
|
||||
"cpp/string/byte/memmove.html":[9,0,99,277],
|
||||
"cpp/string/byte/memset.html":[9,0,99,278],
|
||||
"cpp/string/byte/strcat.html":[9,0,99,411],
|
||||
"cpp/string/byte/strchr.html":[9,0,99,412],
|
||||
"cpp/string/byte/strcmp.html":[9,0,99,413],
|
||||
"cpp/string/byte/strcoll.html":[9,0,99,414],
|
||||
"cpp/string/byte/strcpy.html":[9,0,99,415],
|
||||
"cpp/string/byte/strcspn.html":[9,0,99,416],
|
||||
"cpp/string/byte/strerror.html":[9,0,99,417],
|
||||
"cpp/string/byte/strlen.html":[9,0,99,419],
|
||||
"cpp/string/byte/strncat.html":[9,0,99,420],
|
||||
"cpp/string/byte/strncmp.html":[9,0,99,421],
|
||||
"cpp/string/byte/strncpy.html":[9,0,99,422],
|
||||
"cpp/string/byte/strpbrk.html":[9,0,99,423],
|
||||
"cpp/string/byte/strrchr.html":[9,0,99,424],
|
||||
"cpp/string/byte/strspn.html":[9,0,99,425],
|
||||
"cpp/string/byte/strstr.html":[9,0,99,426],
|
||||
"cpp/string/byte/strtof.html":[9,0,99,428],
|
||||
"cpp/string/byte/strtof.html":[9,0,99,432],
|
||||
"cpp/string/byte/strtof.html":[9,0,99,427],
|
||||
"cpp/string/byte/strtoimax.html":[9,0,99,429],
|
||||
"cpp/string/byte/strtoimax.html":[9,0,99,436],
|
||||
"cpp/string/byte/strtok.html":[9,0,99,430],
|
||||
"cpp/string/byte/strtol.html":[9,0,99,433],
|
||||
"cpp/string/byte/strtol.html":[9,0,99,431],
|
||||
"cpp/string/byte/strtoul.html":[9,0,99,434],
|
||||
"cpp/string/byte/strtoul.html":[9,0,99,435],
|
||||
"cpp/string/byte/strxfrm.html":[9,0,99,437],
|
||||
"cpp/string/byte/tolower.html":[9,0,99,455],
|
||||
"cpp/string/byte/toupper.html":[9,0,99,456],
|
||||
"cpp/string/multibyte/btowc.html":[9,0,99,68],
|
||||
"cpp/string/multibyte/c16rtomb.html":[9,0,99,69],
|
||||
"cpp/string/multibyte/c32rtomb.html":[9,0,99,70],
|
||||
"cpp/string/multibyte/mblen.html":[9,0,99,264],
|
||||
"cpp/string/multibyte/mbrlen.html":[9,0,99,265],
|
||||
"cpp/string/multibyte/mbrtoc16.html":[9,0,99,266],
|
||||
"cpp/string/multibyte/mbrtoc32.html":[9,0,99,267],
|
||||
"cpp/string/multibyte/mbrtowc.html":[9,0,99,268],
|
||||
"cpp/string/multibyte/mbsinit.html":[9,0,99,269],
|
||||
"cpp/string/multibyte/mbsrtowcs.html":[9,0,99,270],
|
||||
"cpp/string/multibyte/mbstowcs.html":[9,0,99,271],
|
||||
"cpp/string/multibyte/mbtowc.html":[9,0,99,272],
|
||||
"cpp/string/multibyte/wcrtomb.html":[9,0,99,493],
|
||||
"cpp/string/multibyte/wcstombs.html":[9,0,99,516],
|
||||
"cpp/string/multibyte/wctob.html":[9,0,99,521],
|
||||
"cpp/string/multibyte/wctomb.html":[9,0,99,522],
|
||||
"cpp/string/wide/iswalnum.html":[9,0,99,219],
|
||||
"cpp/string/wide/iswalpha.html":[9,0,99,220],
|
||||
"cpp/string/wide/iswblank.html":[9,0,99,221],
|
||||
"cpp/string/wide/iswcntrl.html":[9,0,99,222],
|
||||
"cpp/string/wide/iswctype.html":[9,0,99,223],
|
||||
"cpp/string/wide/iswdigit.html":[9,0,99,224],
|
||||
"cpp/string/wide/iswgraph.html":[9,0,99,225],
|
||||
"cpp/string/wide/iswlower.html":[9,0,99,226],
|
||||
"cpp/string/wide/iswprint.html":[9,0,99,227],
|
||||
"cpp/string/wide/iswpunct.html":[9,0,99,228],
|
||||
"cpp/string/wide/iswspace.html":[9,0,99,229],
|
||||
"cpp/string/wide/iswupper.html":[9,0,99,230],
|
||||
"cpp/string/wide/iswxdigit.html":[9,0,99,231],
|
||||
"cpp/string/wide/towctrans.html":[9,0,99,457],
|
||||
"cpp/string/wide/towlower.html":[9,0,99,458],
|
||||
"cpp/string/wide/towupper.html":[9,0,99,459],
|
||||
"cpp/string/wide/wcscat.html":[9,0,99,494],
|
||||
"cpp/string/wide/wcschr.html":[9,0,99,495],
|
||||
"cpp/string/wide/wcscmp.html":[9,0,99,496],
|
||||
"cpp/string/wide/wcscoll.html":[9,0,99,497],
|
||||
"cpp/string/wide/wcscpy.html":[9,0,99,498],
|
||||
"cpp/string/wide/wcscspn.html":[9,0,99,499],
|
||||
"cpp/string/wide/wcslen.html":[9,0,99,501],
|
||||
"cpp/string/wide/wcsncat.html":[9,0,99,502],
|
||||
"cpp/string/wide/wcsncmp.html":[9,0,99,503],
|
||||
"cpp/string/wide/wcsncpy.html":[9,0,99,504],
|
||||
"cpp/string/wide/wcspbrk.html":[9,0,99,505],
|
||||
"cpp/string/wide/wcsrchr.html":[9,0,99,506],
|
||||
"cpp/string/wide/wcsspn.html":[9,0,99,507],
|
||||
"cpp/string/wide/wcsstr.html":[9,0,99,508],
|
||||
"cpp/string/wide/wcstof.html":[9,0,99,509],
|
||||
"cpp/string/wide/wcstof.html":[9,0,99,514],
|
||||
"cpp/string/wide/wcstof.html":[9,0,99,510],
|
||||
"cpp/string/wide/wcstoimax.html":[9,0,99,519],
|
||||
"cpp/string/wide/wcstoimax.html":[9,0,99,511],
|
||||
"cpp/string/wide/wcstok.html":[9,0,99,512],
|
||||
"cpp/string/wide/wcstol.html":[9,0,99,513],
|
||||
"cpp/string/wide/wcstol.html":[9,0,99,515],
|
||||
"cpp/string/wide/wcstoul.html":[9,0,99,517],
|
||||
"cpp/string/wide/wcstoul.html":[9,0,99,518],
|
||||
"cpp/string/wide/wcsxfrm.html":[9,0,99,520],
|
||||
"cpp/string/wide/wctrans.html":[9,0,99,523],
|
||||
"cpp/string/wide/wctype.html":[9,0,99,524],
|
||||
"cpp/string/wide/wmemchr.html":[9,0,99,525],
|
||||
"cpp/string/wide/wmemcmp.html":[9,0,99,526],
|
||||
"cpp/string/wide/wmemcpy.html":[9,0,99,527],
|
||||
"cpp/string/wide/wmemmove.html":[9,0,99,528],
|
||||
"cpp/string/wide/wmemset.html":[9,0,99,529],
|
||||
"cpp/thread/async.html":[9,0,99,28],
|
||||
"cpp/thread/call_once.html":[9,0,99,71],
|
||||
"cpp/thread/future/future_category.html":[9,0,99,165],
|
||||
"cpp/thread/get_id.html":[9,0,99,3,0]
|
||||
};
|
||||
|
||||
@@ -1,10 +1,21 @@
|
||||
var NAVTREEINDEX10 =
|
||||
{
|
||||
"da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e":[11,0,8,5,5],
|
||||
"da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,8,5,3],
|
||||
"da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9":[11,0,8,5,1],
|
||||
"da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9":[9,0,30,1,1],
|
||||
"da/d4b/depth__first__search__with__stack_8cpp.html#a7f1cd94cf4da32933e8551cb3577e18b":[11,0,8,5,4],
|
||||
"da/d4b/depth__first__search__with__stack_8cpp.html#aadebe9c855821d6515ca5b171222ef7b":[9,0,30,1,0],
|
||||
"da/d4b/depth__first__search__with__stack_8cpp.html#aadebe9c855821d6515ca5b171222ef7b":[11,0,8,5,0],
|
||||
"da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,8,5,2],
|
||||
"da/d4b/depth__first__search__with__stack_8cpp.html#afb80b42b42381658a12a57a975ecd0c7":[11,0,8,5,7],
|
||||
"da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html":[11,0,1,1],
|
||||
"da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#a0d5e1d651d0d30bd682f176d8f2b83d0":[11,0,1,1,1],
|
||||
"da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,1,2],
|
||||
"da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,1,0],
|
||||
"da/d52/minimum__edit__distance_8cpp.html":[11,0,6,8],
|
||||
"da/d52/minimum__edit__distance_8cpp.html#a0138c226bd79ffe6d839c787cfc60347":[9,0,24,6,1],
|
||||
"da/d52/minimum__edit__distance_8cpp.html#a0138c226bd79ffe6d839c787cfc60347":[11,0,6,8,2],
|
||||
"da/d52/minimum__edit__distance_8cpp.html#a0138c226bd79ffe6d839c787cfc60347":[9,0,24,6,1],
|
||||
"da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,6,8,1],
|
||||
"da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,8,3],
|
||||
"da/d52/minimum__edit__distance_8cpp.html#ade2fcfe0359f3c7691bfaa04b14943e2":[11,0,6,8,0],
|
||||
@@ -22,39 +33,39 @@ var NAVTREEINDEX10 =
|
||||
"da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41":[10,0,21,3],
|
||||
"da/d5a/class_complex.html#ae5b51b749ea4964104b9527af9d8f556":[10,0,21,2],
|
||||
"da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974":[10,0,21,4],
|
||||
"da/d61/structsearch_1_1sublist__search_1_1_node.html":[9,0,88,3,0],
|
||||
"da/d61/structsearch_1_1sublist__search_1_1_node.html":[10,0,13,0,0],
|
||||
"da/d61/structsearch_1_1sublist__search_1_1_node.html":[9,0,90,3,0],
|
||||
"da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b":[10,0,13,0,0,0],
|
||||
"da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b":[9,0,88,3,0,0],
|
||||
"da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a":[9,0,88,3,0,1],
|
||||
"da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b":[9,0,90,3,0,0],
|
||||
"da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a":[9,0,90,3,0,1],
|
||||
"da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a":[10,0,13,0,0,1],
|
||||
"da/d6d/namespaceoperations__on__datastructures.html":[9,0,71],
|
||||
"da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86":[9,0,71,7],
|
||||
"da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74":[9,0,71,4],
|
||||
"da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20":[9,0,71,5],
|
||||
"da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e":[9,0,71,3],
|
||||
"da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8":[9,0,71,6],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html":[9,0,52,0,0,1],
|
||||
"da/d6d/namespaceoperations__on__datastructures.html":[9,0,73],
|
||||
"da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86":[9,0,73,7],
|
||||
"da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74":[9,0,73,4],
|
||||
"da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20":[9,0,73,5],
|
||||
"da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e":[9,0,73,3],
|
||||
"da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8":[9,0,73,6],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html":[9,0,54,0,0,1],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html":[10,0,6,0,0,1],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d":[10,0,6,0,0,1,8],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d":[9,0,52,0,0,1,8],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d":[9,0,54,0,0,1,8],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3":[10,0,6,0,0,1,9],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3":[9,0,52,0,0,1,9],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3":[9,0,54,0,0,1,9],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5":[9,0,54,0,0,1,3],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5":[10,0,6,0,0,1,3],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5":[9,0,52,0,0,1,3],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8":[9,0,52,0,0,1,1],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8":[10,0,6,0,0,1,1],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8":[9,0,54,0,0,1,1],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a":[10,0,6,0,0,1,4],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a":[9,0,52,0,0,1,4],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aa816af5a64b37c86be8acda89fdefba2":[9,0,52,0,0,1,5],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a":[9,0,54,0,0,1,4],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aa816af5a64b37c86be8acda89fdefba2":[9,0,54,0,0,1,5],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aa816af5a64b37c86be8acda89fdefba2":[10,0,6,0,0,1,5],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7":[9,0,52,0,0,1,0],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7":[9,0,54,0,0,1,0],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7":[10,0,6,0,0,1,0],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317":[9,0,52,0,0,1,6],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317":[9,0,54,0,0,1,6],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317":[10,0,6,0,0,1,6],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8":[10,0,6,0,0,1,2],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8":[9,0,52,0,0,1,2],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57":[9,0,52,0,0,1,7],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8":[9,0,54,0,0,1,2],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57":[9,0,54,0,0,1,7],
|
||||
"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57":[10,0,6,0,0,1,7],
|
||||
"da/d77/spirograph_8cpp.html":[11,0,9,0],
|
||||
"da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,9,0,1],
|
||||
@@ -86,11 +97,11 @@ var NAVTREEINDEX10 =
|
||||
"da/da3/uint256__t_8hpp_source.html":[11,0,2,7],
|
||||
"da/dac/n__queens__all__solution__optimised_8cpp.html":[11,0,0,4],
|
||||
"da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905":[11,0,0,4,3],
|
||||
"da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905":[9,0,5,2,2],
|
||||
"da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f":[9,0,5,2,1],
|
||||
"da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905":[9,0,5,4,2],
|
||||
"da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f":[9,0,5,4,1],
|
||||
"da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f":[11,0,0,4,2],
|
||||
"da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9":[9,0,5,4,0],
|
||||
"da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9":[11,0,0,4,0],
|
||||
"da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9":[9,0,5,2,0],
|
||||
"da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,4,1],
|
||||
"da/db8/count__of__set__bits_8cpp.html":[11,0,1,0],
|
||||
"da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62":[11,0,1,0,0],
|
||||
@@ -103,22 +114,22 @@ var NAVTREEINDEX10 =
|
||||
"da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f":[11,0,14,16,0],
|
||||
"da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,14,16,2],
|
||||
"da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,16,1],
|
||||
"da/dd1/structquadratic__probing_1_1_entry.html":[9,0,79,0],
|
||||
"da/dd1/structquadratic__probing_1_1_entry.html":[9,0,81,0],
|
||||
"da/dd1/structquadratic__probing_1_1_entry.html":[10,0,11,0],
|
||||
"da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8":[9,0,79,0,1],
|
||||
"da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8":[10,0,11,0,1],
|
||||
"da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8":[9,0,81,0,1],
|
||||
"da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e":[9,0,81,0,0],
|
||||
"da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e":[10,0,11,0,0],
|
||||
"da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e":[9,0,79,0,0],
|
||||
"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html":[11,0,5,0],
|
||||
"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#a7a890d2f26855ada3b9f1d43aec70a86":[11,0,5,0,1],
|
||||
"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#a7d1dbae365c7746295d3322e6f7f80b6":[11,0,5,0,0],
|
||||
"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,5,0,3],
|
||||
"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,5,0,2],
|
||||
"da/dd3/namespacespirograph.html":[9,0,94],
|
||||
"da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99":[9,0,94,1],
|
||||
"da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac":[9,0,94,0],
|
||||
"da/dd4/namespacemedian__search.html":[9,0,57],
|
||||
"da/dda/namespaceradix__sort.html":[9,0,81],
|
||||
"da/dd3/namespacespirograph.html":[9,0,96],
|
||||
"da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99":[9,0,96,1],
|
||||
"da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac":[9,0,96,0],
|
||||
"da/dd4/namespacemedian__search.html":[9,0,59],
|
||||
"da/dda/namespaceradix__sort.html":[9,0,83],
|
||||
"da/de7/decimal__to__hexadecimal_8cpp.html":[11,0,17,2],
|
||||
"da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe":[11,0,17,2,0],
|
||||
"da/df2/durand__kerner__roots_8cpp.html":[11,0,15,2],
|
||||
@@ -138,7 +149,7 @@ var NAVTREEINDEX10 =
|
||||
"db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e":[11,0,15,1,6],
|
||||
"db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,1,3],
|
||||
"db/d03/_s_t-example.html":[12,0],
|
||||
"db/d03/namespacewildcard__matching.html":[9,0,113],
|
||||
"db/d03/namespacewildcard__matching.html":[9,0,116],
|
||||
"db/d07/spiral__print_8cpp.html":[11,0,17,17],
|
||||
"db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197":[11,0,17,17,2],
|
||||
"db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5":[11,0,17,17,0],
|
||||
@@ -156,14 +167,14 @@ var NAVTREEINDEX10 =
|
||||
"db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,0,2],
|
||||
"db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,0,0],
|
||||
"db/d19/structlinear__probing_1_1_entry.html":[10,0,5,0],
|
||||
"db/d19/structlinear__probing_1_1_entry.html":[9,0,46,0],
|
||||
"db/d19/structlinear__probing_1_1_entry.html":[9,0,48,0],
|
||||
"db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77":[10,0,5,0,0],
|
||||
"db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77":[9,0,46,0,0],
|
||||
"db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a":[9,0,46,0,1],
|
||||
"db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77":[9,0,48,0,0],
|
||||
"db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a":[9,0,48,0,1],
|
||||
"db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a":[10,0,5,0,1],
|
||||
"db/d27/n__bonacci_8cpp.html":[11,0,14,35],
|
||||
"db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d":[9,0,55,4,0],
|
||||
"db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d":[11,0,14,35,1],
|
||||
"db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d":[9,0,57,4,0],
|
||||
"db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,35,2],
|
||||
"db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,35,0],
|
||||
"db/d3c/tower__of__hanoi_8cpp.html":[11,0,17,19],
|
||||
@@ -173,34 +184,34 @@ var NAVTREEINDEX10 =
|
||||
"db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d":[11,0,17,19,2],
|
||||
"db/d3f/wave__sort_8cpp.html":[11,0,21,22],
|
||||
"db/d3f/wave__sort_8cpp.html#a7d4f243b9dc13ace4ef77e30dbc56f12":[11,0,21,22,2],
|
||||
"db/d3f/wave__sort_8cpp.html#a7d4f243b9dc13ace4ef77e30dbc56f12":[9,0,92,9,0],
|
||||
"db/d3f/wave__sort_8cpp.html#a7d4f243b9dc13ace4ef77e30dbc56f12":[9,0,94,9,0],
|
||||
"db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,21,22,1],
|
||||
"db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,22,0],
|
||||
"db/d40/integral__approximation2_8cpp.html":[11,0,14,23],
|
||||
"db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf":[9,0,55,3,0],
|
||||
"db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf":[9,0,57,3,0],
|
||||
"db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf":[11,0,14,23,0],
|
||||
"db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,23,3],
|
||||
"db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,23,2],
|
||||
"db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51":[9,0,55,3,1],
|
||||
"db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51":[11,0,14,23,1],
|
||||
"db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51":[9,0,57,3,1],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html":[9,0,18,4,0],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html":[10,0,1,4,0],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323":[10,0,1,4,0,4],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323":[9,0,18,4,0,4],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7":[9,0,18,4,0,3],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323":[10,0,1,4,0,4],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7":[10,0,1,4,0,3],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7":[9,0,18,4,0,3],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb":[9,0,18,4,0,0],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb":[10,0,1,4,0,0],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39":[10,0,1,4,0,2],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39":[9,0,18,4,0,2],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6":[10,0,1,4,0,6],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6":[9,0,18,4,0,6],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2":[9,0,18,4,0,1],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2":[10,0,1,4,0,1],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2":[9,0,18,4,0,1],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b":[10,0,1,4,0,5],
|
||||
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b":[9,0,18,4,0,5],
|
||||
"db/d66/struct_item.html":[10,0,31],
|
||||
"db/d6f/namespaceheavy__light__decomposition.html":[9,0,33],
|
||||
"db/d6f/namespaceheavy__light__decomposition.html":[9,0,34],
|
||||
"db/d71/quadratic__probing__hash__table_8cpp.html":[11,0,11,4],
|
||||
"db/d71/quadratic__probing__hash__table_8cpp.html#a00ebcc6d39653eccc26f8432efbfc8d9":[11,0,11,4,1],
|
||||
"db/d71/quadratic__probing__hash__table_8cpp.html#a07a0467b24102260fbb6b554c453c20a":[11,0,11,4,11],
|
||||
@@ -238,16 +249,5 @@ var NAVTREEINDEX10 =
|
||||
"db/d8b/struct_node.html":[10,0,38],
|
||||
"db/d93/check__prime_8cpp.html":[11,0,14,6],
|
||||
"db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532":[11,0,14,6,0],
|
||||
"db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,6,1],
|
||||
"db/d9a/classuint128__t.html":[10,0,52],
|
||||
"db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40":[10,0,52,18],
|
||||
"db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3":[10,0,52,37],
|
||||
"db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798":[10,0,52,42],
|
||||
"db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a":[10,0,52,22],
|
||||
"db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9":[10,0,52,65],
|
||||
"db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac":[10,0,52,1],
|
||||
"db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606":[10,0,52,32],
|
||||
"db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190":[10,0,52,50],
|
||||
"db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a":[10,0,52,53],
|
||||
"db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed":[10,0,52,40]
|
||||
"db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,6,1]
|
||||
};
|
||||
|
||||
@@ -1,5 +1,16 @@
|
||||
var NAVTREEINDEX11 =
|
||||
{
|
||||
"db/d9a/classuint128__t.html":[10,0,52],
|
||||
"db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40":[10,0,52,18],
|
||||
"db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3":[10,0,52,37],
|
||||
"db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798":[10,0,52,42],
|
||||
"db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a":[10,0,52,22],
|
||||
"db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9":[10,0,52,65],
|
||||
"db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac":[10,0,52,1],
|
||||
"db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606":[10,0,52,32],
|
||||
"db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190":[10,0,52,50],
|
||||
"db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a":[10,0,52,53],
|
||||
"db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed":[10,0,52,40],
|
||||
"db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705":[10,0,52,77],
|
||||
"db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640":[10,0,52,24],
|
||||
"db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2":[10,0,52,19],
|
||||
@@ -85,18 +96,10 @@ var NAVTREEINDEX11 =
|
||||
"db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243":[11,0,4,18,3],
|
||||
"db/dbc/tree__234_8cpp.html#af1ac73779b0fcfbbdce3976c0ca57342":[11,0,4,18,4],
|
||||
"db/dc0/namespacebacktracking.html":[9,0,5],
|
||||
"db/dc0/namespacebacktracking.html#a29360ddb1bad75caa61ec895b6e71986":[9,0,5,7],
|
||||
"db/dc0/namespacebacktracking.html#a2b98ee79cdbc02ffd7b1f786f9696892":[9,0,5,15],
|
||||
"db/dc0/namespacebacktracking.html#a531de8cb2d4d16ca63353d9c72158257":[9,0,5,10],
|
||||
"db/dc0/namespacebacktracking.html#a5a6c3c2b065ea1c07adf2f638f8efc43":[9,0,5,9],
|
||||
"db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50":[9,0,5,11],
|
||||
"db/dc0/namespacebacktracking.html#a80af16e57cfb6aaab2bf1da4c4db3308":[9,0,5,8],
|
||||
"db/dc0/namespacebacktracking.html#a8cfb2d08840766ac4402196079308a36":[9,0,5,13],
|
||||
"db/dc0/namespacebacktracking.html#a932e38e8912742cedf7b5a837168e03a":[9,0,5,14],
|
||||
"db/dc0/namespacebacktracking.html#ae1a76e21cb3934368d01cea7672d3906":[9,0,5,12],
|
||||
"db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50":[9,0,5,10],
|
||||
"db/dc4/floyd__cycle__detection__algo_8cpp.html":[11,0,20,3],
|
||||
"db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88":[9,0,88,0,0],
|
||||
"db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88":[11,0,20,3,0],
|
||||
"db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88":[9,0,90,0,0],
|
||||
"db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,20,3,2],
|
||||
"db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,3,1],
|
||||
"db/dca/kadane2_8cpp.html":[11,0,6,5],
|
||||
@@ -114,7 +117,7 @@ var NAVTREEINDEX11 =
|
||||
"db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,5,1],
|
||||
"dc/d14/wildcard__matching_8cpp.html":[11,0,0,10],
|
||||
"dc/d14/wildcard__matching_8cpp.html#a4a5b107f93db24e424b12899fa692c5a":[11,0,0,10,2],
|
||||
"dc/d14/wildcard__matching_8cpp.html#a4a5b107f93db24e424b12899fa692c5a":[9,0,5,6,0],
|
||||
"dc/d14/wildcard__matching_8cpp.html#a4a5b107f93db24e424b12899fa692c5a":[9,0,5,9,0],
|
||||
"dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,10,1],
|
||||
"dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,10,0],
|
||||
"dc/d1a/pascal__triangle_8cpp.html":[11,0,17,12],
|
||||
@@ -141,28 +144,28 @@ var NAVTREEINDEX11 =
|
||||
"dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a":[11,0,13,4,1],
|
||||
"dc/d5a/rat__maze_8cpp.html":[11,0,0,6],
|
||||
"dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,6,2],
|
||||
"dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3":[9,0,5,3,0],
|
||||
"dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3":[11,0,0,6,1],
|
||||
"dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3":[9,0,5,5,0],
|
||||
"dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,6,0],
|
||||
"dc/d61/classgraph_1_1_graph.html":[9,0,30,4],
|
||||
"dc/d61/classgraph_1_1_graph.html":[10,0,4,1],
|
||||
"dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981":[9,0,30,4,2],
|
||||
"dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981":[10,0,4,1,2],
|
||||
"dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a":[9,0,30,4,5],
|
||||
"dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a":[10,0,4,1,5],
|
||||
"dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19":[9,0,30,4,1],
|
||||
"dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a":[9,0,30,4,5],
|
||||
"dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19":[10,0,4,1,1],
|
||||
"dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19":[9,0,30,4,1],
|
||||
"dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5":[10,0,4,1,0],
|
||||
"dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5":[9,0,30,4,0],
|
||||
"dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904":[9,0,30,4,3],
|
||||
"dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904":[10,0,4,1,3],
|
||||
"dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0":[9,0,30,4,4],
|
||||
"dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0":[10,0,4,1,4],
|
||||
"dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0":[9,0,30,4,4],
|
||||
"dc/d64/md__coding_guidelines.html":[2],
|
||||
"dc/d64/md__coding_guidelines.html#autotoc_md13":[2,0],
|
||||
"dc/d64/md__coding_guidelines.html#autotoc_md15":[2,1],
|
||||
"dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html":[9,0,97,5],
|
||||
"dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html":[10,0,15,1],
|
||||
"dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html":[9,0,99,5],
|
||||
"dc/d82/area_8cpp.html":[11,0,14,0],
|
||||
"dc/d82/area_8cpp.html#a40e36c67da78d2131408c57ee091ad75":[11,0,14,0,0],
|
||||
"dc/d82/area_8cpp.html#a5de184925e68658f15415dd53954df4f":[11,0,14,0,4],
|
||||
@@ -174,22 +177,22 @@ var NAVTREEINDEX11 =
|
||||
"dc/d82/area_8cpp.html#abc46c784a297fc1d2eb8b33a327fba4c":[11,0,14,0,1],
|
||||
"dc/d82/area_8cpp.html#ac5803413618fcfb922cb32c6db0fc864":[11,0,14,0,2],
|
||||
"dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,0,3],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html":[9,0,54,1,1,0],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html":[10,0,6,1,0,0],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html":[9,0,52,1,1,0],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a11046825be0b6dbb73fbe834aa49200e":[10,0,6,1,0,0,0],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a11046825be0b6dbb73fbe834aa49200e":[9,0,52,1,1,0,0],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a19aaccad279b22dbbb6c55e5697b4114":[9,0,52,1,1,0,6],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a11046825be0b6dbb73fbe834aa49200e":[9,0,54,1,1,0,0],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a19aaccad279b22dbbb6c55e5697b4114":[10,0,6,1,0,0,6],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2":[9,0,52,1,1,0,2],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a19aaccad279b22dbbb6c55e5697b4114":[9,0,54,1,1,0,6],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2":[10,0,6,1,0,0,2],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e":[9,0,52,1,1,0,4],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2":[9,0,54,1,1,0,2],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e":[10,0,6,1,0,0,4],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e":[9,0,54,1,1,0,4],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ac9cda9453c4a0caf5bae7f9213b019a0":[9,0,54,1,1,0,3],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ac9cda9453c4a0caf5bae7f9213b019a0":[10,0,6,1,0,0,3],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ac9cda9453c4a0caf5bae7f9213b019a0":[9,0,52,1,1,0,3],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2":[9,0,54,1,1,0,5],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2":[10,0,6,1,0,0,5],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2":[9,0,52,1,1,0,5],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#af136ec31dbd35b1be2eb9a057677c704":[9,0,54,1,1,0,1],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#af136ec31dbd35b1be2eb9a057677c704":[10,0,6,1,0,0,1],
|
||||
"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#af136ec31dbd35b1be2eb9a057677c704":[9,0,52,1,1,0,1],
|
||||
"dc/d93/trie__modern_8cpp.html":[11,0,4,19],
|
||||
"dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,19,2],
|
||||
"dc/db4/md__r_e_v_i_e_w_e_r__c_o_d_e.html":[6],
|
||||
@@ -199,7 +202,7 @@ var NAVTREEINDEX11 =
|
||||
"dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,20,13,2],
|
||||
"dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,13,1],
|
||||
"dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html":[12,1],
|
||||
"dc/dc5/namespacereverse__binary__tree.html":[9,0,85],
|
||||
"dc/dc5/namespacereverse__binary__tree.html":[9,0,87],
|
||||
"dc/dc5/paranthesis__matching_8cpp.html":[11,0,17,11],
|
||||
"dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326":[11,0,17,11,0],
|
||||
"dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664":[11,0,17,11,2],
|
||||
@@ -208,8 +211,8 @@ var NAVTREEINDEX11 =
|
||||
"dc/dc5/paranthesis__matching_8cpp.html#ade525d33459755a32ba21e1b6910ff21":[11,0,17,11,1],
|
||||
"dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f":[11,0,17,11,5],
|
||||
"dc/dd9/strand__sort_8cpp.html":[11,0,21,21],
|
||||
"dc/dd9/strand__sort_8cpp.html#a2bea2fe5dd38ed63610fdeaddf5785cd":[9,0,92,8,0],
|
||||
"dc/dd9/strand__sort_8cpp.html#a2bea2fe5dd38ed63610fdeaddf5785cd":[11,0,21,21,1],
|
||||
"dc/dd9/strand__sort_8cpp.html#a2bea2fe5dd38ed63610fdeaddf5785cd":[9,0,94,8,0],
|
||||
"dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,21,21,2],
|
||||
"dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,21,0],
|
||||
"dc/dfb/atbash__cipher_8cpp.html":[11,0,2,1],
|
||||
@@ -239,15 +242,12 @@ var NAVTREEINDEX11 =
|
||||
"dd/d0d/insertion__sort_8cpp.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f":[11,0,21,8,1],
|
||||
"dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,8,3],
|
||||
"dd/d12/vigenere__cipher_8cpp.html":[11,0,2,8],
|
||||
"dd/d12/vigenere__cipher_8cpp.html#a3cfc3f9b20a0f230a2fcefd31dc6848e":[11,0,2,8,0],
|
||||
"dd/d12/vigenere__cipher_8cpp.html#a3cfc3f9b20a0f230a2fcefd31dc6848e":[9,0,11,5,0],
|
||||
"dd/d12/vigenere__cipher_8cpp.html#a6bd3880ea6820c232c1eddf47553c257":[9,0,11,5,1],
|
||||
"dd/d12/vigenere__cipher_8cpp.html#a3cfc3f9b20a0f230a2fcefd31dc6848e":[11,0,2,8,0],
|
||||
"dd/d12/vigenere__cipher_8cpp.html#a6bd3880ea6820c232c1eddf47553c257":[11,0,2,8,1],
|
||||
"dd/d12/vigenere__cipher_8cpp.html#a6bd3880ea6820c232c1eddf47553c257":[9,0,11,5,1],
|
||||
"dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,2,8,3],
|
||||
"dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,8,2],
|
||||
"dd/d1b/structquery.html":[10,0,41],
|
||||
"dd/d1c/classhash__chain.html":[10,0,30],
|
||||
"dd/d1c/classhash__chain.html#a28d3adffc0126beeef63bce0846fb8f5":[10,0,30,0],
|
||||
"dd/d1c/classhash__chain.html#a48236d44349c3ebce4774b706f4f8a0f":[10,0,30,8],
|
||||
"dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a":[10,0,30,4]
|
||||
"dd/d1c/classhash__chain.html":[10,0,30]
|
||||
};
|
||||
|
||||
@@ -1,5 +1,8 @@
|
||||
var NAVTREEINDEX12 =
|
||||
{
|
||||
"dd/d1c/classhash__chain.html#a28d3adffc0126beeef63bce0846fb8f5":[10,0,30,0],
|
||||
"dd/d1c/classhash__chain.html#a48236d44349c3ebce4774b706f4f8a0f":[10,0,30,8],
|
||||
"dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a":[10,0,30,4],
|
||||
"dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff":[10,0,30,2],
|
||||
"dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed":[10,0,30,3],
|
||||
"dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595":[10,0,30,1],
|
||||
@@ -8,8 +11,8 @@ var NAVTREEINDEX12 =
|
||||
"dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2":[10,0,30,6],
|
||||
"dd/d1f/classdsu.html":[10,0,24],
|
||||
"dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a":[10,0,24,4],
|
||||
"dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72":[10,0,24,0],
|
||||
"dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72":[10,0,24,1],
|
||||
"dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72":[10,0,24,0],
|
||||
"dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c":[10,0,24,3],
|
||||
"dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c":[10,0,24,2],
|
||||
"dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c":[10,0,24,10],
|
||||
@@ -17,15 +20,15 @@ var NAVTREEINDEX12 =
|
||||
"dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb":[10,0,24,16],
|
||||
"dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53":[10,0,24,14],
|
||||
"dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429":[10,0,24,13],
|
||||
"dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303":[10,0,24,8],
|
||||
"dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303":[10,0,24,9],
|
||||
"dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303":[10,0,24,8],
|
||||
"dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde":[10,0,24,5],
|
||||
"dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559":[10,0,24,11],
|
||||
"dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f":[10,0,24,12],
|
||||
"dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280":[10,0,24,7],
|
||||
"dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55":[10,0,24,17],
|
||||
"dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415":[10,0,24,6],
|
||||
"dd/d21/namespacewindowed__median.html":[9,0,114],
|
||||
"dd/d21/namespacewindowed__median.html":[9,0,117],
|
||||
"dd/d24/namespacedynamic__programming.html":[9,0,24],
|
||||
"dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079":[9,0,24,10],
|
||||
"dd/d29/false__position_8cpp.html":[11,0,15,3],
|
||||
@@ -39,14 +42,14 @@ var NAVTREEINDEX12 =
|
||||
"dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908":[10,0,51,1],
|
||||
"dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb":[10,0,51,2],
|
||||
"dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2":[10,0,51,3],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html":[10,0,1,5,0],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html":[9,0,18,5,0],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4":[9,0,18,5,0,2],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html":[10,0,1,5,0],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4":[10,0,1,5,0,2],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f":[9,0,18,5,0,1],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4":[9,0,18,5,0,2],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f":[10,0,1,5,0,1],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57":[10,0,1,5,0,10],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f":[9,0,18,5,0,1],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57":[9,0,18,5,0,10],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57":[10,0,1,5,0,10],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a28944bb16ec22650b47fe3e80e3e13f8":[9,0,18,5,0,20],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a28944bb16ec22650b47fe3e80e3e13f8":[10,0,1,5,0,20],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956":[9,0,18,5,0,15],
|
||||
@@ -55,8 +58,8 @@ var NAVTREEINDEX12 =
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95":[10,0,1,5,0,8],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3":[10,0,1,5,0,5],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3":[9,0,18,5,0,5],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd":[10,0,1,5,0,18],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd":[9,0,18,5,0,18],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd":[10,0,1,5,0,18],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71":[9,0,18,5,0,11],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71":[10,0,1,5,0,11],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8":[10,0,1,5,0,19],
|
||||
@@ -65,71 +68,71 @@ var NAVTREEINDEX12 =
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a650f0ef26b7450e1addb5d80bb0ed629":[9,0,18,5,0,6],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18":[10,0,1,5,0,17],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18":[9,0,18,5,0,17],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94":[9,0,18,5,0,13],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94":[10,0,1,5,0,13],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94":[9,0,18,5,0,13],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9":[10,0,1,5,0,26],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9":[9,0,18,5,0,26],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb":[9,0,18,5,0,14],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb":[10,0,1,5,0,14],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46":[9,0,18,5,0,12],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46":[10,0,1,5,0,12],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921":[10,0,1,5,0,25],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46":[9,0,18,5,0,12],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921":[9,0,18,5,0,25],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc":[9,0,18,5,0,23],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921":[10,0,1,5,0,25],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc":[10,0,1,5,0,23],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06":[10,0,1,5,0,4],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc":[9,0,18,5,0,23],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06":[9,0,18,5,0,4],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06":[10,0,1,5,0,4],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74":[9,0,18,5,0,21],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74":[10,0,1,5,0,21],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab654d7376d3449fdc78edab0e7fed06e":[10,0,1,5,0,7],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab654d7376d3449fdc78edab0e7fed06e":[9,0,18,5,0,7],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e":[10,0,1,5,0,9],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e":[9,0,18,5,0,9],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e":[10,0,1,5,0,9],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5219979ea9a8baa3a273a9ec0f0c670":[9,0,18,5,0,0],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5219979ea9a8baa3a273a9ec0f0c670":[10,0,1,5,0,0],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d":[9,0,18,5,0,24],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d":[10,0,1,5,0,24],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37":[9,0,18,5,0,3],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d":[9,0,18,5,0,24],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37":[10,0,1,5,0,3],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1":[9,0,18,5,0,22],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37":[9,0,18,5,0,3],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1":[10,0,1,5,0,22],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631":[10,0,1,5,0,16],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1":[9,0,18,5,0,22],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631":[9,0,18,5,0,16],
|
||||
"dd/d43/namespace_m_d5.html":[9,0,56],
|
||||
"dd/d47/namespacemath.html":[9,0,55],
|
||||
"dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244":[9,0,55,16],
|
||||
"dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c":[9,0,55,30],
|
||||
"dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551":[9,0,55,26],
|
||||
"dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12":[9,0,55,24],
|
||||
"dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7":[9,0,55,9],
|
||||
"dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75":[9,0,55,8],
|
||||
"dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec":[9,0,55,28],
|
||||
"dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f":[9,0,55,19],
|
||||
"dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967":[9,0,55,18],
|
||||
"dd/d47/namespacemath.html#a89ab7d6c3e3ee72a8cbaa85127986185":[9,0,55,21],
|
||||
"dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0":[9,0,55,17],
|
||||
"dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c":[9,0,55,22],
|
||||
"dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049":[9,0,55,27],
|
||||
"dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca":[9,0,55,23],
|
||||
"dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc":[9,0,55,29],
|
||||
"dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656":[9,0,55,25],
|
||||
"dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c":[9,0,55,10],
|
||||
"dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca":[9,0,55,13],
|
||||
"dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864":[9,0,55,12],
|
||||
"dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea":[9,0,55,7],
|
||||
"dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725":[9,0,55,11],
|
||||
"dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11":[9,0,55,14],
|
||||
"dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f":[9,0,55,15],
|
||||
"dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d":[9,0,55,20],
|
||||
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631":[10,0,1,5,0,16],
|
||||
"dd/d43/namespace_m_d5.html":[9,0,58],
|
||||
"dd/d47/namespacemath.html":[9,0,57],
|
||||
"dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244":[9,0,57,16],
|
||||
"dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c":[9,0,57,30],
|
||||
"dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551":[9,0,57,26],
|
||||
"dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12":[9,0,57,24],
|
||||
"dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7":[9,0,57,9],
|
||||
"dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75":[9,0,57,8],
|
||||
"dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec":[9,0,57,28],
|
||||
"dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f":[9,0,57,19],
|
||||
"dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967":[9,0,57,18],
|
||||
"dd/d47/namespacemath.html#a89ab7d6c3e3ee72a8cbaa85127986185":[9,0,57,21],
|
||||
"dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0":[9,0,57,17],
|
||||
"dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c":[9,0,57,22],
|
||||
"dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049":[9,0,57,27],
|
||||
"dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca":[9,0,57,23],
|
||||
"dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc":[9,0,57,29],
|
||||
"dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656":[9,0,57,25],
|
||||
"dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c":[9,0,57,10],
|
||||
"dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca":[9,0,57,13],
|
||||
"dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864":[9,0,57,12],
|
||||
"dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea":[9,0,57,7],
|
||||
"dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725":[9,0,57,11],
|
||||
"dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11":[9,0,57,14],
|
||||
"dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f":[9,0,57,15],
|
||||
"dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d":[9,0,57,20],
|
||||
"dd/d4f/class_solution.html":[10,0,46],
|
||||
"dd/d65/lu__decompose_8cpp.html":[11,0,15,6],
|
||||
"dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,15,6,3],
|
||||
"dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,15,6,2],
|
||||
"dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,15,6,0],
|
||||
"dd/d65/lu__decompose_8cpp.html#a575c989afcc78e875031cd4273e62a3e":[11,0,15,6,1],
|
||||
"dd/d69/namespacerange__queries.html":[9,0,83],
|
||||
"dd/d73/namespaceiterative__tree__traversals.html":[9,0,39],
|
||||
"dd/d74/namespaceinorder__successor__of__bst.html":[9,0,36],
|
||||
"dd/d69/namespacerange__queries.html":[9,0,85],
|
||||
"dd/d73/namespaceiterative__tree__traversals.html":[9,0,40],
|
||||
"dd/d74/namespaceinorder__successor__of__bst.html":[9,0,37],
|
||||
"dd/d81/namespacecaesar.html":[9,0,10],
|
||||
"dd/d8a/namespacegeometric__dist.html":[9,0,27],
|
||||
"dd/d91/class_fenwick_tree.html":[10,0,28],
|
||||
@@ -140,43 +143,43 @@ var NAVTREEINDEX12 =
|
||||
"dd/d91/class_fenwick_tree.html#aaddab1f03d4941212a82cc647b1adb17":[10,0,28,0],
|
||||
"dd/d91/class_fenwick_tree.html#ade1d6a3d49af9d9df33e2fb26cab1699":[10,0,28,3],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html":[10,0,6,0,1],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html":[9,0,52,0,1],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101":[9,0,52,0,1,14],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html":[9,0,54,0,1],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101":[9,0,54,0,1,14],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101":[10,0,6,0,1,14],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9":[10,0,6,0,1,4],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9":[9,0,52,0,1,4],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9":[9,0,54,0,1,4],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658":[10,0,6,0,1,6],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658":[9,0,52,0,1,6],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658":[9,0,54,0,1,6],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b":[9,0,54,0,1,0],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b":[10,0,6,0,1,0],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b":[9,0,52,0,1,0],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2":[9,0,52,0,1,13],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2":[9,0,54,0,1,13],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2":[10,0,6,0,1,13],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e":[10,0,6,0,1,10],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e":[9,0,52,0,1,10],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e":[9,0,54,0,1,10],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba":[10,0,6,0,1,11],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba":[9,0,52,0,1,11],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba":[9,0,54,0,1,11],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3":[10,0,6,0,1,5],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3":[9,0,52,0,1,5],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3":[9,0,54,0,1,5],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a9517e162e2988f7db052296bd550a742":[10,0,6,0,1,16],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a9517e162e2988f7db052296bd550a742":[9,0,52,0,1,16],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915":[9,0,52,0,1,15],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a9517e162e2988f7db052296bd550a742":[9,0,54,0,1,16],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915":[10,0,6,0,1,15],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420":[9,0,52,0,1,7],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915":[9,0,54,0,1,15],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420":[10,0,6,0,1,7],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420":[9,0,54,0,1,7],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71":[9,0,54,0,1,17],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71":[10,0,6,0,1,17],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71":[9,0,52,0,1,17],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2":[9,0,54,0,1,1],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2":[10,0,6,0,1,1],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2":[9,0,52,0,1,1],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7":[9,0,52,0,1,2],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7":[10,0,6,0,1,2],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7":[9,0,54,0,1,2],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99":[10,0,6,0,1,9],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99":[9,0,52,0,1,9],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f":[9,0,52,0,1,8],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99":[9,0,54,0,1,9],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f":[9,0,54,0,1,8],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f":[10,0,6,0,1,8],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9":[9,0,52,0,1,3],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9":[10,0,6,0,1,3],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9":[9,0,54,0,1,3],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee":[10,0,6,0,1,12],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee":[9,0,52,0,1,12],
|
||||
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee":[9,0,54,0,1,12],
|
||||
"dd/da0/todo.html":[7],
|
||||
"dd/da8/pigeonhole__sort_8cpp.html":[11,0,21,13],
|
||||
"dd/da8/pigeonhole__sort_8cpp.html#a0e9e1b21a1684585e9e50f9afe4d53a3":[11,0,21,13,1],
|
||||
@@ -198,26 +201,26 @@ var NAVTREEINDEX12 =
|
||||
"dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91":[10,0,27,2],
|
||||
"dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793":[10,0,27,1],
|
||||
"dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46":[10,0,27,3],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html":[10,0,4,0,0],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html":[9,0,30,3,0],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3":[10,0,4,0,0,0],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html":[10,0,4,0,0],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3":[9,0,30,3,0,0],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3":[10,0,4,0,0,0],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9b0c6400693a5cfff971f768dd5ca5ca":[10,0,4,0,0,2],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9b0c6400693a5cfff971f768dd5ca5ca":[9,0,30,3,0,2],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6":[9,0,30,3,0,5],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6":[10,0,4,0,0,5],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6":[9,0,30,3,0,5],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ab0efcfa04fff8616aff0062522d1483f":[9,0,30,3,0,3],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ab0efcfa04fff8616aff0062522d1483f":[10,0,4,0,0,3],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad8c10df34357b2cd865c81e0c4f0bd8c":[10,0,4,0,0,1],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad8c10df34357b2cd865c81e0c4f0bd8c":[9,0,30,3,0,1],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef":[9,0,30,3,0,4],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad8c10df34357b2cd865c81e0c4f0bd8c":[10,0,4,0,0,1],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef":[10,0,4,0,0,4],
|
||||
"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef":[9,0,30,3,0,4],
|
||||
"de/d07/cycle__sort_8cpp.html":[11,0,21,4],
|
||||
"de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,21,4,2],
|
||||
"de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,4,1],
|
||||
"de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa":[9,0,92,0,0],
|
||||
"de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa":[11,0,21,4,0],
|
||||
"de/d0a/namespacemerge__insertion.html":[9,0,58],
|
||||
"de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa":[9,0,94,0,0],
|
||||
"de/d0a/namespacemerge__insertion.html":[9,0,60],
|
||||
"de/d0d/fibonacci__search_8cpp.html":[11,0,20,2],
|
||||
"de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61":[11,0,20,2,0],
|
||||
"de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f":[11,0,20,2,3],
|
||||
@@ -229,8 +232,8 @@ var NAVTREEINDEX12 =
|
||||
"de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8":[11,0,4,5,1],
|
||||
"de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757":[11,0,4,5,4],
|
||||
"de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,5,3],
|
||||
"de/d36/namespacen__bonacci.html":[9,0,64],
|
||||
"de/d41/namespacekaratsuba__algorithm.html":[9,0,42],
|
||||
"de/d36/namespacen__bonacci.html":[9,0,66],
|
||||
"de/d41/namespacekaratsuba__algorithm.html":[9,0,43],
|
||||
"de/d47/string__fibonacci_8cpp.html":[11,0,14,47],
|
||||
"de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35":[11,0,14,47,0],
|
||||
"de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca":[11,0,14,47,1],
|
||||
@@ -242,12 +245,9 @@ var NAVTREEINDEX12 =
|
||||
"de/d6a/knuth__morris__pratt_8cpp.html#a26a58225ce7d3fa9d4c2f5349a65ed93":[11,0,22,2,1],
|
||||
"de/d6a/knuth__morris__pratt_8cpp.html#a996573527312d5255e1495b879e8a34f":[11,0,22,2,0],
|
||||
"de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,2,2],
|
||||
"de/d6b/namespacerandom__pivot__quick__sort.html":[9,0,82],
|
||||
"de/d6b/namespacerandom__pivot__quick__sort.html":[9,0,84],
|
||||
"de/d72/geometric__dist_8cpp.html":[11,0,18,3],
|
||||
"de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6":[11,0,18,3,3],
|
||||
"de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba":[11,0,18,3,1],
|
||||
"de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba":[9,0,77,0,1],
|
||||
"de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,18,3,4],
|
||||
"de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,18,3,2],
|
||||
"de/d75/qr__eigen__values_8cpp.html":[11,0,15,14]
|
||||
"de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba":[9,0,79,0,1],
|
||||
"de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba":[11,0,18,3,1]
|
||||
};
|
||||
|
||||
@@ -1,5 +1,8 @@
|
||||
var NAVTREEINDEX13 =
|
||||
{
|
||||
"de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,18,3,4],
|
||||
"de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,18,3,2],
|
||||
"de/d75/qr__eigen__values_8cpp.html":[11,0,15,14],
|
||||
"de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,15,14,6],
|
||||
"de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,15,14,5],
|
||||
"de/d75/qr__eigen__values_8cpp.html#a28e2fa3e803abaea6c568dc45d69d8cc":[11,0,15,14,2],
|
||||
@@ -8,15 +11,15 @@ var NAVTREEINDEX13 =
|
||||
"de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae":[11,0,15,14,4],
|
||||
"de/d75/qr__eigen__values_8cpp.html#aee57a411f07599034f5ceb8cc7d65b40":[11,0,15,14,0],
|
||||
"de/d7b/merge__insertion__sort_8cpp.html":[11,0,21,9],
|
||||
"de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1":[9,0,92,3,0],
|
||||
"de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1":[11,0,21,9,0],
|
||||
"de/d7b/merge__insertion__sort_8cpp.html#a7161278f18e83b671c6454b139cc5674":[9,0,92,3,2],
|
||||
"de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1":[9,0,94,3,0],
|
||||
"de/d7b/merge__insertion__sort_8cpp.html#a7161278f18e83b671c6454b139cc5674":[11,0,21,9,3],
|
||||
"de/d7b/merge__insertion__sort_8cpp.html#a7161278f18e83b671c6454b139cc5674":[9,0,94,3,2],
|
||||
"de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,21,9,4],
|
||||
"de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,9,1],
|
||||
"de/d7b/merge__insertion__sort_8cpp.html#af4de4067a9a866ffd985c5b5055ccedf":[11,0,21,9,2],
|
||||
"de/d7b/merge__insertion__sort_8cpp.html#af4de4067a9a866ffd985c5b5055ccedf":[9,0,92,3,1],
|
||||
"de/d83/namespaceis__graph__bipartite.html":[9,0,38],
|
||||
"de/d7b/merge__insertion__sort_8cpp.html#af4de4067a9a866ffd985c5b5055ccedf":[9,0,94,3,1],
|
||||
"de/d83/namespaceis__graph__bipartite.html":[9,0,39],
|
||||
"de/d85/decimal__to__roman__numeral_8cpp.html":[11,0,17,3],
|
||||
"de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d":[11,0,17,3,2],
|
||||
"de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979":[11,0,17,3,3],
|
||||
@@ -26,20 +29,20 @@ var NAVTREEINDEX13 =
|
||||
"de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,8,11,1],
|
||||
"de/d88/travelling__salesman__problem_8cpp.html#ab7706341d006e20d1ae58274187a3346":[11,0,8,11,2],
|
||||
"de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,8,11,0],
|
||||
"de/d95/namespace_subsets.html":[9,0,103],
|
||||
"de/d95/namespace_subsets.html":[9,0,105],
|
||||
"de/d9b/prime__numbers_8cpp.html":[11,0,14,42],
|
||||
"de/d9b/prime__numbers_8cpp.html#a541b9728fd1db77516fee913763da90e":[11,0,14,42,1],
|
||||
"de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,42,0],
|
||||
"de/d9d/classdata__structures_1_1linked__list_1_1link.html":[10,0,1,0,0],
|
||||
"de/d9d/classdata__structures_1_1linked__list_1_1link.html":[9,0,18,0,0],
|
||||
"de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb":[10,0,1,0,0,0],
|
||||
"de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb":[9,0,18,0,0,0],
|
||||
"de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb":[10,0,1,0,0,0],
|
||||
"de/d9d/classdata__structures_1_1linked__list_1_1link.html#ac121ce37b6ea864b160ebcada0bce936":[10,0,1,0,0,4],
|
||||
"de/d9d/classdata__structures_1_1linked__list_1_1link.html#ac121ce37b6ea864b160ebcada0bce936":[9,0,18,0,0,4],
|
||||
"de/d9d/classdata__structures_1_1linked__list_1_1link.html#acf96f3a9a1d3b15268c38e8822300c11":[10,0,1,0,0,2],
|
||||
"de/d9d/classdata__structures_1_1linked__list_1_1link.html#acf96f3a9a1d3b15268c38e8822300c11":[9,0,18,0,0,2],
|
||||
"de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3":[9,0,18,0,0,1],
|
||||
"de/d9d/classdata__structures_1_1linked__list_1_1link.html#acf96f3a9a1d3b15268c38e8822300c11":[10,0,1,0,0,2],
|
||||
"de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3":[10,0,1,0,0,1],
|
||||
"de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3":[9,0,18,0,0,1],
|
||||
"de/d9d/classdata__structures_1_1linked__list_1_1link.html#af94c06f3220e5406245680f58b8e7081":[10,0,1,0,0,3],
|
||||
"de/d9d/classdata__structures_1_1linked__list_1_1link.html#af94c06f3220e5406245680f58b8e7081":[9,0,18,0,0,3],
|
||||
"de/dab/ncr__modulo__p_8cpp.html":[11,0,14,37],
|
||||
@@ -48,23 +51,23 @@ var NAVTREEINDEX13 =
|
||||
"de/db3/namespaceatbash.html":[9,0,3],
|
||||
"de/db4/namespacedisjoint__union.html":[9,0,20],
|
||||
"de/db6/a1z26__cipher_8cpp.html":[11,0,2,0],
|
||||
"de/db6/a1z26__cipher_8cpp.html#a0a78954e96c862430904ee3e64623c38":[9,0,11,0,0],
|
||||
"de/db6/a1z26__cipher_8cpp.html#a0a78954e96c862430904ee3e64623c38":[11,0,2,0,0],
|
||||
"de/db6/a1z26__cipher_8cpp.html#a0a78954e96c862430904ee3e64623c38":[9,0,11,0,0],
|
||||
"de/db6/a1z26__cipher_8cpp.html#a77a6b827a0b9c7aca2d705811459d744":[9,0,11,0,1],
|
||||
"de/db6/a1z26__cipher_8cpp.html#a77a6b827a0b9c7aca2d705811459d744":[11,0,2,0,1],
|
||||
"de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,2,0,3],
|
||||
"de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,0,2],
|
||||
"de/dc3/binaryheap_8cpp.html":[11,0,4,4],
|
||||
"de/dc3/fibonacci__sum_8cpp.html":[11,0,14,17],
|
||||
"de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742":[9,0,55,1,0],
|
||||
"de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742":[9,0,57,1,0],
|
||||
"de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742":[11,0,14,17,0],
|
||||
"de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311":[9,0,55,1,2],
|
||||
"de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311":[9,0,57,1,2],
|
||||
"de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311":[11,0,14,17,3],
|
||||
"de/dc3/fibonacci__sum_8cpp.html#a9c83cca09a3e4ff2a25c816a9303448e":[9,0,55,1,1],
|
||||
"de/dc3/fibonacci__sum_8cpp.html#a9c83cca09a3e4ff2a25c816a9303448e":[11,0,14,17,2],
|
||||
"de/dc3/fibonacci__sum_8cpp.html#a9c83cca09a3e4ff2a25c816a9303448e":[9,0,57,1,1],
|
||||
"de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,17,5],
|
||||
"de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa":[11,0,14,17,4],
|
||||
"de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa":[9,0,55,1,3],
|
||||
"de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa":[9,0,57,1,3],
|
||||
"de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,17,1],
|
||||
"de/dc5/intersection__of__two__arrays_8cpp.html":[11,0,16,3],
|
||||
"de/dc5/intersection__of__two__arrays_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,3,4],
|
||||
@@ -85,27 +88,27 @@ var NAVTREEINDEX13 =
|
||||
"de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f":[11,0,14,2,1],
|
||||
"de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,2,2],
|
||||
"de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73":[11,0,14,2,0],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html":[9,0,71,1,0],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html":[10,0,8,1,0],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html":[9,0,73,1,0],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c":[10,0,8,1,0,6],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c":[9,0,71,1,0,6],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c":[9,0,73,1,0,6],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c":[9,0,73,1,0,3],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c":[10,0,8,1,0,3],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c":[9,0,71,1,0,3],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d":[10,0,8,1,0,2],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d":[9,0,71,1,0,2],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503":[9,0,71,1,0,5],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d":[9,0,73,1,0,2],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503":[10,0,8,1,0,5],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503":[9,0,73,1,0,5],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb":[10,0,8,1,0,8],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb":[9,0,71,1,0,8],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b":[9,0,71,1,0,1],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb":[9,0,73,1,0,8],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b":[10,0,8,1,0,1],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b":[9,0,73,1,0,1],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56":[10,0,8,1,0,0],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56":[9,0,71,1,0,0],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50":[9,0,71,1,0,4],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56":[9,0,73,1,0,0],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50":[10,0,8,1,0,4],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50":[9,0,73,1,0,4],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1":[10,0,8,1,0,7],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1":[9,0,71,1,0,7],
|
||||
"de/dd3/namespace_s_h_a.html":[9,0,90],
|
||||
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1":[9,0,73,1,0,7],
|
||||
"de/dd3/namespace_s_h_a.html":[9,0,92],
|
||||
"de/dd3/newton__raphson__method_8cpp.html":[11,0,15,8],
|
||||
"de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d":[11,0,15,8,0],
|
||||
"de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386":[11,0,15,8,1],
|
||||
@@ -120,8 +123,8 @@ var NAVTREEINDEX13 =
|
||||
"df/d06/decimal__to__binary_8cpp.html":[11,0,17,1],
|
||||
"df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7":[11,0,17,1,1],
|
||||
"df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11":[11,0,17,1,0],
|
||||
"df/d10/namespacepancake__sort.html":[9,0,74],
|
||||
"df/d1c/namespacestack__using__queue.html":[9,0,95],
|
||||
"df/d10/namespacepancake__sort.html":[9,0,76],
|
||||
"df/d1c/namespacestack__using__queue.html":[9,0,97],
|
||||
"df/d28/dsu__union__rank_8cpp.html":[11,0,4,7],
|
||||
"df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae":[11,0,4,7,3],
|
||||
"df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,7,1],
|
||||
@@ -135,27 +138,27 @@ var NAVTREEINDEX13 =
|
||||
"df/d2c/elliptic__curve__key__exchange_8cpp.html#acc5fe9c2032fb7582c38a20d1fa69bcf":[11,0,2,3,2],
|
||||
"df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,3,4],
|
||||
"df/d2c/elliptic__curve__key__exchange_8cpp.html#af0a6e3521629c25c2b5d620f26429830":[11,0,2,3,1],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html":[9,0,77,1,0],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html":[9,0,79,1,0],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html":[10,0,10,1,0],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24":[10,0,10,1,0,5],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24":[9,0,77,1,0,5],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24":[9,0,79,1,0,5],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20":[9,0,79,1,0,6],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20":[10,0,10,1,0,6],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20":[9,0,77,1,0,6],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6":[9,0,77,1,0,3],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6":[10,0,10,1,0,3],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6":[9,0,79,1,0,3],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7":[10,0,10,1,0,4],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7":[9,0,77,1,0,4],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2":[9,0,77,1,0,8],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7":[9,0,79,1,0,4],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2":[9,0,79,1,0,8],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2":[10,0,10,1,0,8],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d":[9,0,79,1,0,2],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d":[10,0,10,1,0,2],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d":[9,0,77,1,0,2],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d":[9,0,77,1,0,0],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d":[10,0,10,1,0,0],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de":[9,0,77,1,0,7],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d":[9,0,79,1,0,0],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de":[9,0,79,1,0,7],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de":[10,0,10,1,0,7],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750":[10,0,10,1,0,9],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750":[9,0,77,1,0,9],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e":[9,0,77,1,0,1],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750":[9,0,79,1,0,9],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e":[9,0,79,1,0,1],
|
||||
"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e":[10,0,10,1,0,1],
|
||||
"df/d39/interpolation__search2_8cpp.html":[11,0,20,6],
|
||||
"df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629":[11,0,20,6,0],
|
||||
@@ -169,22 +172,22 @@ var NAVTREEINDEX13 =
|
||||
"df/d42/binary__search__tree2_8cpp.html#ab00b8d0f21aeb5fbddb6decf3bcb640a":[11,0,4,3,7],
|
||||
"df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e":[11,0,4,3,9],
|
||||
"df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4":[11,0,4,3,4],
|
||||
"df/d44/namespacen__queens__all__solutions.html":[9,0,66],
|
||||
"df/d44/namespacen__queens__all__solutions.html":[9,0,68],
|
||||
"df/d47/fcfs__scheduling_8cpp.html":[11,0,3,0],
|
||||
"df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec":[11,0,3,0,4],
|
||||
"df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86":[11,0,3,0,2],
|
||||
"df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,3,0,5],
|
||||
"df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,3,0,3],
|
||||
"df/d4a/namespaceselection__sort__recursive.html":[9,0,89],
|
||||
"df/d4a/namespaceselection__sort__recursive.html":[9,0,91],
|
||||
"df/d64/jumpgame_8cpp.html":[11,0,10,0],
|
||||
"df/d64/jumpgame_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,10,0,2],
|
||||
"df/d64/jumpgame_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,10,0,1],
|
||||
"df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755":[11,0,10,0,0],
|
||||
"df/d66/vector__cross__product_8cpp.html":[11,0,14,50],
|
||||
"df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9":[9,0,55,6,0],
|
||||
"df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9":[9,0,57,6,0],
|
||||
"df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9":[11,0,14,50,0],
|
||||
"df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8":[9,0,57,6,1],
|
||||
"df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8":[11,0,14,50,1],
|
||||
"df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8":[9,0,55,6,1],
|
||||
"df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,50,3],
|
||||
"df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,50,2],
|
||||
"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html":[9,0,11,3],
|
||||
@@ -194,28 +197,28 @@ var NAVTREEINDEX13 =
|
||||
"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#af0a6e3521629c25c2b5d620f26429830":[9,0,11,3,1],
|
||||
"df/d72/modular__division_8cpp.html":[11,0,14,32],
|
||||
"df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,14,32,0],
|
||||
"df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179":[9,0,55,2,1],
|
||||
"df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179":[11,0,14,32,2],
|
||||
"df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7":[9,0,55,2,0],
|
||||
"df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179":[9,0,57,2,1],
|
||||
"df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7":[11,0,14,32,1],
|
||||
"df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7":[9,0,57,2,0],
|
||||
"df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,32,3],
|
||||
"df/d74/namespacesubarray__sum.html":[9,0,101],
|
||||
"df/d74/namespacesubarray__sum.html":[9,0,103],
|
||||
"df/d82/breadth__first__search_8cpp.html":[11,0,8,1],
|
||||
"df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,8,1,2],
|
||||
"df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,8,1,1],
|
||||
"df/d8e/namespacetrie__operations.html":[9,0,106],
|
||||
"df/d8e/namespacetrie__operations.html":[9,0,109],
|
||||
"df/d94/subarray__sum_8cpp.html":[11,0,0,7],
|
||||
"df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,7,2],
|
||||
"df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,7,0],
|
||||
"df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e":[9,0,5,4,0],
|
||||
"df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e":[11,0,0,7,1],
|
||||
"df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html":[9,0,97,9],
|
||||
"df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e":[9,0,5,6,0],
|
||||
"df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html":[10,0,15,5],
|
||||
"df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html":[9,0,99,9],
|
||||
"df/dc8/successive__approximation_8cpp.html":[11,0,15,16],
|
||||
"df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389":[11,0,15,16,0],
|
||||
"df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,16,2],
|
||||
"df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456":[11,0,15,16,1],
|
||||
"df/dcb/namespacestrings.html":[9,0,100],
|
||||
"df/dcb/namespacestrings.html":[9,0,102],
|
||||
"df/dce/namespacegraph.html":[9,0,30],
|
||||
"df/dce/namespacegraph.html#a0e30e0dca68cb6e4f671440819b35b6a":[9,0,30,10],
|
||||
"df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8":[9,0,30,14],
|
||||
@@ -246,8 +249,5 @@ var NAVTREEINDEX13 =
|
||||
"df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9":[11,0,14,39,2],
|
||||
"df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f":[11,0,14,39,3],
|
||||
"df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,39,1],
|
||||
"df/dfb/minimax_8cpp.html":[11,0,0,2],
|
||||
"df/dfb/minimax_8cpp.html#a78540bcb5ef3473b2348cbc34748ec50":[11,0,0,2,1],
|
||||
"df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,2,0],
|
||||
"dir_074119ce3a874b57120c49a0cc4bb5ad.html":[11,0,19]
|
||||
"df/dfb/minimax_8cpp.html":[11,0,0,2]
|
||||
};
|
||||
|
||||
@@ -1,5 +1,8 @@
|
||||
var NAVTREEINDEX14 =
|
||||
{
|
||||
"df/dfb/minimax_8cpp.html#a78540bcb5ef3473b2348cbc34748ec50":[11,0,0,2,1],
|
||||
"df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,2,0],
|
||||
"dir_074119ce3a874b57120c49a0cc4bb5ad.html":[11,0,19],
|
||||
"dir_0eaa691bd54ab0922ca7f50599de6d22.html":[11,0,10],
|
||||
"dir_12552d7fa429bf94a2e32e5cf39f7e69.html":[11,0,8],
|
||||
"dir_19b2bf9199a15c634a08b1ede1dd896a.html":[11,0,20],
|
||||
@@ -33,8 +36,8 @@ var NAVTREEINDEX14 =
|
||||
"functions_d.html":[10,3,0,4],
|
||||
"functions_e.html":[10,3,0,5],
|
||||
"functions_f.html":[10,3,0,6],
|
||||
"functions_func.html":[10,3,1],
|
||||
"functions_func.html":[10,3,1,0],
|
||||
"functions_func.html":[10,3,1],
|
||||
"functions_func_a.html":[10,3,1,1],
|
||||
"functions_func_b.html":[10,3,1,2],
|
||||
"functions_func_c.html":[10,3,1,3],
|
||||
@@ -144,82 +147,85 @@ var NAVTREEINDEX14 =
|
||||
"namespacemembers_vars.html":[9,1,2],
|
||||
"namespaces.html":[9,0],
|
||||
"pages.html":[],
|
||||
"":[9,0,55,5],
|
||||
"":[9,0,55,4],
|
||||
"":[9,0,55,6],
|
||||
"":[9,0,11,0],
|
||||
"":[9,0,11,1],
|
||||
"":[9,0,5,6],
|
||||
"":[9,0,77,1],
|
||||
"":[9,0,11,2],
|
||||
"":[9,0,55,3],
|
||||
"":[9,0,71,0],
|
||||
"":[9,0,71,1],
|
||||
"":[9,0,77,0],
|
||||
"":[9,0,5,0],
|
||||
"":[9,0,72,2],
|
||||
"":[9,0,72,1],
|
||||
"":[9,0,71,2],
|
||||
"":[9,0,72,0],
|
||||
"":[9,0,52,1,0],
|
||||
"":[9,0,5,1],
|
||||
"":[9,0,5,2],
|
||||
"":[9,0,5,5],
|
||||
"":[9,0,52,1,2],
|
||||
"":[9,0,5,4],
|
||||
"":[9,0,5,3],
|
||||
"":[9,0,52,1],
|
||||
"":[9,0,11,4],
|
||||
"":[9,0,11,5],
|
||||
"":[9,0,55,0],
|
||||
"":[9,0,55,1],
|
||||
"":[9,0,11,6],
|
||||
"":[9,0,55,2],
|
||||
"":[9,0,18,0],
|
||||
"":[9,0,83,0],
|
||||
"":[9,0,52,0],
|
||||
"":[9,0,51],
|
||||
"":[9,0,83,1],
|
||||
"":[9,0,83,2],
|
||||
"":[9,0,88,0],
|
||||
"":[9,0,5,1],
|
||||
"":[9,0,18,1],
|
||||
"":[9,0,18,2],
|
||||
"":[9,0,18,3],
|
||||
"":[9,0,88,1],
|
||||
"":[9,0,88,2],
|
||||
"":[9,0,88,3],
|
||||
"":[9,0,92,0],
|
||||
"":[9,0,92,1],
|
||||
"":[9,0,18,4],
|
||||
"":[9,0,18,5],
|
||||
"":[9,0,30,3],
|
||||
"":[9,0,30,2],
|
||||
"":[9,0,92,2],
|
||||
"":[9,0,30,1],
|
||||
"":[9,0,30,0],
|
||||
"":[9,0,92,3],
|
||||
"":[9,0,28,0],
|
||||
"":[9,0,24,9],
|
||||
"":[9,0,24,8],
|
||||
"":[9,0,24,7],
|
||||
"":[9,0,92,4],
|
||||
"":[9,0,24,6],
|
||||
"":[9,0,24,5],
|
||||
"":[9,0,24,4],
|
||||
"":[9,0,24,3],
|
||||
"":[9,0,24,2],
|
||||
"":[9,0,24,1],
|
||||
"":[9,0,24,0],
|
||||
"":[9,0,97,3],
|
||||
"":[9,0,97,2],
|
||||
"":[9,0,97,1],
|
||||
"":[9,0,97,0],
|
||||
"":[9,0,92,10],
|
||||
"":[9,0,92,9],
|
||||
"":[9,0,92,8],
|
||||
"":[9,0,92,7],
|
||||
"":[9,0,92,6],
|
||||
"":[9,0,92,5],
|
||||
"":[9,0,18,6],
|
||||
"":[9,0,52,1,1]
|
||||
"":[9,0,24,0],
|
||||
"":[9,0,24,1],
|
||||
"":[9,0,24,2],
|
||||
"":[9,0,24,3],
|
||||
"":[9,0,5,2],
|
||||
"":[9,0,24,4],
|
||||
"":[9,0,24,5],
|
||||
"":[9,0,24,6],
|
||||
"":[9,0,24,7],
|
||||
"":[9,0,24,8],
|
||||
"":[9,0,11,4],
|
||||
"":[9,0,5,3],
|
||||
"":[9,0,5,4],
|
||||
"":[9,0,11,2],
|
||||
"":[9,0,11,1],
|
||||
"":[9,0,11,0],
|
||||
"":[9,0,24,9],
|
||||
"":[9,0,28,0],
|
||||
"":[9,0,30,0],
|
||||
"":[9,0,30,1],
|
||||
"":[9,0,30,2],
|
||||
"":[9,0,30,3],
|
||||
"":[9,0,53],
|
||||
"":[9,0,54,0],
|
||||
"":[9,0,54,1],
|
||||
"":[9,0,54,1,0],
|
||||
"":[9,0,5,5],
|
||||
"":[9,0,54,1,2],
|
||||
"":[9,0,57,0],
|
||||
"":[9,0,57,1],
|
||||
"":[9,0,57,2],
|
||||
"":[9,0,57,3],
|
||||
"":[9,0,57,4],
|
||||
"":[9,0,57,5],
|
||||
"":[9,0,57,6],
|
||||
"":[9,0,73,0],
|
||||
"":[9,0,73,1],
|
||||
"":[9,0,73,2],
|
||||
"":[9,0,74,0],
|
||||
"":[9,0,74,1],
|
||||
"":[9,0,74,2],
|
||||
"":[9,0,79,0],
|
||||
"":[9,0,79,1],
|
||||
"":[9,0,85,0],
|
||||
"":[9,0,85,1],
|
||||
"":[9,0,85,2],
|
||||
"":[9,0,90,0],
|
||||
"":[9,0,90,1],
|
||||
"":[9,0,90,2],
|
||||
"":[9,0,90,3],
|
||||
"":[9,0,94,0],
|
||||
"":[9,0,94,1],
|
||||
"":[9,0,94,2],
|
||||
"":[9,0,94,3],
|
||||
"":[9,0,94,4],
|
||||
"":[9,0,94,5],
|
||||
"":[9,0,94,6],
|
||||
"":[9,0,94,7],
|
||||
"":[9,0,94,8],
|
||||
"":[9,0,94,9],
|
||||
"":[9,0,94,10],
|
||||
"":[9,0,99,0],
|
||||
"":[9,0,99,1],
|
||||
"":[9,0,99,2],
|
||||
"":[9,0,99,3],
|
||||
"":[9,0,5,9],
|
||||
"":[9,0,5,8],
|
||||
"":[9,0,5,7],
|
||||
"":[9,0,5,6],
|
||||
"":[9,0,54,1,1]
|
||||
};
|
||||
|
||||
168
navtreeindex2.js
168
navtreeindex2.js
@@ -1,41 +1,41 @@
|
||||
var NAVTREEINDEX2 =
|
||||
{
|
||||
"cpp/thread/lock.html":[9,0,97,246],
|
||||
"cpp/thread/notify_all_at_thread_exit.html":[9,0,97,306],
|
||||
"cpp/thread/sleep_for.html":[9,0,97,3,1],
|
||||
"cpp/thread/sleep_until.html":[9,0,97,3,2],
|
||||
"cpp/thread/try_lock.html":[9,0,97,462],
|
||||
"cpp/thread/yield.html":[9,0,97,3,3],
|
||||
"cpp/utility/declval.html":[9,0,97,93],
|
||||
"cpp/utility/forward.html":[9,0,97,148],
|
||||
"cpp/utility/functional/bind.html":[9,0,97,65],
|
||||
"cpp/utility/functional/mem_fn.html":[9,0,97,273],
|
||||
"cpp/utility/functional/not1.html":[9,0,97,304],
|
||||
"cpp/utility/functional/not2.html":[9,0,97,305],
|
||||
"cpp/utility/functional/ref.html":[9,0,97,87],
|
||||
"cpp/utility/functional/ref.html":[9,0,97,336],
|
||||
"cpp/utility/move.html":[9,0,97,287],
|
||||
"cpp/utility/move_if_noexcept.html":[9,0,97,289],
|
||||
"cpp/utility/pair/make_pair.html":[9,0,97,258],
|
||||
"cpp/utility/program/_Exit.html":[9,0,97,10],
|
||||
"cpp/utility/program/abort.html":[9,0,97,11],
|
||||
"cpp/utility/program/at_quick_exit.html":[9,0,97,29],
|
||||
"cpp/utility/program/atexit.html":[9,0,97,33],
|
||||
"cpp/utility/program/exit.html":[9,0,97,106],
|
||||
"cpp/utility/program/getenv.html":[9,0,97,182],
|
||||
"cpp/utility/program/longjmp.html":[9,0,97,251],
|
||||
"cpp/utility/program/quick_exit.html":[9,0,97,331],
|
||||
"cpp/utility/program/raise.html":[9,0,97,332],
|
||||
"cpp/utility/program/signal.html":[9,0,97,388],
|
||||
"cpp/utility/program/system.html":[9,0,97,442],
|
||||
"cpp/utility/rel_ops/operator_cmp.html":[9,0,97,2,0],
|
||||
"cpp/utility/rel_ops/operator_cmp.html":[9,0,97,2,3],
|
||||
"cpp/utility/rel_ops/operator_cmp.html":[9,0,97,2,2],
|
||||
"cpp/utility/rel_ops/operator_cmp.html":[9,0,97,2,1],
|
||||
"cpp/utility/tuple/forward_as_tuple.html":[9,0,97,149],
|
||||
"cpp/utility/tuple/make_tuple.html":[9,0,97,260],
|
||||
"cpp/utility/tuple/tie.html":[9,0,97,449],
|
||||
"cpp/utility/tuple/tuple_cat.html":[9,0,97,463],
|
||||
"cpp/thread/lock.html":[9,0,99,246],
|
||||
"cpp/thread/notify_all_at_thread_exit.html":[9,0,99,306],
|
||||
"cpp/thread/sleep_for.html":[9,0,99,3,1],
|
||||
"cpp/thread/sleep_until.html":[9,0,99,3,2],
|
||||
"cpp/thread/try_lock.html":[9,0,99,462],
|
||||
"cpp/thread/yield.html":[9,0,99,3,3],
|
||||
"cpp/utility/declval.html":[9,0,99,93],
|
||||
"cpp/utility/forward.html":[9,0,99,148],
|
||||
"cpp/utility/functional/bind.html":[9,0,99,65],
|
||||
"cpp/utility/functional/mem_fn.html":[9,0,99,273],
|
||||
"cpp/utility/functional/not1.html":[9,0,99,304],
|
||||
"cpp/utility/functional/not2.html":[9,0,99,305],
|
||||
"cpp/utility/functional/ref.html":[9,0,99,336],
|
||||
"cpp/utility/functional/ref.html":[9,0,99,87],
|
||||
"cpp/utility/move.html":[9,0,99,287],
|
||||
"cpp/utility/move_if_noexcept.html":[9,0,99,289],
|
||||
"cpp/utility/pair/make_pair.html":[9,0,99,258],
|
||||
"cpp/utility/program/_Exit.html":[9,0,99,10],
|
||||
"cpp/utility/program/abort.html":[9,0,99,11],
|
||||
"cpp/utility/program/at_quick_exit.html":[9,0,99,29],
|
||||
"cpp/utility/program/atexit.html":[9,0,99,33],
|
||||
"cpp/utility/program/exit.html":[9,0,99,106],
|
||||
"cpp/utility/program/getenv.html":[9,0,99,182],
|
||||
"cpp/utility/program/longjmp.html":[9,0,99,251],
|
||||
"cpp/utility/program/quick_exit.html":[9,0,99,331],
|
||||
"cpp/utility/program/raise.html":[9,0,99,332],
|
||||
"cpp/utility/program/signal.html":[9,0,99,388],
|
||||
"cpp/utility/program/system.html":[9,0,99,442],
|
||||
"cpp/utility/rel_ops/operator_cmp.html":[9,0,99,2,0],
|
||||
"cpp/utility/rel_ops/operator_cmp.html":[9,0,99,2,2],
|
||||
"cpp/utility/rel_ops/operator_cmp.html":[9,0,99,2,1],
|
||||
"cpp/utility/rel_ops/operator_cmp.html":[9,0,99,2,3],
|
||||
"cpp/utility/tuple/forward_as_tuple.html":[9,0,99,149],
|
||||
"cpp/utility/tuple/make_tuple.html":[9,0,99,260],
|
||||
"cpp/utility/tuple/tie.html":[9,0,99,449],
|
||||
"cpp/utility/tuple/tuple_cat.html":[9,0,99,463],
|
||||
"d0/d01/smallest__circle_8cpp.html":[11,0,17,15],
|
||||
"d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,17,15,6],
|
||||
"d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903":[11,0,17,15,1],
|
||||
@@ -48,38 +48,38 @@ var NAVTREEINDEX2 =
|
||||
"d0/d08/realtime__stats_8cpp.html":[11,0,14,44],
|
||||
"d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,14,44,2],
|
||||
"d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd":[11,0,14,44,3],
|
||||
"d0/d2e/namespaceneural__network.html":[9,0,69],
|
||||
"d0/d3e/classdata__structures_1_1trie.html":[9,0,18,9],
|
||||
"d0/d2e/namespaceneural__network.html":[9,0,71],
|
||||
"d0/d3e/classdata__structures_1_1trie.html":[10,0,1,9],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546":[10,0,1,9,3],
|
||||
"d0/d3e/classdata__structures_1_1trie.html":[9,0,18,9],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546":[9,0,18,9,3],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b":[10,0,1,9,6],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546":[10,0,1,9,3],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b":[9,0,18,9,6],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b":[10,0,1,9,6],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d":[9,0,18,9,5],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d":[10,0,1,9,5],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191":[10,0,1,9,8],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191":[9,0,18,9,8],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191":[10,0,1,9,8],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6":[9,0,18,9,7],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6":[10,0,1,9,7],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8":[9,0,18,9,0],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8":[10,0,1,9,0],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63":[9,0,18,9,4],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63":[10,0,1,9,4],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988":[9,0,18,9,1],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988":[10,0,1,9,1],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988":[9,0,18,9,1],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab":[10,0,1,9,2],
|
||||
"d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab":[9,0,18,9,2],
|
||||
"d0/d46/finding__number__of__digits__in__a__number_8cpp.html":[11,0,14,18],
|
||||
"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1":[11,0,14,18,0],
|
||||
"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,18,2],
|
||||
"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,18,1],
|
||||
"d0/d52/namespacewiggle__sort.html":[9,0,112],
|
||||
"d0/d58/classgraph_1_1_rooted_tree.html":[9,0,30,7],
|
||||
"d0/d52/namespacewiggle__sort.html":[9,0,115],
|
||||
"d0/d58/classgraph_1_1_rooted_tree.html":[10,0,4,4],
|
||||
"d0/d58/classgraph_1_1_rooted_tree.html":[9,0,30,7],
|
||||
"d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3":[10,0,4,4,2],
|
||||
"d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3":[9,0,30,7,2],
|
||||
"d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43":[9,0,30,7,3],
|
||||
"d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43":[10,0,4,4,3],
|
||||
"d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43":[9,0,30,7,3],
|
||||
"d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d":[9,0,30,7,0],
|
||||
"d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d":[10,0,4,4,0],
|
||||
"d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe":[9,0,30,7,4],
|
||||
@@ -90,28 +90,28 @@ var NAVTREEINDEX2 =
|
||||
"d0/d5a/skip__list_8cpp.html#a903639d8e6f955dd8d5c263781455d61":[11,0,4,15,4],
|
||||
"d0/d5a/skip__list_8cpp.html#ac0d7e0be24da9f41bcb19745873c436a":[11,0,4,15,3],
|
||||
"d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,15,2],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html":[9,0,71,2,0],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html":[9,0,73,2,0],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html":[10,0,8,2,0],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe":[10,0,8,2,0,8],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe":[9,0,71,2,0,8],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c":[9,0,71,2,0,6],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe":[9,0,73,2,0,8],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c":[9,0,73,2,0,6],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c":[10,0,8,2,0,6],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023":[9,0,71,2,0,5],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023":[9,0,73,2,0,5],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023":[10,0,8,2,0,5],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503":[10,0,8,2,0,4],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503":[9,0,71,2,0,4],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c":[9,0,71,2,0,2],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503":[9,0,73,2,0,4],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c":[9,0,73,2,0,2],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c":[10,0,8,2,0,2],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c":[10,0,8,2,0,9],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c":[9,0,71,2,0,9],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6":[9,0,71,2,0,7],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c":[9,0,73,2,0,9],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6":[10,0,8,2,0,7],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6":[9,0,73,2,0,7],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169":[10,0,8,2,0,1],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169":[9,0,71,2,0,1],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aefd24626ac47277431c9b8604e064340":[9,0,71,2,0,0],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169":[9,0,73,2,0,1],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aefd24626ac47277431c9b8604e064340":[10,0,8,2,0,0],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0":[9,0,71,2,0,3],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aefd24626ac47277431c9b8604e064340":[9,0,73,2,0,0],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0":[10,0,8,2,0,3],
|
||||
"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0":[9,0,73,2,0,3],
|
||||
"d0/d65/namespacedouble__hashing.html":[8,0,0],
|
||||
"d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003":[9,0,23,5],
|
||||
"d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd":[9,0,23,3],
|
||||
@@ -128,7 +128,7 @@ var NAVTREEINDEX2 =
|
||||
"d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,33,2],
|
||||
"d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,33,0],
|
||||
"d0/d6d/modular__exponentiation_8cpp.html#afcd07701d73ed65cd616bcba02737f3d":[11,0,14,33,1],
|
||||
"d0/d6f/namespaceothers.html":[9,0,72],
|
||||
"d0/d6f/namespaceothers.html":[9,0,74],
|
||||
"d0/d77/longest__palindromic__subsequence_8cpp.html":[11,0,6,7],
|
||||
"d0/d77/longest__palindromic__subsequence_8cpp.html#a6f73ddd8cd83d784036f131dfc6540c4":[11,0,6,7,0],
|
||||
"d0/d77/longest__palindromic__subsequence_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,6,7,2],
|
||||
@@ -137,13 +137,13 @@ var NAVTREEINDEX2 =
|
||||
"d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,14,38,2],
|
||||
"d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb":[11,0,14,38,1],
|
||||
"d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,38,0],
|
||||
"d0/da4/namespacemonte__carlo.html":[9,0,62],
|
||||
"d0/da4/namespacemonte__carlo.html":[9,0,64],
|
||||
"d0/db6/non__recursive__merge__sort_8cpp.html":[11,0,21,11],
|
||||
"d0/db6/non__recursive__merge__sort_8cpp.html#a140d913e42fb94176a0b2c8b29a80420":[11,0,21,11,2],
|
||||
"d0/db6/non__recursive__merge__sort_8cpp.html#a27236b8d3df3832e1f1225576a122534":[11,0,21,11,3],
|
||||
"d0/db6/non__recursive__merge__sort_8cpp.html#aa26de383227859210f14dcf12201a079":[11,0,21,11,0],
|
||||
"d0/db6/non__recursive__merge__sort_8cpp.html#ae97f4dd815654c4682f564afd718e824":[11,0,21,11,1],
|
||||
"d0/dda/namespacesaddleback.html":[9,0,87],
|
||||
"d0/dda/namespacesaddleback.html":[9,0,89],
|
||||
"d0/de2/gaussian__elimination_8cpp.html":[11,0,15,4],
|
||||
"d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,4,0],
|
||||
"d0/df8/namespaceabbreviation.html":[9,0,1],
|
||||
@@ -156,48 +156,50 @@ var NAVTREEINDEX2 =
|
||||
"d1/d21/quick__sort_8cpp.html#a7e7f25f31c50523990437abf2ac3907e":[11,0,21,14,1],
|
||||
"d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,14,0],
|
||||
"d1/d2a/knight__tour_8cpp.html":[11,0,0,1],
|
||||
"d1/d2a/knight__tour_8cpp.html#a531de8cb2d4d16ca63353d9c72158257":[11,0,0,1,0],
|
||||
"d1/d2a/knight__tour_8cpp.html#a932e38e8912742cedf7b5a837168e03a":[11,0,0,1,2],
|
||||
"d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9":[9,0,5,1,1],
|
||||
"d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9":[11,0,0,1,2],
|
||||
"d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,1,1],
|
||||
"d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2":[9,0,5,1,0],
|
||||
"d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2":[11,0,0,1,0],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html":[10,0,12,0,2],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html":[9,0,83,0,2],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70":[9,0,83,0,2,9],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html":[9,0,85,0,2],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70":[9,0,85,0,2,9],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70":[10,0,12,0,2,9],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1":[9,0,85,0,2,11],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1":[10,0,12,0,2,11],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1":[9,0,83,0,2,11],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a135b7952593c9b1aae38fcaf1cc1abf7":[9,0,83,0,2,17],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a135b7952593c9b1aae38fcaf1cc1abf7":[9,0,85,0,2,17],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a135b7952593c9b1aae38fcaf1cc1abf7":[10,0,12,0,2,17],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203":[9,0,85,0,2,14],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203":[10,0,12,0,2,14],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203":[9,0,83,0,2,14],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d":[9,0,83,0,2,1],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d":[9,0,85,0,2,1],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d":[10,0,12,0,2,1],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1":[9,0,83,0,2,0],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1":[9,0,85,0,2,0],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1":[10,0,12,0,2,0],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a8f7bca1746d40f21ad832fcea59aa6c6":[9,0,85,0,2,6],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a8f7bca1746d40f21ad832fcea59aa6c6":[10,0,12,0,2,6],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a8f7bca1746d40f21ad832fcea59aa6c6":[9,0,83,0,2,6],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460":[9,0,85,0,2,4],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460":[10,0,12,0,2,4],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460":[9,0,83,0,2,4],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa6c37e840355b9fb2105181c578694e8":[9,0,83,0,2,15],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa6c37e840355b9fb2105181c578694e8":[10,0,12,0,2,15],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab1aeaefa1bd97b867c652ba916fbdb43":[9,0,83,0,2,10],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa6c37e840355b9fb2105181c578694e8":[9,0,85,0,2,15],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab1aeaefa1bd97b867c652ba916fbdb43":[9,0,85,0,2,10],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab1aeaefa1bd97b867c652ba916fbdb43":[10,0,12,0,2,10],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab2ab020f798d00be2613ecf63074b7c1":[9,0,83,0,2,12],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab2ab020f798d00be2613ecf63074b7c1":[10,0,12,0,2,12],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0":[9,0,83,0,2,2],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab2ab020f798d00be2613ecf63074b7c1":[9,0,85,0,2,12],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0":[9,0,85,0,2,2],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0":[10,0,12,0,2,2],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3":[9,0,83,0,2,8],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3":[9,0,85,0,2,8],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3":[10,0,12,0,2,8],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc":[9,0,83,0,2,5],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc":[10,0,12,0,2,5],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc":[9,0,85,0,2,5],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ada1494fccbc7f1f07b2f9be9f7e07ad5":[10,0,12,0,2,16],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ada1494fccbc7f1f07b2f9be9f7e07ad5":[9,0,83,0,2,16],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ada1494fccbc7f1f07b2f9be9f7e07ad5":[9,0,85,0,2,16],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4":[9,0,85,0,2,7],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4":[10,0,12,0,2,7],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4":[9,0,83,0,2,7],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a":[10,0,12,0,2,13],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a":[9,0,83,0,2,13],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4":[9,0,83,0,2,3],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a":[9,0,85,0,2,13],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4":[9,0,85,0,2,3],
|
||||
"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4":[10,0,12,0,2,3],
|
||||
"d1/d64/namespacemodular__division.html":[9,0,61],
|
||||
"d1/d64/namespacemodular__division.html":[9,0,63],
|
||||
"d1/d76/buzz__number_8cpp.html":[11,0,17,0],
|
||||
"d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,0,0],
|
||||
"d1/d77/structmst.html":[10,0,37],
|
||||
@@ -247,7 +249,5 @@ var NAVTREEINDEX2 =
|
||||
"d1/d83/classuint256__t.html#a91badfd31be84b12cbb6d85ebc04d13a":[10,0,53,80],
|
||||
"d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484":[10,0,53,60],
|
||||
"d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839":[10,0,53,23],
|
||||
"d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250":[10,0,53,9],
|
||||
"d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363":[10,0,53,13],
|
||||
"d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183":[10,0,53,42]
|
||||
"d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250":[10,0,53,9]
|
||||
};
|
||||
|
||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user