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

Documentation for 98b2609e1b

Browse Source
This commit is contained in:
github-actions
2020-06-22 11:54:53 +00:00
parent 42b56da681
commit bd6b24ec15
270 changed files with 1317 additions and 1299 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
d8/d01/struct_item-members.html
View File

@@ -104,7 +104,7 @@ $(document).ready(function(){initNavTree('db/d66/struct_item.html','../../'); in
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated on Sun Jun 21 2020 19:43:37 for Algorithms_in_C++ by
<li class="footer">Generated on Mon Jun 22 2020 11:53:40 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d8/d10/structlist.html
View File

@@ -161,7 +161,7 @@ struct <a class="el" href="../../d8/d10/structlist.html">list</a> *&#160;</td><t
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/d10/structlist.html">list</a></li>
<li class="footer">Generated on Sun Jun 21 2020 19:43:37 for Algorithms_in_C++ by
<li class="footer">Generated on Mon Jun 22 2020 11:53:40 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d8/d13/bubble__sort_8cpp.html
View File

@@ -130,7 +130,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>main</b> ()</td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d8/d13/bubble__sort_8cpp.html">bubble_sort.cpp</a></li>
<li class="footer">Generated on Sun Jun 21 2020 19:43:37 for Algorithms_in_C++ by
<li class="footer">Generated on Mon Jun 22 2020 11:53:40 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d8/d38/queue_8h_source.html
View File

@@ -235,7 +235,7 @@ $(document).ready(function(){initNavTree('d8/d38/queue_8h_source.html','../../')
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><b>queue.h</b></li>
<li class="footer">Generated on Sun Jun 21 2020 19:43:35 for Algorithms_in_C++ by
<li class="footer">Generated on Mon Jun 22 2020 11:53:38 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d8/d38/structquery-members.html
View File

@@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('dd/d1b/structquery.html','../../'); in
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated on Sun Jun 21 2020 19:43:37 for Algorithms_in_C++ by
<li class="footer">Generated on Mon Jun 22 2020 11:53:40 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d8/d53/modular__inverse__fermat__little__theorem_8cpp.html
View File

@@ -271,7 +271,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html">modular_inverse_fermat_little_theorem.cpp</a></li>
<li class="footer">Generated on Sun Jun 21 2020 19:43:36 for Algorithms_in_C++ by
<li class="footer">Generated on Mon Jun 22 2020 11:53:38 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d8/d55/class_cycle_check-members.html
View File

@@ -109,7 +109,7 @@ $(document).ready(function(){initNavTree('d3/dbb/class_cycle_check.html','../../
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated on Sun Jun 21 2020 19:43:37 for Algorithms_in_C++ by
<li class="footer">Generated on Mon Jun 22 2020 11:53:40 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d8/d6c/line__segment__intersection_8cpp.html
View File

@@ -174,7 +174,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_e3380d2178455503f266746fb14246a5.html">geometry</a></li><li class="navelem"><a class="el" href="../../d8/d6c/line__segment__intersection_8cpp.html">line_segment_intersection.cpp</a></li>
<li class="footer">Generated on Sun Jun 21 2020 19:43:35 for Algorithms_in_C++ by
<li class="footer">Generated on Mon Jun 22 2020 11:53:38 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

288
d8/d77/namespacemachine__learning.html
View File

@@ -162,46 +162,46 @@ Functions</h2></td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>&#160; {</div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>&#160; <span class="keywordtype">int</span> num_samples = X.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); <span class="comment">// number of rows</span></div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>&#160; <span class="keywordtype">int</span> num_features = X[0].<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); <span class="comment">// number of columns</span></div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>&#160; <span class="keywordtype">int</span> num_out = W-&gt;<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); <span class="comment">// output matrix size</span></div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>&#160; <span class="keywordtype">int</span> R = num_out &gt;&gt; 2, iter = 0;</div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>&#160; <span class="keywordtype">double</span> alpha = 1.f;</div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>&#160; </div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; D(num_out);</div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; num_out; i++) D[i] = std::valarray&lt;double&gt;(num_out);</div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>&#160; </div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>&#160; <span class="keywordtype">double</span> dmin = 1.f; <span class="comment">// average minimum distance of all samples</span></div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>&#160; <span class="keywordtype">double</span> past_dmin = 1.f; <span class="comment">// average minimum distance of all samples</span></div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>&#160; <span class="keywordtype">double</span> dmin_ratio = 1.f; <span class="comment">// change per step</span></div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>&#160; </div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>&#160; <span class="comment">// Loop alpha from 1 to slpha_min</span></div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>&#160; <span class="keywordflow">for</span> (; alpha &gt; 0 &amp;&amp; dmin_ratio &gt; 1e-5; alpha -= 1e-4, iter++) {</div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>&#160; <span class="comment">// Loop for each sample pattern in the data set</span></div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> sample = 0; sample &lt; num_samples; sample++) {</div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>&#160; <span class="comment">// update weights for the current input pattern sample</span></div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>&#160; dmin += <a class="code" href="../../d8/d77/namespacemachine__learning.html#ac4010fe3a52a74e8b5b1aaadfe38b46f">update_weights</a>(X[sample], W, &amp;D, alpha, R);</div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>&#160; }</div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>&#160; </div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>&#160; <span class="comment">// every 100th iteration, reduce the neighborhood range</span></div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>&#160; <span class="keywordflow">if</span> (iter % 300 == 0 &amp;&amp; R &gt; 1)</div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>&#160; R--;</div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>&#160; </div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>&#160; dmin /= num_samples;</div>
<div class="fragment"><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>&#160; {</div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>&#160; <span class="keywordtype">int</span> num_samples = X.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); <span class="comment">// number of rows</span></div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>&#160; <span class="keywordtype">int</span> num_features = X[0].<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); <span class="comment">// number of columns</span></div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>&#160; <span class="keywordtype">int</span> num_out = W-&gt;<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); <span class="comment">// output matrix size</span></div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>&#160; <span class="keywordtype">int</span> R = num_out &gt;&gt; 2, iter = 0;</div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>&#160; <span class="keywordtype">double</span> alpha = 1.f;</div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>&#160; </div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; D(num_out);</div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; num_out; i++) D[i] = std::valarray&lt;double&gt;(num_out);</div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>&#160; </div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>&#160; <span class="keywordtype">double</span> dmin = 1.f; <span class="comment">// average minimum distance of all samples</span></div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>&#160; <span class="keywordtype">double</span> past_dmin = 1.f; <span class="comment">// average minimum distance of all samples</span></div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>&#160; <span class="keywordtype">double</span> dmin_ratio = 1.f; <span class="comment">// change per step</span></div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>&#160; </div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>&#160; <span class="comment">// Loop alpha from 1 to slpha_min</span></div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>&#160; <span class="keywordflow">for</span> (; alpha &gt; 0 &amp;&amp; dmin_ratio &gt; 1e-5; alpha -= 1e-4, iter++) {</div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>&#160; <span class="comment">// Loop for each sample pattern in the data set</span></div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> sample = 0; sample &lt; num_samples; sample++) {</div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>&#160; <span class="comment">// update weights for the current input pattern sample</span></div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>&#160; dmin += <a class="code" href="../../d8/d77/namespacemachine__learning.html#ac4010fe3a52a74e8b5b1aaadfe38b46f">update_weights</a>(X[sample], W, &amp;D, alpha, R);</div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>&#160; }</div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>&#160; </div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>&#160; <span class="comment">// every 100th iteration, reduce the neighborhood range</span></div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>&#160; <span class="keywordflow">if</span> (iter % 300 == 0 &amp;&amp; R &gt; 1)</div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>&#160; R--;</div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>&#160; </div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>&#160; <span class="comment">// termination condition variable -&gt; % change in minimum distance</span></div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>&#160; dmin_ratio = (past_dmin - dmin) / past_dmin;</div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>&#160; <span class="keywordflow">if</span> (dmin_ratio &lt; 0)</div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>&#160; dmin_ratio = 1.f;</div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>&#160; past_dmin = dmin;</div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>&#160; </div>
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;iter: &quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot;\t alpha: &quot;</span> &lt;&lt; alpha &lt;&lt; <span class="stringliteral">&quot;\t R: &quot;</span> &lt;&lt; R</div>
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>&#160; &lt;&lt; <span class="stringliteral">&quot;\t d_min: &quot;</span> &lt;&lt; dmin_ratio &lt;&lt; <span class="stringliteral">&quot;\r&quot;</span>;</div>
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>&#160; }</div>
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>&#160; </div>
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>&#160; <a class="codeRef" 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"><a name="l00300"></a><span class="lineno"> 300</span>&#160;}</div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>&#160; dmin /= num_samples;</div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>&#160; </div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>&#160; <span class="comment">// termination condition variable -&gt; % change in minimum distance</span></div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>&#160; dmin_ratio = (past_dmin - dmin) / past_dmin;</div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>&#160; <span class="keywordflow">if</span> (dmin_ratio &lt; 0)</div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>&#160; dmin_ratio = 1.f;</div>
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>&#160; past_dmin = dmin;</div>
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>&#160; </div>
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;iter: &quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot;\t alpha: &quot;</span> &lt;&lt; alpha &lt;&lt; <span class="stringliteral">&quot;\t R: &quot;</span> &lt;&lt; R</div>
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>&#160; &lt;&lt; <span class="stringliteral">&quot;\t d_min: &quot;</span> &lt;&lt; dmin_ratio &lt;&lt; <span class="stringliteral">&quot;\r&quot;</span>;</div>
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>&#160; }</div>
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>&#160; </div>
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>&#160; <a class="codeRef" 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"><a name="l00302"></a><span class="lineno"> 302</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -318,52 +318,52 @@ Here is the call graph for this function:</div>
<dl class="section return"><dt>Returns</dt><dd>0 if all ok </dd>
<dd>
-1 if file creation failed </dd></dl>
<div class="fragment"><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160; {</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> fp(fname);</div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; <span class="keywordflow">if</span> (!fp) { <span class="comment">// error with fopen</span></div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160; <span class="keywordtype">char</span> msg[120];</div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fprintf.html">std::snprintf</a>(msg, <span class="keyword">sizeof</span>(msg), <span class="stringliteral">&quot;File error (%s): &quot;</span>, fname);</div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/perror.html">std::perror</a>(msg);</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>&#160; <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>&#160; }</div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>&#160; </div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>&#160; <span class="comment">// neighborhood range</span></div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>&#160; <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> R = 1;</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>&#160; </div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; W.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) { <span class="comment">// for each x</span></div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; W[0].<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); j++) { <span class="comment">// for each y</span></div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>&#160; <span class="keywordtype">double</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">distance</a> = 0.f;</div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>&#160; </div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>&#160; <span class="keywordtype">int</span> from_x = std::max&lt;int&gt;(0, i - R);</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>&#160; <span class="keywordtype">int</span> to_x = std::min&lt;int&gt;(W.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(), i + R + 1);</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>&#160; <span class="keywordtype">int</span> from_y = std::max&lt;int&gt;(0, j - R);</div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>&#160; <span class="keywordtype">int</span> to_y = std::min&lt;int&gt;(W[0].size(), j + R + 1);</div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>&#160; <span class="keywordtype">int</span> l, m;</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160;<span class="preprocessor">#ifdef _OPENMP</span></div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>&#160;<span class="preprocessor">#pragma omp parallel for reduction(+ : distance)</span></div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>&#160; <span class="keywordflow">for</span> (l = from_x; l &lt; to_x; l++) { <span class="comment">// scan neighborhoor in x</span></div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>&#160; <span class="keywordflow">for</span> (m = from_y; m &lt; to_y; m++) { <span class="comment">// scan neighborhood in y</span></div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>&#160; <span class="keyword">auto</span> d = W[i][j] - W[l][m];</div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>&#160; <span class="keywordtype">double</span> d2 = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(d, 2).sum();</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">distance</a> += <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(d2);</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160; <span class="comment">// distance += d2;</span></div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160; }</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>&#160; }</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>&#160; </div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">distance</a> /= R * R; <span class="comment">// mean distance from neighbors</span></div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>&#160; fp &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">distance</a>; <span class="comment">// print the mean separation</span></div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>&#160; <span class="keywordflow">if</span> (j &lt; W[0].size() - 1) { <span class="comment">// if not the last column</span></div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>&#160; fp &lt;&lt; <span class="charliteral">&#39;,&#39;</span>; <span class="comment">// suffix comma</span></div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>&#160; }</div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>&#160; }</div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>&#160; <span class="keywordflow">if</span> (i &lt; W.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - 1) <span class="comment">// if not the last row</span></div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>&#160; fp &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>; <span class="comment">// start a new line</span></div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>&#160; }</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>&#160; </div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>&#160; fp.close();</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160;}</div>
<div class="fragment"><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; {</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> fp(fname);</div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>&#160; <span class="keywordflow">if</span> (!fp) { <span class="comment">// error with fopen</span></div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>&#160; <span class="keywordtype">char</span> msg[120];</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fprintf.html">std::snprintf</a>(msg, <span class="keyword">sizeof</span>(msg), <span class="stringliteral">&quot;File error (%s): &quot;</span>, fname);</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/perror.html">std::perror</a>(msg);</div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>&#160; <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>&#160; }</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>&#160; </div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>&#160; <span class="comment">// neighborhood range</span></div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>&#160; <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> R = 1;</div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>&#160; </div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; W.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) { <span class="comment">// for each x</span></div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; W[0].<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); j++) { <span class="comment">// for each y</span></div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>&#160; <span class="keywordtype">double</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">distance</a> = 0.f;</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>&#160; </div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>&#160; <span class="keywordtype">int</span> from_x = std::max&lt;int&gt;(0, i - R);</div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>&#160; <span class="keywordtype">int</span> to_x = std::min&lt;int&gt;(W.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(), i + R + 1);</div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>&#160; <span class="keywordtype">int</span> from_y = std::max&lt;int&gt;(0, j - R);</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160; <span class="keywordtype">int</span> to_y = std::min&lt;int&gt;(W[0].size(), j + R + 1);</div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>&#160; <span class="keywordtype">int</span> l, m;</div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>&#160;<span class="preprocessor">#ifdef _OPENMP</span></div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>&#160;<span class="preprocessor">#pragma omp parallel for reduction(+ : distance)</span></div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>&#160; <span class="keywordflow">for</span> (l = from_x; l &lt; to_x; l++) { <span class="comment">// scan neighborhoor in x</span></div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>&#160; <span class="keywordflow">for</span> (m = from_y; m &lt; to_y; m++) { <span class="comment">// scan neighborhood in y</span></div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>&#160; <span class="keyword">auto</span> d = W[i][j] - W[l][m];</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160; <span class="keywordtype">double</span> d2 = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(d, 2).sum();</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">distance</a> += <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(d2);</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>&#160; <span class="comment">// distance += d2;</span></div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>&#160; }</div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>&#160; }</div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>&#160; </div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">distance</a> /= R * R; <span class="comment">// mean distance from neighbors</span></div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>&#160; fp &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">distance</a>; <span class="comment">// print the mean separation</span></div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>&#160; <span class="keywordflow">if</span> (j &lt; W[0].size() - 1) { <span class="comment">// if not the last column</span></div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>&#160; fp &lt;&lt; <span class="charliteral">&#39;,&#39;</span>; <span class="comment">// suffix comma</span></div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>&#160; }</div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>&#160; }</div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>&#160; <span class="keywordflow">if</span> (i &lt; W.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - 1) <span class="comment">// if not the last row</span></div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>&#160; fp &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>; <span class="comment">// start a new line</span></div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>&#160; }</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160; </div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160; fp.close();</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -525,62 +525,62 @@ Here is the call graph for this function:</div>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>minimum distance of sample and trained weights </dd></dl>
<div class="fragment"><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>&#160; {</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160; <span class="keywordtype">int</span> x, y;</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160; <span class="keywordtype">int</span> num_out_x = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(W-&gt;<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()); <span class="comment">// output nodes - in X</span></div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>&#160; <span class="keywordtype">int</span> num_out_y = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(W[0][0].<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()); <span class="comment">// output nodes - in Y</span></div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160; <span class="keywordtype">int</span> num_features = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(W[0][0][0].<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()); <span class="comment">// features = in Z</span></div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160; <span class="keywordtype">double</span> d_min = 0.f;</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160; </div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160;<span class="preprocessor">#ifdef _OPENMP</span></div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>&#160;<span class="preprocessor">#pragma omp for</span></div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>&#160; <span class="comment">// step 1: for each output point</span></div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>&#160; <span class="keywordflow">for</span> (x = 0; x &lt; num_out_x; x++) {</div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>&#160; <span class="keywordflow">for</span> (y = 0; y &lt; num_out_y; y++) {</div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>&#160; (*D)[x][y] = 0.f;</div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>&#160; <span class="comment">// compute Euclidian distance of each output</span></div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>&#160; <span class="comment">// point from the current sample</span></div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>&#160; <span class="keyword">auto</span> d = ((*W)[x][y] - X);</div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>&#160; (*D)[x][y] = (d * d).sum();</div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>&#160; (*D)[x][y] = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>((*D)[x][y]);</div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>&#160; }</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>&#160; }</div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>&#160; </div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>&#160; <span class="comment">// step 2: get closest node i.e., node with snallest Euclidian distance</span></div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160; <span class="comment">// to the current pattern</span></div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>&#160; <span class="keywordtype">int</span> d_min_x, d_min_y;</div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>&#160; <a class="code" href="../../d9/d66/group__machine__learning.html#gab53c14440b2b2dd3172c66afc5c2f63f">get_min_2d</a>(*D, &amp;d_min, &amp;d_min_x, &amp;d_min_y);</div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>&#160; </div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>&#160; <span class="comment">// step 3a: get the neighborhood range</span></div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>&#160; <span class="keywordtype">int</span> from_x = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(0, d_min_x - R);</div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>&#160; <span class="keywordtype">int</span> to_x = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(num_out_x, d_min_x + R + 1);</div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>&#160; <span class="keywordtype">int</span> from_y = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(0, d_min_y - R);</div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>&#160; <span class="keywordtype">int</span> to_y = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(num_out_y, d_min_y + R + 1);</div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>&#160; </div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>&#160; <span class="comment">// step 3b: update the weights of nodes in the</span></div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>&#160; <span class="comment">// neighborhood</span></div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160;<span class="preprocessor">#ifdef _OPENMP</span></div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>&#160;<span class="preprocessor">#pragma omp for</span></div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>&#160; <span class="keywordflow">for</span> (x = from_x; x &lt; to_x; x++) {</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160; <span class="keywordflow">for</span> (y = from_y; y &lt; to_y; y++) {</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160; <span class="comment">/* you can enable the following normalization if needed.</span></div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160;<span class="comment"> personally, I found it detrimental to convergence */</span></div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>&#160; <span class="comment">// const double s2pi = sqrt(2.f * M_PI);</span></div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>&#160; <span class="comment">// double normalize = 1.f / (alpha * s2pi);</span></div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>&#160; </div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>&#160; <span class="comment">/* apply scaling inversely proportional to distance from the</span></div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>&#160;<span class="comment"> current node */</span></div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>&#160; <span class="keywordtype">double</span> d2 =</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>&#160; (d_min_x - x) * (d_min_x - x) + (d_min_y - y) * (d_min_y - y);</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>&#160; <span class="keywordtype">double</span> scale_factor = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a>(-d2 / (2.<a class="code" href="../../d4/d32/fibonacci__fast_8cpp.html#a3ba232425d45f9e9c0b87a8cf7ab69d9">f</a> * alpha * alpha));</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>&#160; </div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>&#160; (*W)[x][y] += (X - (*W)[x][y]) * alpha * scale_factor;</div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>&#160; }</div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>&#160; }</div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>&#160; <span class="keywordflow">return</span> d_min;</div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>&#160;}</div>
<div class="fragment"><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160; {</div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>&#160; <span class="keywordtype">int</span> x, y;</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160; <span class="keywordtype">int</span> num_out_x = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(W-&gt;<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()); <span class="comment">// output nodes - in X</span></div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160; <span class="keywordtype">int</span> num_out_y = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(W[0][0].<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()); <span class="comment">// output nodes - in Y</span></div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160; <span class="keywordtype">int</span> num_features = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(W[0][0][0].<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()); <span class="comment">// features = in Z</span></div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160; <span class="keywordtype">double</span> d_min = 0.f;</div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>&#160; </div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>&#160;<span class="preprocessor">#ifdef _OPENMP</span></div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>&#160;<span class="preprocessor">#pragma omp for</span></div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>&#160; <span class="comment">// step 1: for each output point</span></div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>&#160; <span class="keywordflow">for</span> (x = 0; x &lt; num_out_x; x++) {</div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>&#160; <span class="keywordflow">for</span> (y = 0; y &lt; num_out_y; y++) {</div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>&#160; (*D)[x][y] = 0.f;</div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>&#160; <span class="comment">// compute Euclidian distance of each output</span></div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>&#160; <span class="comment">// point from the current sample</span></div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>&#160; <span class="keyword">auto</span> d = ((*W)[x][y] - X);</div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>&#160; (*D)[x][y] = (d * d).sum();</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>&#160; (*D)[x][y] = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>((*D)[x][y]);</div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>&#160; }</div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>&#160; }</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160; </div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>&#160; <span class="comment">// step 2: get closest node i.e., node with snallest Euclidian distance</span></div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>&#160; <span class="comment">// to the current pattern</span></div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>&#160; <span class="keywordtype">int</span> d_min_x, d_min_y;</div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>&#160; <a class="code" href="../../d9/d66/group__machine__learning.html#gab53c14440b2b2dd3172c66afc5c2f63f">get_min_2d</a>(*D, &amp;d_min, &amp;d_min_x, &amp;d_min_y);</div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>&#160; </div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>&#160; <span class="comment">// step 3a: get the neighborhood range</span></div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>&#160; <span class="keywordtype">int</span> from_x = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(0, d_min_x - R);</div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>&#160; <span class="keywordtype">int</span> to_x = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(num_out_x, d_min_x + R + 1);</div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>&#160; <span class="keywordtype">int</span> from_y = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(0, d_min_y - R);</div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>&#160; <span class="keywordtype">int</span> to_y = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(num_out_y, d_min_y + R + 1);</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>&#160; </div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160; <span class="comment">// step 3b: update the weights of nodes in the</span></div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>&#160; <span class="comment">// neighborhood</span></div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>&#160;<span class="preprocessor">#ifdef _OPENMP</span></div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>&#160;<span class="preprocessor">#pragma omp for</span></div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160; <span class="keywordflow">for</span> (x = from_x; x &lt; to_x; x++) {</div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160; <span class="keywordflow">for</span> (y = from_y; y &lt; to_y; y++) {</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>&#160; <span class="comment">/* you can enable the following normalization if needed.</span></div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>&#160;<span class="comment"> personally, I found it detrimental to convergence */</span></div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>&#160; <span class="comment">// const double s2pi = sqrt(2.f * M_PI);</span></div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>&#160; <span class="comment">// double normalize = 1.f / (alpha * s2pi);</span></div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>&#160; </div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>&#160; <span class="comment">/* apply scaling inversely proportional to distance from the</span></div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>&#160;<span class="comment"> current node */</span></div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>&#160; <span class="keywordtype">double</span> d2 =</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>&#160; (d_min_x - x) * (d_min_x - x) + (d_min_y - y) * (d_min_y - y);</div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>&#160; <span class="keywordtype">double</span> scale_factor = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a>(-d2 / (2.<a class="code" href="../../d4/d32/fibonacci__fast_8cpp.html#a3ba232425d45f9e9c0b87a8cf7ab69d9">f</a> * alpha * alpha));</div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>&#160; </div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>&#160; (*W)[x][y] += (X - (*W)[x][y]) * alpha * scale_factor;</div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>&#160; }</div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>&#160; }</div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>&#160; <span class="keywordflow">return</span> d_min;</div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -597,8 +597,8 @@ Here is the call graph for this function:</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 class="ttdoc">STL class.</div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
<div class="ttc" id="adistance_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/distance.html">std::distance</a></div><div class="ttdeci">T distance(T... args)</div></div>
<div class="ttc" id="anamespacemachine__learning_html_ac4010fe3a52a74e8b5b1aaadfe38b46f"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ac4010fe3a52a74e8b5b1aaadfe38b46f">machine_learning::update_weights</a></div><div class="ttdeci">double update_weights(const std::valarray&lt; double &gt; &amp;X, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt;&gt;&gt; *W, std::vector&lt; std::valarray&lt; double &gt;&gt; *D, double alpha, int R)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:191</div></div>
<div class="ttc" id="agroup__machine__learning_html_gab53c14440b2b2dd3172c66afc5c2f63f"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gab53c14440b2b2dd3172c66afc5c2f63f">get_min_2d</a></div><div class="ttdeci">void get_min_2d(const std::vector&lt; std::valarray&lt; double &gt;&gt; &amp;X, double *val, int *x_idx, int *y_idx)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:97</div></div>
<div class="ttc" id="anamespacemachine__learning_html_ac4010fe3a52a74e8b5b1aaadfe38b46f"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ac4010fe3a52a74e8b5b1aaadfe38b46f">machine_learning::update_weights</a></div><div class="ttdeci">double update_weights(const std::valarray&lt; double &gt; &amp;X, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt;&gt;&gt; *W, std::vector&lt; std::valarray&lt; double &gt;&gt; *D, double alpha, int R)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:193</div></div>
<div class="ttc" id="agroup__machine__learning_html_gab53c14440b2b2dd3172c66afc5c2f63f"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gab53c14440b2b2dd3172c66afc5c2f63f">get_min_2d</a></div><div class="ttdeci">void get_min_2d(const std::vector&lt; std::valarray&lt; double &gt;&gt; &amp;X, double *val, int *x_idx, int *y_idx)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:99</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="afprintf_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/c/fprintf.html">std::snprintf</a></div><div class="ttdeci">T snprintf(T... args)</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
@@ -617,7 +617,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></li>
<li class="footer">Generated on Sun Jun 21 2020 19:43:38 for Algorithms_in_C++ by
<li class="footer">Generated on Mon Jun 22 2020 11:53:41 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d8/d8a/exponential__search_8cpp.html
View File

@@ -295,7 +295,7 @@ template&lt;class Type &gt; </div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../d8/d8a/exponential__search_8cpp.html">exponential_search.cpp</a></li>
<li class="footer">Generated on Sun Jun 21 2020 19:43:37 for Algorithms_in_C++ by
<li class="footer">Generated on Mon Jun 22 2020 11:53:39 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d8/d8e/struct_node-members.html
View File

@@ -108,7 +108,7 @@ $(document).ready(function(){initNavTree('db/d8b/struct_node.html','../../'); in
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated on Sun Jun 21 2020 19:43:37 for Algorithms_in_C++ by
<li class="footer">Generated on Mon Jun 22 2020 11:53:40 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d8/d9b/classgraph-members.html
View File

@@ -115,7 +115,7 @@ $(document).ready(function(){initNavTree('dd/d9b/classgraph.html','../../'); ini
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated on Sun Jun 21 2020 19:43:37 for Algorithms_in_C++ by
<li class="footer">Generated on Mon Jun 22 2020 11:53:40 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d8/dab/classstatistics_1_1stats__computer2.html
View File

@@ -330,7 +330,7 @@ template&lt;typename T &gt; </div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d2/dcf/namespacestatistics.html">statistics</a></li><li class="navelem"><a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a></li>
<li class="footer">Generated on Sun Jun 21 2020 19:43:38 for Algorithms_in_C++ by
<li class="footer">Generated on Mon Jun 22 2020 11:53:41 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d8/db9/structcompare-members.html
View File

@@ -103,7 +103,7 @@ $(document).ready(function(){initNavTree('d1/db3/structcompare.html','../../');
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated on Sun Jun 21 2020 19:43:37 for Algorithms_in_C++ by
<li class="footer">Generated on Mon Jun 22 2020 11:53:40 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d8/dc8/struct_point.html
View File

@@ -212,7 +212,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../..
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/dc8/struct_point.html">Point</a></li>
<li class="footer">Generated on Sun Jun 21 2020 19:43:37 for Algorithms_in_C++ by
<li class="footer">Generated on Mon Jun 22 2020 11:53:40 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d8/dcc/namespacestd.html
View File

@@ -2725,7 +2725,7 @@ T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_b
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/dcc/namespacestd.html">std</a></li>
<li class="footer">Generated on Sun Jun 21 2020 19:43:38 for Algorithms_in_C++ by
<li class="footer">Generated on Mon Jun 22 2020 11:53:41 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d8/ddf/sieve__of__eratosthenes_8cpp.html
View File

@@ -298,7 +298,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html">sieve_of_eratosthenes.cpp</a></li>
<li class="footer">Generated on Sun Jun 21 2020 19:43:36 for Algorithms_in_C++ by
<li class="footer">Generated on Mon Jun 22 2020 11:53:38 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d8/dee/avltree_8cpp.html
View File

@@ -743,7 +743,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d8/dee/avltree_8cpp.html">avltree.cpp</a></li>
<li class="footer">Generated on Sun Jun 21 2020 19:43:35 for Algorithms_in_C++ by
<li class="footer">Generated on Mon Jun 22 2020 11:53:38 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>