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

Documentation for 8b1eab204b

Browse Source
This commit is contained in:
realstealthninja
2024-11-04 12:43:05 +00:00
parent 4fb6e622e9
commit a7bccf7d01
6732 changed files with 153919 additions and 365711 deletions
Download Patch File Download Diff File Expand all files Collapse all files

148
d4/d3e/k__nearest__neighbors_8cpp.html
View File

@@ -1,3 +1,4 @@
<!-- HTML header for doxygen 1.12.0-->
<!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" lang="en-US">
<head>
@@ -5,10 +6,15 @@
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: machine_learning/k_nearest_neighbors.cpp File Reference</title>
<title>TheAlgorithms/C++: machine_learning/k_nearest_neighbors.cpp File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
<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>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
<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 type="text/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</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>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
@@ -126,7 +143,9 @@ Include dependency graph for k_nearest_neighbors.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/dbb/k__nearest__neighbors_8cpp__incl.svg" width="658" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div><table class="memberdecls">
</div>
<p><a href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a></td></tr>
@@ -145,7 +164,7 @@ Namespaces</h2></td></tr>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ad6ae16e50bb153ebaa7251d0aaa97b69" id="r_ad6ae16e50bb153ebaa7251d0aaa97b69"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:ad6ae16e50bb153ebaa7251d0aaa97b69"><td class="memTemplItemLeft" align="right" valign="top">double&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ad6ae16e50bb153ebaa7251d0aaa97b69">machine_learning::k_nearest_neighbors::euclidean_distance</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;a, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;b)</td></tr>
<tr class="memitem:ad6ae16e50bb153ebaa7251d0aaa97b69"><td class="memTemplItemLeft" align="right" valign="top">double&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ad6ae16e50bb153ebaa7251d0aaa97b69">machine_learning::k_nearest_neighbors::euclidean_distance</a> (const std::vector&lt; T &gt; &amp;a, const std::vector&lt; T &gt; &amp;b)</td></tr>
<tr class="memdesc:ad6ae16e50bb153ebaa7251d0aaa97b69"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute the Euclidean distance between two vectors. <br /></td></tr>
<tr class="separator:ad6ae16e50bb153ebaa7251d0aaa97b69"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -159,6 +178,8 @@ Functions</h2></td></tr>
<div class="textblock"><p>Implementation of [K-Nearest Neighbors algorithm] (<a href="https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm">https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm</a>). </p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/luizcarloscf" target="_blank">Luiz Carlos Cosmi Filho</a></dd></dl>
<p>K-nearest neighbors algorithm, also known as KNN or k-NN, is a supervised learning classifier, which uses proximity to make classifications. This implementantion uses the Euclidean Distance as distance metric to find the K-nearest neighbors. </p>
<p class="definition">Definition in file <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html">k_nearest_neighbors.cpp</a>.</p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ad6ae16e50bb153ebaa7251d0aaa97b69" name="ad6ae16e50bb153ebaa7251d0aaa97b69"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad6ae16e50bb153ebaa7251d0aaa97b69">&#9670;&#160;</a></span>euclidean_distance()</h2>
@@ -171,12 +192,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">double machine_learning::k_nearest_neighbors::euclidean_distance </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
<td class="paramtype">const std::vector&lt; T &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>a</em></span>, </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/vector.html">std::vector</a>&lt; T &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
<td class="paramtype">const std::vector&lt; T &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -196,27 +217,16 @@ template&lt;typename T &gt; </div>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>double scalar representing the Euclidean distance between provided vectors </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 43</span> {</div>
<div class="line"><span class="lineno"> 44</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> aux;</div>
<div class="line"><span class="lineno"> 45</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/transform.html">std::transform</a>(a.begin(), a.end(), b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/back_inserter.html">std::back_inserter</a>(aux),</div>
<div class="line"><span class="lineno"> 46</span> [](T x1, T x2) { return std::pow((x1 - x2), 2); });</div>
<div class="line"><span class="lineno"> 47</span> aux.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html">shrink_to_fit</a>();</div>
<div class="line"><span class="lineno"> 48</span> <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html">std::accumulate</a>(aux.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), aux.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>(), 0.0));</div>
<div class="line"><span class="lineno"> 49</span>}</div>
<div class="ttc" id="aaccumulate_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html">std::accumulate</a></div><div class="ttdeci">T accumulate(T... args)</div></div>
<div class="ttc" id="aback_inserter_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/back_inserter.html">std::back_inserter</a></div><div class="ttdeci">T back_inserter(T... args)</div></div>
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div>
<div class="ttc" id="ashrink_to_fit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html">std::vector::shrink_to_fit</a></div><div class="ttdeci">T shrink_to_fit(T... args)</div></div>
<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
<div class="ttc" id="atransform_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/transform.html">std::transform</a></div><div class="ttdeci">T transform(T... args)</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>
</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="../../d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph.svg" width="328" height="348"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
<p class="definition">Definition at line <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html">k_nearest_neighbors.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 43</span> {</div>
<div class="line"><span class="lineno"> 44</span> std::vector&lt;double&gt; aux;</div>
<div class="line"><span class="lineno"> 45</span> std::transform(a.begin(), a.end(), b.begin(), std::back_inserter(aux),</div>
<div class="line"><span class="lineno"> 46</span> [](T x1, T x2) { return std::pow((x1 - x2), 2); });</div>
<div class="line"><span class="lineno"> 47</span> aux.shrink_to_fit();</div>
<div class="line"><span class="lineno"> 48</span> <span class="keywordflow">return</span> std::sqrt(std::accumulate(aux.begin(), aux.end(), 0.0));</div>
<div class="line"><span class="lineno"> 49</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
@@ -247,17 +257,14 @@ Here is the call graph for this function:</div>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>int 0 on exit </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html#l00193">193</a> of file <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html">k_nearest_neighbors.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 193</span> {</div>
<div class="line"><span class="lineno"> 194</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 195</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 196</span>}</div>
<div class="ttc" id="ak__nearest__neighbors_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> k_nearest_neighbors.cpp:140</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="../../d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
<div class="ttc" id="ak__nearest__neighbors_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html#l00140">k_nearest_neighbors.cpp:140</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -285,61 +292,56 @@ Here is the call graph for this function:</div>
<p>Self-test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html#l00140">140</a> of file <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html">k_nearest_neighbors.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 140</span> {</div>
<div class="line"><span class="lineno"> 141</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;------- Test 1 -------&quot;</span> &lt;&lt; <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"><span class="lineno"> 142</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;double&gt;</a>&gt; X1 = {{0.0, 0.0}, {0.25, 0.25},</div>
<div class="line"><span class="lineno"> 141</span> std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 1 -------&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 142</span> std::vector&lt;std::vector&lt;double&gt;&gt; X1 = {{0.0, 0.0}, {0.25, 0.25},</div>
<div class="line"><span class="lineno"> 143</span> {0.0, 0.5}, {0.5, 0.5},</div>
<div class="line"><span class="lineno"> 144</span> {1.0, 0.5}, {1.0, 1.0}};</div>
<div class="line"><span class="lineno"> 145</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> Y1 = {1, 1, 1, 1, 2, 2};</div>
<div class="line"><span class="lineno"> 145</span> std::vector&lt;int&gt; Y1 = {1, 1, 1, 1, 2, 2};</div>
<div class="line"><span class="lineno"> 146</span> <span class="keyword">auto</span> model1 = <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a>(X1, Y1);</div>
<div class="line"><span class="lineno"> 147</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample1 = {1.2, 1.2};</div>
<div class="line"><span class="lineno"> 148</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample2 = {0.1, 0.1};</div>
<div class="line"><span class="lineno"> 149</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample3 = {0.1, 0.5};</div>
<div class="line"><span class="lineno"> 150</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample4 = {1.0, 0.75};</div>
<div class="line"><span class="lineno"> 147</span> std::vector&lt;double&gt; sample1 = {1.2, 1.2};</div>
<div class="line"><span class="lineno"> 148</span> std::vector&lt;double&gt; sample2 = {0.1, 0.1};</div>
<div class="line"><span class="lineno"> 149</span> std::vector&lt;double&gt; sample3 = {0.1, 0.5};</div>
<div class="line"><span class="lineno"> 150</span> std::vector&lt;double&gt; sample4 = {1.0, 0.75};</div>
<div class="line"><span class="lineno"> 151</span> assert(model1.predict(sample1, 2) == 2);</div>
<div class="line"><span class="lineno"> 152</span> assert(model1.predict(sample2, 2) == 1);</div>
<div class="line"><span class="lineno"> 153</span> assert(model1.predict(sample3, 2) == 1);</div>
<div class="line"><span class="lineno"> 154</span> assert(model1.predict(sample4, 2) == 2);</div>
<div class="line"><span class="lineno"> 155</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;... Passed&quot;</span> &lt;&lt; <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"><span class="lineno"> 156</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;------- Test 2 -------&quot;</span> &lt;&lt; <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"><span class="lineno"> 157</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;double&gt;</a>&gt; X2 = {</div>
<div class="line"><span class="lineno"> 155</span> std::cout &lt;&lt; <span class="stringliteral">&quot;... Passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 156</span> std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 2 -------&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 157</span> std::vector&lt;std::vector&lt;double&gt;&gt; X2 = {</div>
<div class="line"><span class="lineno"> 158</span> {0.0, 0.0, 0.0}, {0.25, 0.25, 0.0}, {0.0, 0.5, 0.0}, {0.5, 0.5, 0.0},</div>
<div class="line"><span class="lineno"> 159</span> {1.0, 0.5, 0.0}, {1.0, 1.0, 0.0}, {1.0, 1.0, 1.0}, {1.5, 1.5, 1.0}};</div>
<div class="line"><span class="lineno"> 160</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> Y2 = {1, 1, 1, 1, 2, 2, 3, 3};</div>
<div class="line"><span class="lineno"> 160</span> std::vector&lt;int&gt; Y2 = {1, 1, 1, 1, 2, 2, 3, 3};</div>
<div class="line"><span class="lineno"> 161</span> <span class="keyword">auto</span> model2 = <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a>(X2, Y2);</div>
<div class="line"><span class="lineno"> 162</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample5 = {1.2, 1.2, 0.0};</div>
<div class="line"><span class="lineno"> 163</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample6 = {0.1, 0.1, 0.0};</div>
<div class="line"><span class="lineno"> 164</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample7 = {0.1, 0.5, 0.0};</div>
<div class="line"><span class="lineno"> 165</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample8 = {1.0, 0.75, 1.0};</div>
<div class="line"><span class="lineno"> 162</span> std::vector&lt;double&gt; sample5 = {1.2, 1.2, 0.0};</div>
<div class="line"><span class="lineno"> 163</span> std::vector&lt;double&gt; sample6 = {0.1, 0.1, 0.0};</div>
<div class="line"><span class="lineno"> 164</span> std::vector&lt;double&gt; sample7 = {0.1, 0.5, 0.0};</div>
<div class="line"><span class="lineno"> 165</span> std::vector&lt;double&gt; sample8 = {1.0, 0.75, 1.0};</div>
<div class="line"><span class="lineno"> 166</span> assert(model2.predict(sample5, 2) == 2);</div>
<div class="line"><span class="lineno"> 167</span> assert(model2.predict(sample6, 2) == 1);</div>
<div class="line"><span class="lineno"> 168</span> assert(model2.predict(sample7, 2) == 1);</div>
<div class="line"><span class="lineno"> 169</span> assert(model2.predict(sample8, 2) == 3);</div>
<div class="line"><span class="lineno"> 170</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;... Passed&quot;</span> &lt;&lt; <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"><span class="lineno"> 171</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;------- Test 3 -------&quot;</span> &lt;&lt; <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"><span class="lineno"> 172</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;double&gt;</a>&gt; X3 = {{0.0}, {1.0}, {2.0}, {3.0},</div>
<div class="line"><span class="lineno"> 170</span> std::cout &lt;&lt; <span class="stringliteral">&quot;... Passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 171</span> std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 3 -------&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 172</span> std::vector&lt;std::vector&lt;double&gt;&gt; X3 = {{0.0}, {1.0}, {2.0}, {3.0},</div>
<div class="line"><span class="lineno"> 173</span> {4.0}, {5.0}, {6.0}, {7.0}};</div>
<div class="line"><span class="lineno"> 174</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> Y3 = {1, 1, 1, 1, 2, 2, 2, 2};</div>
<div class="line"><span class="lineno"> 174</span> std::vector&lt;int&gt; Y3 = {1, 1, 1, 1, 2, 2, 2, 2};</div>
<div class="line"><span class="lineno"> 175</span> <span class="keyword">auto</span> model3 = <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a>(X3, Y3);</div>
<div class="line"><span class="lineno"> 176</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample9 = {0.5};</div>
<div class="line"><span class="lineno"> 177</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample10 = {2.9};</div>
<div class="line"><span class="lineno"> 178</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample11 = {5.5};</div>
<div class="line"><span class="lineno"> 179</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample12 = {7.5};</div>
<div class="line"><span class="lineno"> 176</span> std::vector&lt;double&gt; sample9 = {0.5};</div>
<div class="line"><span class="lineno"> 177</span> std::vector&lt;double&gt; sample10 = {2.9};</div>
<div class="line"><span class="lineno"> 178</span> std::vector&lt;double&gt; sample11 = {5.5};</div>
<div class="line"><span class="lineno"> 179</span> std::vector&lt;double&gt; sample12 = {7.5};</div>
<div class="line"><span class="lineno"> 180</span> assert(model3.predict(sample9, 3) == 1);</div>
<div class="line"><span class="lineno"> 181</span> assert(model3.predict(sample10, 3) == 1);</div>
<div class="line"><span class="lineno"> 182</span> assert(model3.predict(sample11, 3) == 2);</div>
<div class="line"><span class="lineno"> 183</span> assert(model3.predict(sample12, 3) == 2);</div>
<div class="line"><span class="lineno"> 184</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;... Passed&quot;</span> &lt;&lt; <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"><span class="lineno"> 184</span> std::cout &lt;&lt; <span class="stringliteral">&quot;... Passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 185</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="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a></div><div class="ttdoc">K-Nearest Neighbors (Knn) class using Euclidean distance as distance metric.</div><div class="ttdef"><b>Definition</b> k_nearest_neighbors.cpp:55</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="../../d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a></div><div class="ttdoc">K-Nearest Neighbors (Knn) class using Euclidean distance as distance metric.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html#l00055">k_nearest_neighbors.cpp:55</a></div></div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->

7
d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
View File

@@ -1,7 +0,0 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
<area shape="rect" id="Node000002" href="$d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
</map>

1
d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
View File

@@ -1 +0,0 @@
4eaacbc222129bd9ffcb246ff2dd39bc

83
d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
View File

@@ -1,83 +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 12.1.2 (20240928.0832)
-->
<!-- Title: main Pages: 1 -->
<svg width="203pt" height="27pt"
viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 3.2 KiB

57
d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
View File

@@ -1,57 +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 12.1.2 (20240928.0832)
-->
<!-- Title: main Pages: 1 -->
<svg width="203pt" height="27pt"
viewBox="0.00 0.00 203.00 27.25" 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 23.25)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 2.4 KiB

5
d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
View File

@@ -1,5 +0,0 @@
<map id="test" name="test">
<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
</map>

1
d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
View File

@@ -1 +0,0 @@
729fb887ee50b6291b0542ba0592a5c7

65
d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
View File

@@ -1,65 +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 12.1.2 (20240928.0832)
-->
<!-- Title: test Pages: 1 -->
<svg width="130pt" height="27pt"
viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 2.4 KiB

39
d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
View File

@@ -1,39 +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 12.1.2 (20240928.0832)
-->
<!-- Title: test Pages: 1 -->
<svg width="130pt" height="27pt"
viewBox="0.00 0.00 130.00 27.25" 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 23.25)">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 1.6 KiB

