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

Documentation for 6376bf46af

Browse Source
This commit is contained in:
github-actions
2023-09-27 18:42:32 +00:00
parent d28eba1fef
commit b5b4d78981
5708 changed files with 52275 additions and 51112 deletions
Download Patch File Download Diff File Expand all files Collapse all files

54
dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html
View File

@@ -3,7 +3,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.7"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: machine_learning::aystar_search::EightPuzzle&lt; N &gt; Class Template Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.7 -->
<!-- Generated by Doxygen 1.9.8 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -117,71 +117,71 @@ Collaboration diagram for machine_learning::aystar_search::EightPuzzle&lt; N &gt
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:aa5c0486c7f29f323a2aced2ab33af420"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">get</a> (size_t i, size_t j) const</td></tr>
<tr class="memitem:aa5c0486c7f29f323a2aced2ab33af420" id="r_aa5c0486c7f29f323a2aced2ab33af420"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">get</a> (size_t i, size_t j) const</td></tr>
<tr class="memdesc:aa5c0486c7f29f323a2aced2ab33af420"><td class="mdescLeft">&#160;</td><td class="mdescRight">get the value from i units from right and j units from left side of the board <br /></td></tr>
<tr class="separator:aa5c0486c7f29f323a2aced2ab33af420"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ade14b0e1a88543b91426e2008e4d0f99"><td class="memItemLeft" align="right" valign="top"><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; uint32_t, N &gt;, N &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99">get_state</a> ()</td></tr>
<tr class="memitem:ade14b0e1a88543b91426e2008e4d0f99" id="r_ade14b0e1a88543b91426e2008e4d0f99"><td class="memItemLeft" align="right" valign="top"><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; uint32_t, N &gt;, N &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99">get_state</a> ()</td></tr>
<tr class="memdesc:ade14b0e1a88543b91426e2008e4d0f99"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the current state of the board. <br /></td></tr>
<tr class="separator:ade14b0e1a88543b91426e2008e4d0f99"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae145ac4a0d2ec58945b58fad3c04f00f"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a> () const</td></tr>
<tr class="memitem:ae145ac4a0d2ec58945b58fad3c04f00f" id="r_ae145ac4a0d2ec58945b58fad3c04f00f"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a> () const</td></tr>
<tr class="memdesc:ae145ac4a0d2ec58945b58fad3c04f00f"><td class="mdescLeft">&#160;</td><td class="mdescRight">returns the size of the <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" title="A class defining EightPuzzle/15-Puzzle game.">EightPuzzle</a> (number of row / column) <br /></td></tr>
<tr class="separator:ae145ac4a0d2ec58945b58fad3c04f00f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3dc09f4742a0e1167ed202f7bf94721b"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">EightPuzzle</a> ()</td></tr>
<tr class="memitem:a3dc09f4742a0e1167ed202f7bf94721b" id="r_a3dc09f4742a0e1167ed202f7bf94721b"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">EightPuzzle</a> ()</td></tr>
<tr class="memdesc:a3dc09f4742a0e1167ed202f7bf94721b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Default constructor for <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" title="A class defining EightPuzzle/15-Puzzle game.">EightPuzzle</a>. <br /></td></tr>
<tr class="separator:a3dc09f4742a0e1167ed202f7bf94721b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab7fd890a7ccf756e4b3313087b76a8c2"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2">EightPuzzle</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; uint32_t, N &gt;, N &gt; &amp;init)</td></tr>
<tr class="memitem:ab7fd890a7ccf756e4b3313087b76a8c2" id="r_ab7fd890a7ccf756e4b3313087b76a8c2"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2">EightPuzzle</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; uint32_t, N &gt;, N &gt; &amp;init)</td></tr>
<tr class="memdesc:ab7fd890a7ccf756e4b3313087b76a8c2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Parameterized Constructor for <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" title="A class defining EightPuzzle/15-Puzzle game.">EightPuzzle</a>. <br /></td></tr>
<tr class="separator:ab7fd890a7ccf756e4b3313087b76a8c2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad45fde095ac00effe1fe00b1d85ff9c7"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7">EightPuzzle</a> (const <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &amp;A)</td></tr>
<tr class="memitem:ad45fde095ac00effe1fe00b1d85ff9c7" id="r_ad45fde095ac00effe1fe00b1d85ff9c7"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7">EightPuzzle</a> (const <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &amp;A)</td></tr>
<tr class="memdesc:ad45fde095ac00effe1fe00b1d85ff9c7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Copy constructor. <br /></td></tr>
<tr class="separator:ad45fde095ac00effe1fe00b1d85ff9c7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af22395b8e9e04222aa93a329523faef9"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9">EightPuzzle</a> (const <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &amp;&amp;A) noexcept</td></tr>
<tr class="memitem:af22395b8e9e04222aa93a329523faef9" id="r_af22395b8e9e04222aa93a329523faef9"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9">EightPuzzle</a> (const <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &amp;&amp;A) noexcept</td></tr>
<tr class="memdesc:af22395b8e9e04222aa93a329523faef9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Move constructor. <br /></td></tr>
<tr class="separator:af22395b8e9e04222aa93a329523faef9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a194c2973b51a5467fc17064a4ea4e6f9"><td class="memItemLeft" align="right" valign="top"><a id="a194c2973b51a5467fc17064a4ea4e6f9" name="a194c2973b51a5467fc17064a4ea4e6f9"></a>
<tr class="memitem:a194c2973b51a5467fc17064a4ea4e6f9" id="r_a194c2973b51a5467fc17064a4ea4e6f9"><td class="memItemLeft" align="right" valign="top"><a id="a194c2973b51a5467fc17064a4ea4e6f9" name="a194c2973b51a5467fc17064a4ea4e6f9"></a>
&#160;</td><td class="memItemRight" valign="bottom"><b>~EightPuzzle</b> ()=default</td></tr>
<tr class="memdesc:a194c2973b51a5467fc17064a4ea4e6f9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Destructor of <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" title="A class defining EightPuzzle/15-Puzzle game.">EightPuzzle</a>. <br /></td></tr>
<tr class="separator:a194c2973b51a5467fc17064a4ea4e6f9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a467e722dc1fcc82bfb4cef55744e04e2"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2">operator=</a> (const <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a> &amp;A)</td></tr>
<tr class="memitem:a467e722dc1fcc82bfb4cef55744e04e2" id="r_a467e722dc1fcc82bfb4cef55744e04e2"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2">operator=</a> (const <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a> &amp;A)</td></tr>
<tr class="memdesc:a467e722dc1fcc82bfb4cef55744e04e2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Copy assignment operator. <br /></td></tr>
<tr class="separator:a467e722dc1fcc82bfb4cef55744e04e2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1802cf6197a255055cb734d626abc101"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101">operator=</a> (<a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a> &amp;&amp;A) noexcept</td></tr>
<tr class="memitem:a1802cf6197a255055cb734d626abc101" id="r_a1802cf6197a255055cb734d626abc101"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101">operator=</a> (<a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a> &amp;&amp;A) noexcept</td></tr>
<tr class="memdesc:a1802cf6197a255055cb734d626abc101"><td class="mdescLeft">&#160;</td><td class="mdescRight">Move assignment operator. <br /></td></tr>
<tr class="separator:a1802cf6197a255055cb734d626abc101"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a26a976171392d257ca0f814ed73e0658"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658">generate_possible_moves</a> ()</td></tr>
<tr class="memitem:a26a976171392d257ca0f814ed73e0658" id="r_a26a976171392d257ca0f814ed73e0658"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658">generate_possible_moves</a> ()</td></tr>
<tr class="memdesc:a26a976171392d257ca0f814ed73e0658"><td class="mdescLeft">&#160;</td><td class="mdescRight">Find all possible states after processing all possible moves, given the current state of the puzzle. <br /></td></tr>
<tr class="separator:a26a976171392d257ca0f814ed73e0658"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa17e0227321b109ed91e156ac1332915"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915">operator==</a> (const <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &amp;check) const</td></tr>
<tr class="memitem:aa17e0227321b109ed91e156ac1332915" id="r_aa17e0227321b109ed91e156ac1332915"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915">operator==</a> (const <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &amp;check) const</td></tr>
<tr class="memdesc:aa17e0227321b109ed91e156ac1332915"><td class="mdescLeft">&#160;</td><td class="mdescRight">check whether two boards are equal <br /></td></tr>
<tr class="separator:aa17e0227321b109ed91e156ac1332915"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a64815f10cf9fb9fdb4cc92731ccf10ba"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba">operator&lt;</a> (const <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &amp;check) const</td></tr>
<tr class="memitem:a64815f10cf9fb9fdb4cc92731ccf10ba" id="r_a64815f10cf9fb9fdb4cc92731ccf10ba"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba">operator&lt;</a> (const <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &amp;check) const</td></tr>
<tr class="memdesc:a64815f10cf9fb9fdb4cc92731ccf10ba"><td class="mdescLeft">&#160;</td><td class="mdescRight">check whether one board is lexicographically smaller <br /></td></tr>
<tr class="separator:a64815f10cf9fb9fdb4cc92731ccf10ba"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af778034b2942ecac6df1e9ec8b5412ee"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee">operator&lt;=</a> (const <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &amp;check) const</td></tr>
<tr class="memitem:af778034b2942ecac6df1e9ec8b5412ee" id="r_af778034b2942ecac6df1e9ec8b5412ee"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee">operator&lt;=</a> (const <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &amp;check) const</td></tr>
<tr class="memdesc:af778034b2942ecac6df1e9ec8b5412ee"><td class="mdescLeft">&#160;</td><td class="mdescRight">check whether one board is lexicographically smaller or equal <br /></td></tr>
<tr class="separator:af778034b2942ecac6df1e9ec8b5412ee"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
Private Member Functions</h2></td></tr>
<tr class="memitem:a94f794bf44f424b1b0ca6ef9f4f6ebd3"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint32_t, uint32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3">find_zero</a> ()</td></tr>
<tr class="memitem:a94f794bf44f424b1b0ca6ef9f4f6ebd3" id="r_a94f794bf44f424b1b0ca6ef9f4f6ebd3"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint32_t, uint32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3">find_zero</a> ()</td></tr>
<tr class="memdesc:a94f794bf44f424b1b0ca6ef9f4f6ebd3"><td class="mdescLeft">&#160;</td><td class="mdescRight">A helper array to evaluate the next state from current state;. <br /></td></tr>
<tr class="separator:a94f794bf44f424b1b0ca6ef9f4f6ebd3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a48d054230468b79037964f474d842b6e"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e">in_range</a> (const uint32_t value) const</td></tr>
<tr class="memitem:a48d054230468b79037964f474d842b6e" id="r_a48d054230468b79037964f474d842b6e"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e">in_range</a> (const uint32_t value) const</td></tr>
<tr class="memdesc:a48d054230468b79037964f474d842b6e"><td class="mdescLeft">&#160;</td><td class="mdescRight">check whether the index value is bounded within the puzzle area <br /></td></tr>
<tr class="separator:a48d054230468b79037964f474d842b6e"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:a35d8f14ca17218f236c09ff9ad864f9c"><td class="memItemLeft" align="right" valign="top"><a id="a35d8f14ca17218f236c09ff9ad864f9c" name="a35d8f14ca17218f236c09ff9ad864f9c"></a>
<tr class="memitem:a35d8f14ca17218f236c09ff9ad864f9c" id="r_a35d8f14ca17218f236c09ff9ad864f9c"><td class="memItemLeft" align="right" valign="top"><a id="a35d8f14ca17218f236c09ff9ad864f9c" name="a35d8f14ca17218f236c09ff9ad864f9c"></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; uint32_t, N &gt;, N &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>board</b></td></tr>
<tr class="separator:a35d8f14ca17218f236c09ff9ad864f9c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa73857052e69b86347859d9148933f71"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int8_t, int8_t &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71">moves</a></td></tr>
<tr class="memitem:aa73857052e69b86347859d9148933f71" id="r_aa73857052e69b86347859d9148933f71"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int8_t, int8_t &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71">moves</a></td></tr>
<tr class="memdesc:aa73857052e69b86347859d9148933f71"><td class="mdescLeft">&#160;</td><td class="mdescRight">N x N array to store the current state of the Puzzle. <br /></td></tr>
<tr class="separator:aa73857052e69b86347859d9148933f71"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="friends" name="friends"></a>
Friends</h2></td></tr>
<tr class="memitem:a9517e162e2988f7db052296bd550a742"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a9517e162e2988f7db052296bd550a742">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;op, const <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &amp;SomeState)</td></tr>
<tr class="memitem:a9517e162e2988f7db052296bd550a742" id="r_a9517e162e2988f7db052296bd550a742"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a9517e162e2988f7db052296bd550a742">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;op, const <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &amp;SomeState)</td></tr>
<tr class="memdesc:a9517e162e2988f7db052296bd550a742"><td class="mdescLeft">&#160;</td><td class="mdescRight">friend operator to display EightPuzzle&lt;&gt; <br /></td></tr>
<tr class="separator:a9517e162e2988f7db052296bd550a742"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -907,11 +907,17 @@ template&lt;size_t N = 3&gt; </div>
<div class="line"> 0}}</div>
</div><!-- fragment -->
<p>N x N array to store the current state of the Puzzle. </p>
<div class="fragment"><div class="line"><span class="lineno"> 64</span> {</div>
<div class="line"><span class="lineno"> 65</span> {0, 1},</div>
<div class="line"><span class="lineno"> 66</span> {1, 0},</div>
<div class="line"><span class="lineno"> 67</span> {0, -1},</div>
<div class="line"><span class="lineno"> 68</span> {-1,</div>
<div class="line"><span class="lineno"> 69</span> 0}}; <span class="comment">/// A helper array to evaluate the next state from current state;</span></div>
</div><!-- fragment -->
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>machine_learning/a_star_search.cpp</li>
<li>machine_learning/<b>a_star_search.cpp</b></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
@@ -919,7 +925,7 @@ template&lt;size_t N = 3&gt; </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="navelem"><b>aystar_search</b></li><li class="navelem"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.7 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
</ul>
</div>
</body>

