backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-24 10:33:10 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 88394665b4

Browse Source
This commit is contained in:
github-actions
2021-08-27 17:55:41 +00:00
parent 5906d777f6
commit ded30c8174
228 changed files with 5650 additions and 5607 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
d8/d77/namespacemachine__learning.html
View File

@@ -196,7 +196,7 @@ Variables</h2></td></tr>
<p>Machine Learning algorithms.</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">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/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>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">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>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a8b3b06a63bd16b91237c85a295309774"></a>