18
d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph.map
View File

@@ -1,18 +0,0 @@
<map id="machine_learning::k_nearest_neighbors::euclidean_distance" name="machine_learning::k_nearest_neighbors::euclidean_distance">
<area shape="rect" id="Node000001" title="Compute the Euclidean distance between two vectors." alt="" coords="5,138,148,194"/>
<area shape="poly" id="edge5_Node000001_Node000001" title=" " alt="" coords="40,138,41,128,47,119,59,114,77,112,96,114,108,121,105,126,94,119,76,117,61,119,51,123,46,130,46,138"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/accumulate.html#" title=" " alt="" coords="202,5,316,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="96,136,138,88,165,62,194,40,201,36,204,40,197,44,169,66,142,92,100,140"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/back_inserter.html#" title=" " alt="" coords="196,55,322,80"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="117,136,194,89,204,84,207,89,197,94,119,140"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="198,104,320,130"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="148,144,194,132,195,137,149,149"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="203,153,315,179"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="148,164,187,164,187,169,148,169"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/shrink_to_fit.html#" title=" " alt="" coords="196,203,322,244"/>
<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="149,186,182,197,180,202,148,191"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="224,268,294,294"/>
<area shape="poly" id="edge7_Node000001_Node000007" title=" " alt="" coords="112,192,152,223,197,253,211,261,209,265,194,258,148,228,109,197"/>
<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/transform.html#" title=" " alt="" coords="208,317,310,343"/>
<area shape="poly" id="edge8_Node000001_Node000008" title=" " alt="" coords="98,193,139,249,167,278,197,304,203,308,200,312,194,308,163,282,135,252,93,196"/>
</map>