2
dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph.map
View File

@@ -1,5 +1,5 @@
<map id="machine_learning::aystar_search::EightPuzzle::operator=" name="machine_learning::aystar_search::EightPuzzle::operator=">
<area shape="rect" id="Node000001" title="Move assignment operator." alt="" coords="5,5,214,46"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="262,13,341,39"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="214,23,247,23,247,28,214,28"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="214,23,246,23,246,28,214,28"/>
</map>

6
dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: machine_learning::aystar_search::EightPuzzle::operator= Pages: 1 -->
<svg width="260pt" height="39pt"
@@ -41,8 +41,8 @@
<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="M156.7,-15.25C165.14,-15.25 173.44,-15.25 181.14,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="180.93,-18.75 190.93,-15.25 180.93,-11.75 180.93,-18.75"/>
<path fill="none" stroke="#63b8ff" d="M156.7,-15.25C164.94,-15.25 173.06,-15.25 180.6,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="180.41,-18.75 190.41,-15.25 180.41,-11.75 180.41,-18.75"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.7 KiB

After

Width:  |  Height:  |  Size: 2.7 KiB

6
dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: machine_learning::aystar_search::EightPuzzle::operator= Pages: 1 -->
<svg width="260pt" height="39pt"
@@ -31,8 +31,8 @@
<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="M156.7,-15.25C165.14,-15.25 173.44,-15.25 181.14,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="180.93,-18.75 190.93,-15.25 180.93,-11.75 180.93,-18.75"/>
<path fill="none" stroke="#63b8ff" d="M156.7,-15.25C164.94,-15.25 173.06,-15.25 180.6,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="180.41,-18.75 190.41,-15.25 180.41,-11.75 180.41,-18.75"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.9 KiB

