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

Documentation for a8af29bf65

Browse Source
This commit is contained in:
github-actions
2023-01-31 19:52:24 +00:00
parent c33ecc7aac
commit a87e2fa7cb
258 changed files with 4559 additions and 2699 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
d8/d77/namespacemachine__learning.html
View File

@@ -200,9 +200,12 @@ Variables</h2></td></tr>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">A* search algorithm</a> </p>
<p>Machine Learning algorithms.</p>
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
<p>Machine learning algorithms.</p>
<p>A* is an informed search algorithm, or a best-first search, meaning that it is formulated in terms of weighted graphs: starting from a specific starting node of a graph (initial state), it aims to find a path to the given goal node having the smallest cost (least distance travelled, shortest time, etc.). It evaluates by maintaining a tree of paths originating at the start node and extending those paths one edge at a time until it reaches the final state. The weighted edges (or cost) is evaluated on two factors, G score (cost required from starting node or initial state to current state) and H score (cost required from current state to final state). The F(state), then is evaluated as: F(state) = G(state) + H(state).</p>
<p>To solve the given search with shortest cost or path possible is to inspect values having minimum F(state). </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AshishYUO" target="_blank">Ashish Daulatabad</a> for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a></code> function for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></code>, representing <code>EightPuzzle</code> board for <code>assert</code> for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a></code> STL for IO operations for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a></code> STL for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></code> for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set.html">std::set</a></code> STL for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></code> STL</dd></dl>
<p>Machine learning algorithms</p>
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/transform.html">std::transform</a> and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a> for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a> and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html">std::accumulate</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a></p>
<p>Machine learning algorithms </p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ad0bdc88e5f1be47c46c0f0c8ebf754bb" name="ad0bdc88e5f1be47c46c0f0c8ebf754bb"></a>