1
d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph.md5
View File

@@ -1 +0,0 @@
344d44295d621c27521bf3756edc7fd0

185
d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph.svg
View File

@@ -1,185 +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 12.1.2 (20240928.0832)
-->
<!-- Title: machine_learning::k_nearest_neighbors::euclidean_distance Pages: 1 -->
<svg width="246pt" height="261pt"
viewBox="0.00 0.00 245.50 261.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 257.25)">
<title>machine_learning::k_nearest_neighbors::euclidean_distance</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Compute the Euclidean distance between two vectors.">
<polygon fill="#999999" stroke="#666666" points="106.75,-153.5 0,-153.5 0,-111.75 106.75,-111.75 106.75,-153.5"/>
<text text-anchor="start" x="8" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::k</text>
<text text-anchor="start" x="8" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">_nearest_neighbors::</text>
<text text-anchor="middle" x="53.38" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">euclidean_distance</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge5_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge5_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M28.14,-153.82C25.73,-163.3 34.14,-171.5 53.38,-171.5 64.49,-171.5 71.99,-168.76 75.88,-164.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="79.18,-165.84 78.24,-155.29 72.4,-164.12 79.18,-165.84"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="233,-253.25 147.25,-253.25 147.25,-234 233,-234 233,-253.25"/>
<text text-anchor="middle" x="190.12" y="-239.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::accumulate</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M69.85,-153.68C86.03,-174.41 113.15,-205.78 142.75,-225.62 144.33,-226.68 145.98,-227.69 147.67,-228.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="145.87,-231.67 156.39,-232.96 148.97,-225.39 145.87,-231.67"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/back_inserter.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="237.12,-216.25 143.12,-216.25 143.12,-197 237.12,-197 237.12,-216.25"/>
<text text-anchor="middle" x="190.12" y="-202.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::back_inserter</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M84.6,-153.84C101.28,-165.02 122.64,-178.47 142.75,-188.62 145.16,-189.84 147.67,-191.03 150.22,-192.17"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.82,-195.38 159.39,-196.05 151.54,-188.93 148.82,-195.38"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="236,-179.25 144.25,-179.25 144.25,-160 236,-160 236,-179.25"/>
<text text-anchor="middle" x="190.12" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M107.25,-147.14C118.64,-150.27 130.61,-153.56 141.77,-156.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="140.59,-159.93 151.16,-159.2 142.44,-153.18 140.59,-159.93"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="232.25,-142.25 148,-142.25 148,-123 232.25,-123 232.25,-142.25"/>
<text text-anchor="middle" x="190.12" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M107.25,-132.62C116.79,-132.62 126.73,-132.62 136.27,-132.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.14,-136.13 146.14,-132.63 136.14,-129.13 136.14,-136.13"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="237.5,-104.88 142.75,-104.88 142.75,-74.38 237.5,-74.38 237.5,-104.88"/>
<text text-anchor="start" x="150.75" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::shrink</text>
<text text-anchor="middle" x="190.12" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_to_fit</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge6_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M107.25,-115.75C115.25,-113.2 123.55,-110.55 131.65,-107.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="132.63,-111.33 141.09,-104.95 130.5,-104.66 132.63,-111.33"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="216.12,-56.25 164.12,-56.25 164.12,-37 216.12,-37 216.12,-56.25"/>
<text text-anchor="middle" x="190.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge7_Node000001_Node000007" class="edge">
<title>Node1&#45;&gt;Node7</title>
<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M78.69,-111.44C95.8,-97.24 119.68,-78.8 142.75,-65.62 146.18,-63.67 149.85,-61.81 153.57,-60.07"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="154.85,-63.33 162.62,-56.13 152.06,-56.91 154.85,-63.33"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/transform.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="228.5,-19.25 151.75,-19.25 151.75,0 228.5,0 228.5,-19.25"/>
<text text-anchor="middle" x="190.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::transform</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node8 -->
<g id="edge8_Node000001_Node000008" class="edge">
<title>Node1&#45;&gt;Node8</title>
<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M67.53,-111.35C82.97,-87.95 110.58,-50.63 142.75,-27.62 144.11,-26.65 145.53,-25.72 147,-24.84"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.48,-28.01 155.75,-20.3 145.26,-21.79 148.48,-28.01"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 8.5 KiB