After

Width:  |  Height:  |  Size: 1.9 KiB

8
dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph.map
View File

@@ -1,11 +1,11 @@
<map id="machine_learning::aystar_search::EightPuzzle::generate_possible_moves" name="machine_learning::aystar_search::EightPuzzle::generate_possible_moves">
<area shape="rect" id="Node000001" title="Find all possible states after processing all possible moves, given the current state of the puzzle." alt="" coords="5,81,209,137"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/emplace_back.html#" title=" " alt="" coords="272,5,448,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="166,78,256,41,282,33,284,38,258,46,168,83"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="166,78,256,41,282,33,283,38,258,46,168,83"/>
<area shape="rect" id="Node000003" href="$dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3" title="A helper array to evaluate the next state from current state;." alt="" coords="257,55,463,96"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="209,93,242,88,242,94,209,98"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="209,93,241,88,242,94,209,98"/>
<area shape="rect" id="Node000004" href="$dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e" title="check whether the index value is bounded within the puzzle area" alt="" coords="259,121,461,161"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="209,119,244,123,243,129,209,124"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="209,119,243,123,243,129,209,124"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="321,185,399,211"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="169,135,258,170,307,184,305,189,256,175,167,140"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="169,135,258,170,306,184,305,189,256,175,167,140"/>
</map>

18
dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: machine_learning::aystar_search::EightPuzzle::generate_possible_moves Pages: 1 -->
<svg width="351pt" height="162pt"
@@ -42,8 +42,8 @@
<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="M120.95,-97.95C141.18,-107.28 165.73,-117.84 188.5,-125.62 194.86,-127.8 201.6,-129.84 208.34,-131.72"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="207.3,-135.33 217.87,-134.53 209.11,-128.57 207.3,-135.33"/>
<path fill="none" stroke="#63b8ff" d="M120.95,-97.95C141.18,-107.28 165.73,-117.84 188.5,-125.62 194.71,-127.75 201.28,-129.74 207.86,-131.58"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="206.84,-134.94 217.41,-134.14 208.65,-128.17 206.84,-134.94"/>
</a>
</g>
</g>
@@ -61,8 +61,8 @@
<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="M152.75,-86.69C160.9,-87.77 169.23,-88.88 177.5,-89.98"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="176.93,-93.57 187.3,-91.42 177.85,-86.63 176.93,-93.57"/>
<path fill="none" stroke="#63b8ff" d="M152.75,-86.69C160.71,-87.75 168.85,-88.83 176.94,-89.91"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="176.43,-93.37 186.8,-91.22 177.35,-86.43 176.43,-93.37"/>
</a>
</g>
</g>
@@ -80,8 +80,8 @@
<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="M152.75,-66.97C161.27,-65.88 170,-64.76 178.65,-63.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="179.05,-67 188.53,-62.26 178.16,-60.06 179.05,-67"/>
<path fill="none" stroke="#63b8ff" d="M152.75,-66.97C161.18,-65.89 169.81,-64.79 178.36,-63.69"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="178.55,-67.2 188.03,-62.46 177.66,-60.25 178.55,-67.2"/>
</a>
</g>
</g>
@@ -98,8 +98,8 @@
<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="M122.06,-55.3C142.09,-46.29 166.18,-36.16 188.5,-28.62 200.39,-24.61 213.59,-21.03 225.62,-18.09"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="226.34,-21.28 235.27,-15.57 224.73,-14.47 226.34,-21.28"/>
<path fill="none" stroke="#63b8ff" d="M122.06,-55.3C142.09,-46.29 166.18,-36.16 188.5,-28.62 200.27,-24.65 213.32,-21.1 225.25,-18.18"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="225.87,-21.63 234.79,-15.92 224.26,-14.82 225.87,-21.63"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.0 KiB