159
d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph_org.svg
View File

@@ -1,159 +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 12.1.2 (20240928.0832)
-->
<!-- Title: machine_learning::k_nearest_neighbors::euclidean_distance Pages: 1 -->
<svg width="246pt" height="261pt"
viewBox="0.00 0.00 245.50 261.25" 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 257.25)">
<title>machine_learning::k_nearest_neighbors::euclidean_distance</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Compute the Euclidean distance between two vectors.">
<polygon fill="#999999" stroke="#666666" points="106.75,-153.5 0,-153.5 0,-111.75 106.75,-111.75 106.75,-153.5"/>
<text text-anchor="start" x="8" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::k</text>
<text text-anchor="start" x="8" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">_nearest_neighbors::</text>
<text text-anchor="middle" x="53.38" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">euclidean_distance</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge5_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge5_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M28.14,-153.82C25.73,-163.3 34.14,-171.5 53.38,-171.5 64.49,-171.5 71.99,-168.76 75.88,-164.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="79.18,-165.84 78.24,-155.29 72.4,-164.12 79.18,-165.84"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="233,-253.25 147.25,-253.25 147.25,-234 233,-234 233,-253.25"/>
<text text-anchor="middle" x="190.12" y="-239.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::accumulate</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M69.85,-153.68C86.03,-174.41 113.15,-205.78 142.75,-225.62 144.33,-226.68 145.98,-227.69 147.67,-228.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="145.87,-231.67 156.39,-232.96 148.97,-225.39 145.87,-231.67"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/back_inserter.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="237.12,-216.25 143.12,-216.25 143.12,-197 237.12,-197 237.12,-216.25"/>
<text text-anchor="middle" x="190.12" y="-202.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::back_inserter</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M84.6,-153.84C101.28,-165.02 122.64,-178.47 142.75,-188.62 145.16,-189.84 147.67,-191.03 150.22,-192.17"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.82,-195.38 159.39,-196.05 151.54,-188.93 148.82,-195.38"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="236,-179.25 144.25,-179.25 144.25,-160 236,-160 236,-179.25"/>
<text text-anchor="middle" x="190.12" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M107.25,-147.14C118.64,-150.27 130.61,-153.56 141.77,-156.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="140.59,-159.93 151.16,-159.2 142.44,-153.18 140.59,-159.93"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="232.25,-142.25 148,-142.25 148,-123 232.25,-123 232.25,-142.25"/>
<text text-anchor="middle" x="190.12" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M107.25,-132.62C116.79,-132.62 126.73,-132.62 136.27,-132.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.14,-136.13 146.14,-132.63 136.14,-129.13 136.14,-136.13"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="237.5,-104.88 142.75,-104.88 142.75,-74.38 237.5,-74.38 237.5,-104.88"/>
<text text-anchor="start" x="150.75" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::shrink</text>
<text text-anchor="middle" x="190.12" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_to_fit</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge6_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M107.25,-115.75C115.25,-113.2 123.55,-110.55 131.65,-107.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="132.63,-111.33 141.09,-104.95 130.5,-104.66 132.63,-111.33"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="216.12,-56.25 164.12,-56.25 164.12,-37 216.12,-37 216.12,-56.25"/>
<text text-anchor="middle" x="190.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge7_Node000001_Node000007" class="edge">
<title>Node1&#45;&gt;Node7</title>
<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M78.69,-111.44C95.8,-97.24 119.68,-78.8 142.75,-65.62 146.18,-63.67 149.85,-61.81 153.57,-60.07"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="154.85,-63.33 162.62,-56.13 152.06,-56.91 154.85,-63.33"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/transform.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="228.5,-19.25 151.75,-19.25 151.75,0 228.5,0 228.5,-19.25"/>
<text text-anchor="middle" x="190.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::transform</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node8 -->
<g id="edge8_Node000001_Node000008" class="edge">
<title>Node1&#45;&gt;Node8</title>
<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M67.53,-111.35C82.97,-87.95 110.58,-50.63 142.75,-27.62 144.11,-26.65 145.53,-25.72 147,-24.84"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.48,-28.01 155.75,-20.3 145.26,-21.79 148.48,-28.01"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 7.8 KiB

289
d4/d3e/k__nearest__neighbors_8cpp_source.html Normal file
View File

@@ -0,0 +1,289 @@
<!-- HTML header for doxygen 1.12.0-->
<!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" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: machine_learning/k_nearest_neighbors.cpp Source File</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
<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>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</script>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../doxygen-awesome.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 id="projectrow">
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.12.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<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&amp;dn=expat.txt MIT */
$(function(){initNavTree('d4/d3e/k__nearest__neighbors_8cpp_source.html','../../'); initResizable(true); });
/* @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">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">k_nearest_neighbors.cpp</div></div>
</div><!--header-->
<div class="contents">
<a href="../../d4/d3e/k__nearest__neighbors_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span> </div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="preprocessor">#include &lt;algorithm&gt;</span> </div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span><span class="preprocessor">#include &lt;cassert&gt;</span> </div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include &lt;cmath&gt;</span> </div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#include &lt;iostream&gt;</span> </div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include &lt;numeric&gt;</span> </div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include &lt;unordered_map&gt;</span> </div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include &lt;vector&gt;</span> </div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span> </div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d77/namespacemachine__learning.html">machine_learning</a> {</div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span> </div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d4c/namespacek__nearest__neighbors.html">k_nearest_neighbors</a> {</div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> </div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00043" data-start="{" data-end="}">
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="../../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69"> 43</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69">euclidean_distance</a>(<span class="keyword">const</span> std::vector&lt;T&gt;&amp; a, <span class="keyword">const</span> std::vector&lt;T&gt;&amp; b) {</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> std::vector&lt;double&gt; aux;</div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> std::transform(a.begin(), a.end(), b.begin(), std::back_inserter(aux),</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> [](T x1, T x2) { return std::pow((x1 - x2), 2); });</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> aux.shrink_to_fit();</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keywordflow">return</span> std::sqrt(std::accumulate(aux.begin(), aux.end(), 0.0));</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span>}</div>
</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> </div>
<div class="foldopen" id="foldopen00055" data-start="{" data-end="};">
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html"> 55</a></span><span class="keyword">class </span><a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">Knn</a> {</div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keyword">private</span>:</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a16ddc13621eec6ac5f83658b3401a581"> 57</a></span> std::vector&lt;std::vector&lt;double&gt;&gt; <a class="code hl_variable" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a16ddc13621eec6ac5f83658b3401a581">X_</a>{}; </div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a209383503fb6c03afac405a80bace964"> 58</a></span> std::vector&lt;int&gt; <a class="code hl_variable" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a209383503fb6c03afac405a80bace964">Y_</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> <span class="keyword">public</span>:</div>
<div class="foldopen" id="foldopen00067" data-start="{" data-end="}">
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200"> 67</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200">Knn</a>(std::vector&lt;std::vector&lt;double&gt;&gt;&amp; X, std::vector&lt;int&gt;&amp; Y)</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> : <a class="code hl_variable" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a16ddc13621eec6ac5f83658b3401a581">X_</a>(X), <a class="code hl_variable" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a209383503fb6c03afac405a80bace964">Y_</a>(Y){};</div>
</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> </div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b"> 75</a></span> <a class="code hl_function" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b">Knn</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">Knn</a>&amp; model) = <span class="keywordflow">default</span>;</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> </div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a080f5b1742832a03c1cbba596a48bd1a"> 80</a></span> <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">Knn</a>&amp; <a class="code hl_function" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a080f5b1742832a03c1cbba596a48bd1a">operator=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">Knn</a>&amp; model) = <span class="keywordflow">default</span>;</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> </div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e"> 85</a></span> <a class="code hl_function" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e">Knn</a>(<a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">Knn</a>&amp;&amp;) = <span class="keywordflow">default</span>;</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> </div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#ac06986d5afddc767ddba4da738f75563"> 90</a></span> <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">Knn</a>&amp; <a class="code hl_function" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#ac06986d5afddc767ddba4da738f75563">operator=</a>(<a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">Knn</a>&amp;&amp;) = <span class="keywordflow">default</span>;</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> </div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#afe732a33112b457b738f403622d226e5"> 95</a></span> <a class="code hl_function" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#afe732a33112b457b738f403622d226e5">~Knn</a>() = <span class="keywordflow">default</span>;</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> </div>
<div class="foldopen" id="foldopen00103" data-start="{" data-end="}">
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a62e152db014cd4de675fa906e5ef2861"> 103</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a62e152db014cd4de675fa906e5ef2861">predict</a>(std::vector&lt;double&gt;&amp; sample, <span class="keywordtype">int</span> k) {</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> std::vector&lt;int&gt; neighbors;</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> std::vector&lt;std::pair&lt;double, int&gt;&gt; distances;</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; this-&gt;<a class="code hl_variable" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a16ddc13621eec6ac5f83658b3401a581">X_</a>.size(); ++i) {</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="keyword">auto</span> current = this-&gt;<a class="code hl_variable" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a16ddc13621eec6ac5f83658b3401a581">X_</a>.at(i);</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keyword">auto</span> label = this-&gt;<a class="code hl_variable" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a209383503fb6c03afac405a80bace964">Y_</a>.at(i);</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="keyword">auto</span> distance = <a class="code hl_function" href="../../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69">euclidean_distance</a>(current, sample);</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> distances.emplace_back(distance, label);</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> std::sort(distances.begin(), distances.end());</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; k; i++) {</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="keyword">auto</span> label = distances.at(i).second;</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> neighbors.push_back(label);</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> }</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> std::unordered_map&lt;int, int&gt; frequency;</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> neighbor : neighbors) {</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> ++frequency[neighbor];</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> std::pair&lt;int, int&gt; predicted;</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> predicted.first = -1;</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> predicted.second = -1;</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; kv : frequency) {</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordflow">if</span> (kv.second &gt; predicted.second) {</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> predicted.second = kv.second;</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> predicted.first = kv.first;</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> }</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> }</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="keywordflow">return</span> predicted.first;</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> }</div>
</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span>};</div>
</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span>} <span class="comment">// namespace k_nearest_neighbors</span></div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span>} <span class="comment">// namespace machine_learning</span></div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> </div>
<div class="foldopen" id="foldopen00140" data-start="{" data-end="}">
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"><a class="line" href="../../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"> 140</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 1 -------&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> std::vector&lt;std::vector&lt;double&gt;&gt; X1 = {{0.0, 0.0}, {0.25, 0.25},</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> {0.0, 0.5}, {0.5, 0.5},</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> {1.0, 0.5}, {1.0, 1.0}};</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> std::vector&lt;int&gt; Y1 = {1, 1, 1, 1, 2, 2};</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="keyword">auto</span> model1 = <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a>(X1, Y1);</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> std::vector&lt;double&gt; sample1 = {1.2, 1.2};</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> std::vector&lt;double&gt; sample2 = {0.1, 0.1};</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> std::vector&lt;double&gt; sample3 = {0.1, 0.5};</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> std::vector&lt;double&gt; sample4 = {1.0, 0.75};</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> assert(model1.predict(sample1, 2) == 2);</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> assert(model1.predict(sample2, 2) == 1);</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> assert(model1.predict(sample3, 2) == 1);</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> assert(model1.predict(sample4, 2) == 2);</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> std::cout &lt;&lt; <span class="stringliteral">&quot;... Passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 2 -------&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> std::vector&lt;std::vector&lt;double&gt;&gt; X2 = {</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> {0.0, 0.0, 0.0}, {0.25, 0.25, 0.0}, {0.0, 0.5, 0.0}, {0.5, 0.5, 0.0},</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> {1.0, 0.5, 0.0}, {1.0, 1.0, 0.0}, {1.0, 1.0, 1.0}, {1.5, 1.5, 1.0}};</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> std::vector&lt;int&gt; Y2 = {1, 1, 1, 1, 2, 2, 3, 3};</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="keyword">auto</span> model2 = <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a>(X2, Y2);</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> std::vector&lt;double&gt; sample5 = {1.2, 1.2, 0.0};</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> std::vector&lt;double&gt; sample6 = {0.1, 0.1, 0.0};</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> std::vector&lt;double&gt; sample7 = {0.1, 0.5, 0.0};</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> std::vector&lt;double&gt; sample8 = {1.0, 0.75, 1.0};</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> assert(model2.predict(sample5, 2) == 2);</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> assert(model2.predict(sample6, 2) == 1);</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> assert(model2.predict(sample7, 2) == 1);</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> assert(model2.predict(sample8, 2) == 3);</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> std::cout &lt;&lt; <span class="stringliteral">&quot;... Passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 3 -------&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> std::vector&lt;std::vector&lt;double&gt;&gt; X3 = {{0.0}, {1.0}, {2.0}, {3.0},</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> {4.0}, {5.0}, {6.0}, {7.0}};</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> std::vector&lt;int&gt; Y3 = {1, 1, 1, 1, 2, 2, 2, 2};</div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="keyword">auto</span> model3 = <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a>(X3, Y3);</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> std::vector&lt;double&gt; sample9 = {0.5};</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> std::vector&lt;double&gt; sample10 = {2.9};</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> std::vector&lt;double&gt; sample11 = {5.5};</div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> std::vector&lt;double&gt; sample12 = {7.5};</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> assert(model3.predict(sample9, 3) == 1);</div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> assert(model3.predict(sample10, 3) == 1);</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> assert(model3.predict(sample11, 3) == 2);</div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> assert(model3.predict(sample12, 3) == 2);</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> std::cout &lt;&lt; <span class="stringliteral">&quot;... Passed&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span>}</div>
</div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> </div>
<div class="foldopen" id="foldopen00193" data-start="{" data-end="}">
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"><a class="line" href="../../d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97"> 193</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span>* argv[]) {</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <a class="code hl_function" href="../../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span>}</div>
</div>
<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a></div><div class="ttdoc">K-Nearest Neighbors (Knn) class using Euclidean distance as distance metric.</div><div class="ttdef"><b>Definition</b> <a href="#l00055">k_nearest_neighbors.cpp:55</a></div></div>
<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_a080f5b1742832a03c1cbba596a48bd1a"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a080f5b1742832a03c1cbba596a48bd1a">machine_learning::k_nearest_neighbors::Knn::operator=</a></div><div class="ttdeci">Knn &amp; operator=(const Knn &amp;model)=default</div></div>
<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_a16ddc13621eec6ac5f83658b3401a581"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a16ddc13621eec6ac5f83658b3401a581">machine_learning::k_nearest_neighbors::Knn::X_</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; double &gt; &gt; X_</div><div class="ttdoc">attributes vector</div><div class="ttdef"><b>Definition</b> <a href="#l00057">k_nearest_neighbors.cpp:57</a></div></div>
<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_a188d29ffcefdb5900a8cd41eccd89200"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200">machine_learning::k_nearest_neighbors::Knn::Knn</a></div><div class="ttdeci">Knn(std::vector&lt; std::vector&lt; double &gt; &gt; &amp;X, std::vector&lt; int &gt; &amp;Y)</div><div class="ttdoc">Construct a new Knn object.</div><div class="ttdef"><b>Definition</b> <a href="#l00067">k_nearest_neighbors.cpp:67</a></div></div>
<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_a209383503fb6c03afac405a80bace964"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a209383503fb6c03afac405a80bace964">machine_learning::k_nearest_neighbors::Knn::Y_</a></div><div class="ttdeci">std::vector&lt; int &gt; Y_</div><div class="ttdoc">labels vector</div><div class="ttdef"><b>Definition</b> <a href="#l00058">k_nearest_neighbors.cpp:58</a></div></div>
<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_a4b17dcf17c847f0295b60029512c120e"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e">machine_learning::k_nearest_neighbors::Knn::Knn</a></div><div class="ttdeci">Knn(Knn &amp;&amp;)=default</div></div>
<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_a62e152db014cd4de675fa906e5ef2861"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a62e152db014cd4de675fa906e5ef2861">machine_learning::k_nearest_neighbors::Knn::predict</a></div><div class="ttdeci">int predict(std::vector&lt; double &gt; &amp;sample, int k)</div><div class="ttdoc">Classify sample.</div><div class="ttdef"><b>Definition</b> <a href="#l00103">k_nearest_neighbors.cpp:103</a></div></div>
<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_a9f5885c40112481ae5b588fe81d7910b"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b">machine_learning::k_nearest_neighbors::Knn::Knn</a></div><div class="ttdeci">Knn(const Knn &amp;model)=default</div></div>
<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_ac06986d5afddc767ddba4da738f75563"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#ac06986d5afddc767ddba4da738f75563">machine_learning::k_nearest_neighbors::Knn::operator=</a></div><div class="ttdeci">Knn &amp; operator=(Knn &amp;&amp;)=default</div></div>
<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_afe732a33112b457b738f403622d226e5"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#afe732a33112b457b738f403622d226e5">machine_learning::k_nearest_neighbors::Knn::~Knn</a></div><div class="ttdeci">~Knn()=default</div><div class="ttdoc">Destroy the Knn object.</div></div>
<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
<div class="ttc" id="ak__nearest__neighbors_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d3e/k__nearest__neighbors_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> <a href="#l00140">k_nearest_neighbors.cpp:140</a></div></div>
<div class="ttc" id="ak__nearest__neighbors_8cpp_html_ad6ae16e50bb153ebaa7251d0aaa97b69"><div class="ttname"><a href="../../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69">machine_learning::k_nearest_neighbors::euclidean_distance</a></div><div class="ttdeci">double euclidean_distance(const std::vector&lt; T &gt; &amp;a, const std::vector&lt; T &gt; &amp;b)</div><div class="ttdoc">Compute the Euclidean distance between two vectors.</div><div class="ttdef"><b>Definition</b> <a href="#l00043">k_nearest_neighbors.cpp:43</a></div></div>
<div class="ttc" id="anamespacek__nearest__neighbors_html"><div class="ttname"><a href="../../d7/d4c/namespacek__nearest__neighbors.html">k_nearest_neighbors</a></div><div class="ttdoc">Functions for the [K-Nearest Neighbors algorithm] (https://en.wikipedia.org/wiki/K-nearest_neighbors_...</div></div>
<div class="ttc" id="anamespacemachine__learning_html"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></div><div class="ttdoc">A* search algorithm</div></div>
</div><!-- fragment --></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="../../dir_3343723ae086de42ee4ca9774da3a13f.html">machine_learning</a></li><li class="navelem"><a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp.html">k_nearest_neighbors.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
</ul>
</div>
</body>
</html>

82
d4/d3e/n__queens_8cpp.html
View File

@@ -1,3 +1,4 @@
<!-- HTML header for doxygen 1.12.0-->
<!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" lang="en-US">
<head>
@@ -5,10 +6,15 @@
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: backtracking/n_queens.cpp File Reference</title>
<title>TheAlgorithms/C++: backtracking/n_queens.cpp File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
<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>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
<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 type="text/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</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>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
@@ -120,7 +137,9 @@ Include dependency graph for n_queens.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d83/n__queens_8cpp__incl.svg" width="191" height="111"><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">
</div>
<p><a href="../../d4/d3e/n__queens_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html">backtracking</a></td></tr>
@@ -133,13 +152,13 @@ Namespaces</h2></td></tr>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a40ae0c7fd04eb20e7f3bff13fc6a5808" id="r_a40ae0c7fd04eb20e7f3bff13fc6a5808"><td class="memTemplParams" colspan="2">template&lt;size_t n&gt; </td></tr>
<tr class="memitem:a40ae0c7fd04eb20e7f3bff13fc6a5808"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a40ae0c7fd04eb20e7f3bff13fc6a5808">backtracking::n_queens::printSolution</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; &amp;board)</td></tr>
<tr class="memitem:a40ae0c7fd04eb20e7f3bff13fc6a5808"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a40ae0c7fd04eb20e7f3bff13fc6a5808">backtracking::n_queens::printSolution</a> (const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board)</td></tr>
<tr class="separator:a40ae0c7fd04eb20e7f3bff13fc6a5808"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5730b6683f6adcf5c5ef75cf53dc7160" id="r_a5730b6683f6adcf5c5ef75cf53dc7160"><td class="memTemplParams" colspan="2">template&lt;size_t n&gt; </td></tr>
<tr class="memitem:a5730b6683f6adcf5c5ef75cf53dc7160"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5730b6683f6adcf5c5ef75cf53dc7160">backtracking::n_queens::isSafe</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; &amp;board, const int &amp;row, const int &amp;col)</td></tr>
<tr class="memitem:a5730b6683f6adcf5c5ef75cf53dc7160"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5730b6683f6adcf5c5ef75cf53dc7160">backtracking::n_queens::isSafe</a> (const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board, const int &amp;row, const int &amp;col)</td></tr>
<tr class="separator:a5730b6683f6adcf5c5ef75cf53dc7160"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0dbd7af47d87f0b956609fe9e3288ecb" id="r_a0dbd7af47d87f0b956609fe9e3288ecb"><td class="memTemplParams" colspan="2">template&lt;size_t n&gt; </td></tr>
<tr class="memitem:a0dbd7af47d87f0b956609fe9e3288ecb"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a0dbd7af47d87f0b956609fe9e3288ecb">backtracking::n_queens::solveNQ</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; board, const int &amp;col)</td></tr>
<tr class="memitem:a0dbd7af47d87f0b956609fe9e3288ecb"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a0dbd7af47d87f0b956609fe9e3288ecb">backtracking::n_queens::solveNQ</a> (std::array&lt; std::array&lt; int, n &gt;, n &gt; board, const int &amp;col)</td></tr>
<tr class="separator:a0dbd7af47d87f0b956609fe9e3288ecb"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
@@ -151,6 +170,8 @@ Functions</h2></td></tr>
<dl class="section author"><dt>Author</dt><dd>Unknown author </dd>
<dd>
<a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
<p class="definition">Definition in file <a class="el" href="../../d4/d3e/n__queens_8cpp_source.html">n_queens.cpp</a>.</p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a5730b6683f6adcf5c5ef75cf53dc7160" name="a5730b6683f6adcf5c5ef75cf53dc7160"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5730b6683f6adcf5c5ef75cf53dc7160">&#9670;&#160;</a></span>isSafe()</h2>
@@ -163,7 +184,7 @@ template&lt;size_t n&gt; </div>
<tr>
<td class="memname">bool backtracking::n_queens::isSafe </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>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>board</em></span>, </td>
<td class="paramtype">const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>board</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
@@ -194,6 +215,8 @@ template&lt;size_t n&gt; </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>
<p class="definition">Definition at line <a class="el" href="../../d4/d3e/n__queens_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d4/d3e/n__queens_8cpp_source.html">n_queens.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 59</span> {</div>
<div class="line"><span class="lineno"> 60</span> <span class="keywordtype">int</span> i = 0, j = 0;</div>
<div class="line"><span class="lineno"> 61</span> </div>
@@ -238,16 +261,17 @@ template&lt;size_t n&gt; </div>
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d4/d3e/n__queens_8cpp_source.html#l00120">120</a> of file <a class="el" href="../../d4/d3e/n__queens_8cpp_source.html">n_queens.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 120</span> {</div>
<div class="line"><span class="lineno"> 121</span> <span class="keyword">const</span> <span class="keywordtype">int</span> n = 4;</div>
<div class="line"><span class="lineno"> 122</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;int, n&gt;</a>, n&gt; board = {</div>
<div class="line"><span class="lineno"> 123</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n&gt;</a>({0, 0, 0, 0}), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n&gt;</a>({0, 0, 0, 0}),</div>
<div class="line"><span class="lineno"> 124</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n&gt;</a>({0, 0, 0, 0}), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n&gt;</a>({0, 0, 0, 0})};</div>
<div class="line"><span class="lineno"> 122</span> std::array&lt;std::array&lt;int, n&gt;, n&gt; board = {</div>
<div class="line"><span class="lineno"> 123</span> std::array&lt;int, n&gt;({0, 0, 0, 0}), std::array&lt;int, n&gt;({0, 0, 0, 0}),</div>
<div class="line"><span class="lineno"> 124</span> std::array&lt;int, n&gt;({0, 0, 0, 0}), std::array&lt;int, n&gt;({0, 0, 0, 0})};</div>
<div class="line"><span class="lineno"> 125</span> </div>
<div class="line"><span class="lineno"> 126</span> backtracking::n_queens::solveNQ&lt;n&gt;(board, 0);</div>
<div class="line"><span class="lineno"> 127</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><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>
</div>
@@ -262,7 +286,7 @@ template&lt;size_t n&gt; </div>
<tr>
<td class="memname">void backtracking::n_queens::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>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>board</em></span></td><td>)</td>
<td class="paramtype">const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>board</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -279,16 +303,17 @@ template&lt;size_t n&gt; </div>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../d4/d3e/n__queens_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../d4/d3e/n__queens_8cpp_source.html">n_queens.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 38</span> {</div>
<div class="line"><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> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 39</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><span class="lineno"> 41</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
<div class="line"><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> &lt;&lt; <span class="stringliteral">&quot;&quot;</span> &lt;&lt; board[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 42</span> std::cout &lt;&lt; <span class="stringliteral">&quot;&quot;</span> &lt;&lt; board[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 43</span> }</div>
<div class="line"><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> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 44</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 45</span> }</div>
<div class="line"><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>
</div>
@@ -303,7 +328,7 @@ template&lt;size_t n&gt; </div>
<tr>
<td class="memname">void backtracking::n_queens::solveNQ </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt;</td> <td class="paramname"><span class="paramname"><em>board</em></span>, </td>
<td class="paramtype">std::array&lt; std::array&lt; int, n &gt;, n &gt;</td> <td class="paramname"><span class="paramname"><em>board</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
@@ -325,6 +350,8 @@ template&lt;size_t n&gt; </div>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../d4/d3e/n__queens_8cpp_source.html#l00091">91</a> of file <a class="el" href="../../d4/d3e/n__queens_8cpp_source.html">n_queens.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 91</span> {</div>
<div class="line"><span class="lineno"> 92</span> <span class="keywordflow">if</span> (col &gt;= n) {</div>
<div class="line"><span class="lineno"> 93</span> printSolution&lt;n&gt;(board);</div>
@@ -347,12 +374,7 @@ template&lt;size_t n&gt; </div>
<div class="line"><span class="lineno"> 110</span> }</div>
<div class="line"><span class="lineno"> 111</span> }</div>
<div class="line"><span class="lineno"> 112</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="../../d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph.svg" width="171" 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><!-- fragment -->
</div>
</div>
</div><!-- contents -->

4
d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph.map
View File

@@ -1,4 +0,0 @@
<map id="backtracking::n_queens::solveNQ" name="backtracking::n_queens::solveNQ">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,165,70"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="54,29,53,19,58,11,69,5,85,3,103,5,113,11,110,16,101,10,85,8,70,10,61,14,58,20,59,28"/>
</map>

1
d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph.md5
View File

@@ -1 +0,0 @@
65d61fc813fdae86573dea9ee0af7760

57
d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph.svg
View File

@@ -1,57 +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 12.1.2 (20240928.0832)
-->
<!-- Title: backtracking::n_queens::solveNQ Pages: 1 -->
<svg width="128pt" height="57pt"
viewBox="0.00 0.00 127.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>backtracking::n_queens::solveNQ</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="119.5,-30.5 0,-30.5 0,0 119.5,0 119.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::n_queens</text>
<text text-anchor="middle" x="59.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::solveNQ</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M38.57,-30.99C34.25,-40.06 41.31,-48.5 59.75,-48.5 69.83,-48.5 76.51,-45.97 79.79,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="83.25,-42.79 80.77,-32.49 76.28,-42.09 83.25,-42.79"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 2.2 KiB

31
d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph_org.svg
View File

@@ -1,31 +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 12.1.2 (20240928.0832)
-->
<!-- Title: backtracking::n_queens::solveNQ Pages: 1 -->
<svg width="128pt" height="57pt"
viewBox="0.00 0.00 127.50 56.50" 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 52.5)">
<title>backtracking::n_queens::solveNQ</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="119.5,-30.5 0,-30.5 0,0 119.5,0 119.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::n_queens</text>
<text text-anchor="middle" x="59.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::solveNQ</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M38.57,-30.99C34.25,-40.06 41.31,-48.5 59.75,-48.5 69.83,-48.5 76.51,-45.97 79.79,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="83.25,-42.79 80.77,-32.49 76.28,-42.09 83.25,-42.79"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 1.4 KiB

228
d4/d3e/n__queens_8cpp_source.html Normal file
View File

@@ -0,0 +1,228 @@
<!-- HTML header for doxygen 1.12.0-->
<!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" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: backtracking/n_queens.cpp Source File</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
<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>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</script>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../doxygen-awesome.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 id="projectrow">
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.12.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<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&amp;dn=expat.txt MIT */
$(function(){initNavTree('d4/d3e/n__queens_8cpp_source.html','../../'); initResizable(true); });
/* @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">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">n_queens.cpp</div></div>
</div><!--header-->
<div class="contents">
<a href="../../d4/d3e/n__queens_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span> </div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include &lt;array&gt;</span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span> </div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../db/dc0/namespacebacktracking.html">backtracking</a> {</div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d3/da1/namespacen__queens.html">n_queens</a> {</div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> n&gt;</div>
<div class="foldopen" id="foldopen00038" data-start="{" data-end="}">
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../d4/d3e/n__queens_8cpp.html#a40ae0c7fd04eb20e7f3bff13fc6a5808"> 38</a></span><span class="keywordtype">void</span> printSolution(<span class="keyword">const</span> std::array&lt;std::array&lt;int, n&gt;, n&gt; &amp;board) {</div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</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 &lt; 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 &lt; n; j++) {</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> std::cout &lt;&lt; <span class="stringliteral">&quot;&quot;</span> &lt;&lt; board[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</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> std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</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>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> </div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> n&gt;</div>
<div class="foldopen" id="foldopen00058" data-start="{" data-end="}">
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../d4/d3e/n__queens_8cpp.html#a5730b6683f6adcf5c5ef75cf53dc7160"> 58</a></span><span class="keywordtype">bool</span> isSafe(<span class="keyword">const</span> std::array&lt;std::array&lt;int, n&gt;, n&gt; &amp;board, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;row,</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;col) {</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 &lt; 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 &gt;= 0 &amp;&amp; j &gt;= 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 &gt;= 0 &amp;&amp; i &lt; 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>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> </div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> n&gt;</div>
<div class="foldopen" id="foldopen00091" data-start="{" data-end="}">
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"><a class="line" href="../../d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb"> 91</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb">solveNQ</a>(std::array&lt;std::array&lt;int, n&gt;, n&gt; board, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;col) {</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keywordflow">if</span> (col &gt;= n) {</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> printSolution&lt;n&gt;(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 &lt; 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&lt;n&gt;(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&lt;n&gt;(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>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span>} <span class="comment">// namespace n_queens</span></div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span>} <span class="comment">// namespace backtracking</span></div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> </div>
<div class="foldopen" id="foldopen00120" data-start="{" data-end="}">
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"><a class="line" href="../../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 120</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</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> std::array&lt;std::array&lt;int, n&gt;, n&gt; board = {</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> std::array&lt;int, n&gt;({0, 0, 0, 0}), std::array&lt;int, n&gt;({0, 0, 0, 0}),</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> std::array&lt;int, n&gt;({0, 0, 0, 0}), std::array&lt;int, n&gt;({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&lt;n&gt;(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>
<div class="ttc" id="an__queens_8cpp_html_a0dbd7af47d87f0b956609fe9e3288ecb"><div class="ttname"><a href="../../d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb">backtracking::n_queens::solveNQ</a></div><div class="ttdeci">void solveNQ(std::array&lt; std::array&lt; int, n &gt;, n &gt; board, const int &amp;col)</div><div class="ttdef"><b>Definition</b> <a href="#l00091">n_queens.cpp:91</a></div></div>
<div class="ttc" id="an__queens_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00120">n_queens.cpp:120</a></div></div>
<div class="ttc" id="anamespacebacktracking_html"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html">backtracking</a></div><div class="ttdoc">for vector container</div></div>
<div class="ttc" id="anamespacen__queens_html"><div class="ttname"><a href="../../d3/da1/namespacen__queens.html">n_queens</a></div><div class="ttdoc">Functions for Eight Queens puzzle.</div></div>
</div><!-- fragment --></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="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a class="el" href="../../d4/d3e/n__queens_8cpp.html">n_queens.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
</ul>
</div>
</body>
</html>