After

Width:  |  Height:  |  Size: 6.0 KiB

18
dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: machine_learning::aystar_search::EightPuzzle::generate_possible_moves Pages: 1 -->
<svg width="351pt" height="162pt"
@@ -32,8 +32,8 @@
<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="M120.95,-97.95C141.18,-107.28 165.73,-117.84 188.5,-125.62 194.86,-127.8 201.6,-129.84 208.34,-131.72"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="207.3,-135.33 217.87,-134.53 209.11,-128.57 207.3,-135.33"/>
<path fill="none" stroke="#63b8ff" d="M120.95,-97.95C141.18,-107.28 165.73,-117.84 188.5,-125.62 194.71,-127.75 201.28,-129.74 207.86,-131.58"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="206.84,-134.94 217.41,-134.14 208.65,-128.17 206.84,-134.94"/>
</a>
</g>
</g>
@@ -51,8 +51,8 @@
<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="M152.75,-86.69C160.9,-87.77 169.23,-88.88 177.5,-89.98"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="176.93,-93.57 187.3,-91.42 177.85,-86.63 176.93,-93.57"/>
<path fill="none" stroke="#63b8ff" d="M152.75,-86.69C160.71,-87.75 168.85,-88.83 176.94,-89.91"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="176.43,-93.37 186.8,-91.22 177.35,-86.43 176.43,-93.37"/>
</a>
</g>
</g>
@@ -70,8 +70,8 @@
<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="M152.75,-66.97C161.27,-65.88 170,-64.76 178.65,-63.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="179.05,-67 188.53,-62.26 178.16,-60.06 179.05,-67"/>
<path fill="none" stroke="#63b8ff" d="M152.75,-66.97C161.18,-65.89 169.81,-64.79 178.36,-63.69"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="178.55,-67.2 188.03,-62.46 177.66,-60.25 178.55,-67.2"/>
</a>
</g>
</g>
@@ -88,8 +88,8 @@
<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="M122.06,-55.3C142.09,-46.29 166.18,-36.16 188.5,-28.62 200.39,-24.61 213.59,-21.03 225.62,-18.09"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="226.34,-21.28 235.27,-15.57 224.73,-14.47 226.34,-21.28"/>
<path fill="none" stroke="#63b8ff" d="M122.06,-55.3C142.09,-46.29 166.18,-36.16 188.5,-28.62 200.27,-24.65 213.32,-21.1 225.25,-18.18"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="225.87,-21.63 234.79,-15.92 224.26,-14.82 225.87,-21.63"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.2 KiB

After

Width:  |  Height:  |  Size: 5.2 KiB

2
dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph.map
View File

@@ -1,5 +1,5 @@
<map id="machine_learning::aystar_search::EightPuzzle::get" name="machine_learning::aystar_search::EightPuzzle::get">
<area shape="rect" id="Node000001" title="get the value from i units from right and j units from left side of the board" alt="" coords="5,5,177,46"/>
<area shape="rect" id="Node000002" href="$dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e" title="check whether the index value is bounded within the puzzle area" alt="" coords="225,5,427,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="177,23,210,23,210,28,177,28"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="177,23,209,23,209,28,177,28"/>
</map>

6
dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: machine_learning::aystar_search::EightPuzzle::get Pages: 1 -->
<svg width="324pt" height="39pt"
@@ -42,8 +42,8 @@
<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="M128.61,-15.25C136.65,-15.25 144.99,-15.25 153.32,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="153.23,-18.75 163.23,-15.25 153.23,-11.75 153.23,-18.75"/>
<path fill="none" stroke="#63b8ff" d="M128.61,-15.25C136.47,-15.25 144.62,-15.25 152.75,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.71,-18.75 162.71,-15.25 152.71,-11.75 152.71,-18.75"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.0 KiB

After

Width:  |  Height:  |  Size: 3.0 KiB

6
dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: machine_learning::aystar_search::EightPuzzle::get Pages: 1 -->
<svg width="324pt" height="39pt"
@@ -32,8 +32,8 @@
<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="M128.61,-15.25C136.65,-15.25 144.99,-15.25 153.32,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="153.23,-18.75 163.23,-15.25 153.23,-11.75 153.23,-18.75"/>
<path fill="none" stroke="#63b8ff" d="M128.61,-15.25C136.47,-15.25 144.62,-15.25 152.75,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.71,-18.75 162.71,-15.25 152.71,-11.75 152.71,-18.75"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.2 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB