backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-17 03:51:27 +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

281
da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html
View File

@@ -92,6 +92,7 @@ $(document).ready(function(){initNavTree('da/d02/classmachine__learning_1_1aysta
<div class="header">
<div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#pub-types">Public Types</a> &#124;
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pri-types">Private Types</a> &#124;
<a href="#pri-attribs">Private Attributes</a> &#124;
@@ -106,7 +107,7 @@ $(document).ready(function(){initNavTree('da/d02/classmachine__learning_1_1aysta
<div class="dynheader">
Collaboration diagram for machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.svg" width="182" height="200"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.svg" width="184" height="200"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
@@ -119,14 +120,26 @@ Classes</h2></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Struct that handles all the information related to the current state. <a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-types"></a>
Public Types</h2></td></tr>
<tr class="memitem:ad37c0d6640f887d001dbf562deba4971"><td class="memItemLeft" align="right" valign="top"><a id="ad37c0d6640f887d001dbf562deba4971"></a>
using&#160;</td><td class="memItemRight" valign="bottom"><b>MapOfPuzzleInfoWithPuzzleInfo</b> = <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt;, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt;, <a class="el" href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">comparison_operator</a> &gt;</td></tr>
<tr class="separator:ad37c0d6640f887d001dbf562deba4971"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abb04e9c0f316e6febcd486da47c4b2d0"><td class="memItemLeft" align="right" valign="top"><a id="abb04e9c0f316e6febcd486da47c4b2d0"></a>
using&#160;</td><td class="memItemRight" valign="bottom"><b>MapOfPuzzleInfoWithInteger</b> = <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt;, uint32_t, <a class="el" href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">comparison_operator</a> &gt;</td></tr>
<tr class="separator:abb04e9c0f316e6febcd486da47c4b2d0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acffa24ad24940c421bf6bb77f71a762c"><td class="memItemLeft" align="right" valign="top"><a id="acffa24ad24940c421bf6bb77f71a762c"></a>
using&#160;</td><td class="memItemRight" valign="bottom"><b>SetOfPuzzleInfo</b> = <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set.html">std::set</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt;, <a class="el" href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">comparison_operator</a> &gt;</td></tr>
<tr class="separator:acffa24ad24940c421bf6bb77f71a762c"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:abaff2ea6d309e1133fd95bbd1e39946e"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e">AyStarSearch</a> (const Puzzle &amp;initial, const Puzzle &amp;final)</td></tr>
<tr class="memdesc:abaff2ea6d309e1133fd95bbd1e39946e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Parameterized constructor for <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html" title="A class defining A* search algorithm. for some initial state and final state.">AyStarSearch</a>. <a href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e">More...</a><br /></td></tr>
<tr class="separator:abaff2ea6d309e1133fd95bbd1e39946e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8687882bdb604ab367da6e8fe42a35c9"><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; Puzzle &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a8687882bdb604ab367da6e8fe42a35c9">Solution</a> (<a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> *FinalState, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a>, <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> *, <a class="el" href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">comparison_operator</a> &gt; &amp;parent_of)</td></tr>
<tr class="memdesc:a8687882bdb604ab367da6e8fe42a35c9"><td class="mdescLeft">&#160;</td><td class="mdescRight">A helper solution: launches when a solution for <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html" title="A class defining A* search algorithm. for some initial state and final state.">AyStarSearch</a> is found. <a href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a8687882bdb604ab367da6e8fe42a35c9">More...</a><br /></td></tr>
<tr class="separator:a8687882bdb604ab367da6e8fe42a35c9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:afaeb1cde711f5198dc3dd213dedbd726"><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; Puzzle &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#afaeb1cde711f5198dc3dd213dedbd726">Solution</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt; FinalState, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">MapOfPuzzleInfoWithPuzzleInfo</a> &amp;parent_of)</td></tr>
<tr class="memdesc:afaeb1cde711f5198dc3dd213dedbd726"><td class="mdescLeft">&#160;</td><td class="mdescRight">A helper solution: launches when a solution for <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html" title="A class defining A* search algorithm. for some initial state and final state.">AyStarSearch</a> is found. <a href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#afaeb1cde711f5198dc3dd213dedbd726">More...</a><br /></td></tr>
<tr class="separator:afaeb1cde711f5198dc3dd213dedbd726"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5bb772fd41005fdefa8bd32edbf00cc3"><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; Puzzle &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a5bb772fd41005fdefa8bd32edbf00cc3">a_star_search</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; uint32_t(const Puzzle &amp;, const Puzzle &amp;)&gt; &amp;dist, const uint32_t permissible_depth=30)</td></tr>
<tr class="separator:a5bb772fd41005fdefa8bd32edbf00cc3"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
@@ -139,12 +152,12 @@ typedef struct <a class="el" href="../../da/d70/structmachine__learning_1_1aysta
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:aa2329b2036d458bc803fd62a5545fb0d"><td class="memItemLeft" align="right" valign="top"><a id="aa2329b2036d458bc803fd62a5545fb0d"></a>
<a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a>&#160;</td><td class="memItemRight" valign="bottom"><b>Initial</b></td></tr>
<tr class="separator:aa2329b2036d458bc803fd62a5545fb0d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7f3033a1201a4e35b955d663491869a1"><td class="memItemLeft" align="right" valign="top"><a id="a7f3033a1201a4e35b955d663491869a1"></a>
<a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a>&#160;</td><td class="memItemRight" valign="bottom"><b>Final</b></td></tr>
<tr class="separator:a7f3033a1201a4e35b955d663491869a1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac11d62d01fac136efbd2bace6c55cea5"><td class="memItemLeft" align="right" valign="top"><a id="ac11d62d01fac136efbd2bace6c55cea5"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>Initial</b></td></tr>
<tr class="separator:ac11d62d01fac136efbd2bace6c55cea5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1686cbc0c50ae9e6f949b1e4b46be9ff"><td class="memItemLeft" align="right" valign="top"><a id="a1686cbc0c50ae9e6f949b1e4b46be9ff"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>Final</b></td></tr>
<tr class="separator:a1686cbc0c50ae9e6f949b1e4b46be9ff"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><h3>template&lt;typename Puzzle&gt;<br />
@@ -206,11 +219,10 @@ template&lt;typename Puzzle &gt; </div>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>&#160; {</div>
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>&#160; Initial = <a class="code" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a47b9bc9815a2e7123ac1dc13e5377301">Info</a>(initial);</div>
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>&#160; Final = <a class="code" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a47b9bc9815a2e7123ac1dc13e5377301">Info</a>(<span class="keyword">final</span>);</div>
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>&#160; }</div>
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_ay_star_search_html_a47b9bc9815a2e7123ac1dc13e5377301"><div class="ttname"><a href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a47b9bc9815a2e7123ac1dc13e5377301">machine_learning::aystar_search::AyStarSearch::Info</a></div><div class="ttdeci">struct machine_learning::aystar_search::AyStarSearch::Info Info</div><div class="ttdoc">Struct that handles all the information related to the current state.</div></div>
<div class="fragment"><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>&#160; {</div>
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>&#160; Initial = std::make_shared&lt;Info&gt;(initial);</div>
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>&#160; Final = std::make_shared&lt;Info&gt;(<span class="keyword">final</span>);</div>
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>&#160; }</div>
</div><!-- fragment -->
</div>
</div>
@@ -262,114 +274,103 @@ template&lt;typename Puzzle &gt; </div>
<p>Stores the g_score</p>
<p>Stores the list to explore</p>
<p>Stores the list that are explored</p>
<div class="fragment"><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>&#160; {</div>
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map&lt;Info, Info *, comparison_operator&gt;</a></div>
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>&#160; parent_of; <span class="comment">/// Stores the parent of the states</span></div>
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map&lt;Info, uint32_t, comparison_operator&gt;</a></div>
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>&#160; g_score; <span class="comment">/// Stores the g_score</span></div>
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set.html">std::set&lt;Info, comparison_operator&gt;</a></div>
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>&#160; open_list; <span class="comment">/// Stores the list to explore</span></div>
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set.html">std::set&lt;Info, comparison_operator&gt;</a></div>
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>&#160; closed_list; <span class="comment">/// Stores the list that are explored</span></div>
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>&#160; </div>
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>&#160; <span class="comment">// Before starting the AyStartSearch, initialize the set and maps</span></div>
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>&#160; open_list.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/emplace.html">emplace</a>(Initial);</div>
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>&#160; parent_of[Initial] = <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>&#160; g_score[Initial] = 0;</div>
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>&#160; </div>
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>&#160; <span class="keywordflow">while</span> (!open_list.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/empty.html">empty</a>()) {</div>
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>&#160; <span class="comment">// Iterator for state having having lowest f_score.</span></div>
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>&#160; <span class="keyword">typename</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set.html">std::set&lt;Info, comparison_operator&gt;::iterator</a></div>
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>&#160; it_low_f_score;</div>
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>&#160; uint32_t min_f_score = 1e9;</div>
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">auto</span> iter = open_list.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/begin.html">begin</a>(); iter != open_list.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/end.html">end</a>();</div>
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>&#160; ++iter) {</div>
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>&#160; <span class="comment">// f score here is evaluated by g score (depth) and h score</span></div>
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>&#160; <span class="comment">// (distance between current state and final state)</span></div>
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>&#160; uint32_t f_score = iter-&gt;heuristic_value + iter-&gt;depth;</div>
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>&#160; <span class="keywordflow">if</span> (f_score &lt; min_f_score) {</div>
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>&#160; min_f_score = f_score;</div>
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>&#160; it_low_f_score = iter;</div>
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>&#160; }</div>
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>&#160; }</div>
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>&#160; </div>
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>&#160; <span class="comment">// current_state, stores lowest f score so far for this state.</span></div>
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>&#160; <a class="code" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a47b9bc9815a2e7123ac1dc13e5377301">Info</a> *current_state = <span class="keyword">new</span> <a class="code" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a47b9bc9815a2e7123ac1dc13e5377301">Info</a>(*it_low_f_score);</div>
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>&#160; </div>
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>&#160; <span class="comment">// if this current state is equal to final, return</span></div>
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>&#160; <span class="keywordflow">if</span> (current_state-&gt;state == Final.state) {</div>
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>&#160; <span class="keywordflow">return</span> <a class="code" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a8687882bdb604ab367da6e8fe42a35c9">Solution</a>(current_state, parent_of);</div>
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>&#160; }</div>
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>&#160; <span class="comment">// else remove from open list as visited.</span></div>
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>&#160; open_list.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/erase.html">erase</a>(it_low_f_score);</div>
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>&#160; <span class="comment">// if current_state has exceeded the allowed depth, skip</span></div>
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>&#160; <span class="comment">// neighbor checking</span></div>
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>&#160; <span class="keywordflow">if</span> (current_state-&gt;depth &gt;= permissible_depth) {</div>
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>&#160; <span class="keywordflow">continue</span>;</div>
<div class="fragment"><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>&#160; {</div>
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>&#160; MapOfPuzzleInfoWithPuzzleInfo</div>
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>&#160; parent_of; <span class="comment">/// Stores the parent of the states</span></div>
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>&#160; MapOfPuzzleInfoWithInteger g_score; <span class="comment">/// Stores the g_score</span></div>
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>&#160; SetOfPuzzleInfo open_list; <span class="comment">/// Stores the list to explore</span></div>
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>&#160; SetOfPuzzleInfo closed_list; <span class="comment">/// Stores the list that are explored</span></div>
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>&#160; </div>
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>&#160; <span class="comment">// Before starting the AyStartSearch, initialize the set and maps</span></div>
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>&#160; open_list.emplace(Initial);</div>
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>&#160; parent_of[Initial] = <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>&#160; g_score[Initial] = 0;</div>
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>&#160; </div>
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>&#160; <span class="keywordflow">while</span> (!open_list.empty()) {</div>
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>&#160; <span class="comment">// Iterator for state having having lowest f_score.</span></div>
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>&#160; <span class="keyword">typename</span> SetOfPuzzleInfo::iterator it_low_f_score;</div>
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>&#160; uint32_t min_f_score = 1e9;</div>
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">auto</span> iter = open_list.begin(); iter != open_list.end();</div>
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>&#160; ++iter) {</div>
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>&#160; <span class="comment">// f score here is evaluated by g score (depth) and h score</span></div>
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>&#160; <span class="comment">// (distance between current state and final state)</span></div>
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>&#160; uint32_t f_score = (*iter)-&gt;heuristic_value + (*iter)-&gt;depth;</div>
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>&#160; <span class="keywordflow">if</span> (f_score &lt; min_f_score) {</div>
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>&#160; min_f_score = f_score;</div>
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>&#160; it_low_f_score = iter;</div>
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>&#160; }</div>
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>&#160; }</div>
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>&#160; </div>
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>&#160; <span class="comment">// current_state, stores lowest f score so far for this state.</span></div>
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Info&gt;</a> current_state = *it_low_f_score;</div>
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>&#160; </div>
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>&#160; <span class="comment">// if this current state is equal to final, return</span></div>
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>&#160; <span class="keywordflow">if</span> (*(current_state-&gt;state) == *(Final-&gt;state)) {</div>
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>&#160; <span class="keywordflow">return</span> <a class="code" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#afaeb1cde711f5198dc3dd213dedbd726">Solution</a>(current_state, parent_of);</div>
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>&#160; }</div>
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>&#160; <span class="comment">// Generate all possible moves (neighbors) given the current</span></div>
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>&#160; <span class="comment">// state</span></div>
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Puzzle&gt;</a> total_possible_moves =</div>
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>&#160; current_state-&gt;state.generate_possible_moves();</div>
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>&#160; </div>
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>&#160; <span class="keywordflow">for</span> (Puzzle &amp;neighbor : total_possible_moves) {</div>
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>&#160; <span class="comment">// calculate score of neighbors with respect to</span></div>
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>&#160; <span class="comment">// current_state</span></div>
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>&#160; <a class="code" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a47b9bc9815a2e7123ac1dc13e5377301">Info</a> Neighbor = {neighbor, dist(neighbor, Final.state),</div>
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>&#160; current_state-&gt;depth + 1};</div>
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>&#160; uint32_t temp_g_score = Neighbor.depth;</div>
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>&#160; <span class="comment">// else remove from open list as visited.</span></div>
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>&#160; open_list.erase(it_low_f_score);</div>
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>&#160; <span class="comment">// if current_state has exceeded the allowed depth, skip</span></div>
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>&#160; <span class="comment">// neighbor checking</span></div>
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>&#160; <span class="keywordflow">if</span> (current_state-&gt;depth &gt;= permissible_depth) {</div>
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>&#160; <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>&#160; }</div>
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>&#160; <span class="comment">// Generate all possible moves (neighbors) given the current</span></div>
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>&#160; <span class="comment">// state</span></div>
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Puzzle&gt;</a> total_possible_moves =</div>
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>&#160; current_state-&gt;state-&gt;generate_possible_moves();</div>
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>&#160; </div>
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>&#160; <span class="comment">// Check whether this state is explored.</span></div>
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>&#160; <span class="comment">// If this state is discovered at greater depth, then discard,</span></div>
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>&#160; <span class="comment">// else remove from closed list and explore the node</span></div>
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>&#160; <span class="keyword">auto</span> closed_list_iter = closed_list.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/find.html">find</a>(Neighbor);</div>
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>&#160; <span class="keywordflow">if</span> (closed_list_iter != closed_list.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/end.html">end</a>()) {</div>
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>&#160; <span class="comment">// 1. If state in closed list has higher depth, then remove</span></div>
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>&#160; <span class="comment">// from list since we have found better option,</span></div>
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>&#160; <span class="comment">// 2. Else don&#39;t explore this state.</span></div>
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>&#160; <span class="keywordflow">if</span> (Neighbor.depth &lt; closed_list_iter-&gt;depth) {</div>
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>&#160; closed_list.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/erase.html">erase</a>(closed_list_iter);</div>
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>&#160; <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>&#160; }</div>
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>&#160; }</div>
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>&#160; <span class="keyword">auto</span> neighbor_g_score_iter = g_score.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/find.html">find</a>(Neighbor);</div>
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>&#160; <span class="comment">// if the neighbor is already created and has minimum</span></div>
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>&#160; <span class="comment">// g_score, then update g_score and f_score else insert new</span></div>
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>&#160; <span class="keywordflow">if</span> (neighbor_g_score_iter != g_score.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/end.html">end</a>()) {</div>
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>&#160; <span class="keywordflow">if</span> (neighbor_g_score_iter-&gt;second &gt; temp_g_score) {</div>
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>&#160; neighbor_g_score_iter-&gt;second = temp_g_score;</div>
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>&#160; parent_of[Neighbor] = current_state;</div>
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>&#160; }</div>
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>&#160; g_score[Neighbor] = temp_g_score;</div>
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>&#160; parent_of[Neighbor] = current_state;</div>
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>&#160; }</div>
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>&#160; <span class="comment">// If this is a new state, insert into open_list</span></div>
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>&#160; <span class="comment">// else update if the this state has better g score than</span></div>
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>&#160; <span class="comment">// existing one.</span></div>
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>&#160; <span class="keyword">auto</span> iter = open_list.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/find.html">find</a>(Neighbor);</div>
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>&#160; <span class="keywordflow">if</span> (iter == open_list.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/end.html">end</a>()) {</div>
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>&#160; open_list.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/emplace.html">emplace</a>(Neighbor);</div>
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (iter-&gt;depth &gt; Neighbor.depth) {</div>
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>&#160; open_list.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/erase.html">erase</a>(iter);</div>
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>&#160; open_list.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/emplace.html">emplace</a>(Neighbor);</div>
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>&#160; }</div>
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>&#160; }</div>
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>&#160; closed_list.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/emplace.html">emplace</a>(*current_state);</div>
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>&#160; }</div>
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>&#160; <span class="comment">// Cannot find the solution, return empty vector</span></div>
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>&#160; <span class="keywordflow">return</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Puzzle&gt;</a>(0);</div>
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>&#160; }</div>
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set/begin.html">std::set::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_ay_star_search_html_a8687882bdb604ab367da6e8fe42a35c9"><div class="ttname"><a href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a8687882bdb604ab367da6e8fe42a35c9">machine_learning::aystar_search::AyStarSearch::Solution</a></div><div class="ttdeci">std::vector&lt; Puzzle &gt; Solution(Info *FinalState, const std::map&lt; Info, Info *, comparison_operator &gt; &amp;parent_of)</div><div class="ttdoc">A helper solution: launches when a solution for AyStarSearch is found.</div><div class="ttdef"><b>Definition:</b> a_star_search.cpp:394</div></div>
<div class="ttc" id="aemplace_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set/emplace.html">std::set::emplace</a></div><div class="ttdeci">T emplace(T... args)</div></div>
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set/empty.html">std::set::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set/end.html">std::set::end</a></div><div class="ttdeci">T end(T... args)</div></div>
<div class="ttc" id="aerase_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set/erase.html">std::set::erase</a></div><div class="ttdeci">T erase(T... args)</div></div>
<div class="ttc" id="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set/find.html">std::set::find</a></div><div class="ttdeci">T find(T... args)</div></div>
<div class="ttc" id="amap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a></div></div>
<div class="ttc" id="aset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set.html">std::set</a></div></div>
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>&#160; <span class="keywordflow">for</span> (Puzzle &amp;neighbor : total_possible_moves) {</div>
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>&#160; <span class="comment">// calculate score of neighbors with respect to</span></div>
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>&#160; <span class="comment">// current_state</span></div>
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Info&gt;</a> Neighbor = std::make_shared&lt;Info&gt;(</div>
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>&#160; neighbor, dist(neighbor, *(Final-&gt;state)),</div>
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>&#160; current_state-&gt;depth + 1U);</div>
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>&#160; uint32_t temp_g_score = Neighbor-&gt;depth;</div>
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>&#160; </div>
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>&#160; <span class="comment">// Check whether this state is explored.</span></div>
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>&#160; <span class="comment">// If this state is discovered at greater depth, then discard,</span></div>
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>&#160; <span class="comment">// else remove from closed list and explore the node</span></div>
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>&#160; <span class="keyword">auto</span> closed_list_iter = closed_list.find(Neighbor);</div>
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>&#160; <span class="keywordflow">if</span> (closed_list_iter != closed_list.end()) {</div>
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>&#160; <span class="comment">// 1. If state in closed list has higher depth, then remove</span></div>
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>&#160; <span class="comment">// from list since we have found better option,</span></div>
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>&#160; <span class="comment">// 2. Else don&#39;t explore this state.</span></div>
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>&#160; <span class="keywordflow">if</span> (Neighbor-&gt;depth &lt; (*closed_list_iter)-&gt;depth) {</div>
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>&#160; closed_list.erase(closed_list_iter);</div>
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>&#160; <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>&#160; }</div>
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>&#160; }</div>
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>&#160; <span class="keyword">auto</span> neighbor_g_score_iter = g_score.find(Neighbor);</div>
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>&#160; <span class="comment">// if the neighbor is already created and has minimum</span></div>
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>&#160; <span class="comment">// g_score, then update g_score and f_score else insert new</span></div>
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>&#160; <span class="keywordflow">if</span> (neighbor_g_score_iter != g_score.end()) {</div>
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>&#160; <span class="keywordflow">if</span> (neighbor_g_score_iter-&gt;second &gt; temp_g_score) {</div>
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>&#160; neighbor_g_score_iter-&gt;second = temp_g_score;</div>
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>&#160; parent_of[Neighbor] = current_state;</div>
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>&#160; }</div>
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>&#160; g_score[Neighbor] = temp_g_score;</div>
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>&#160; parent_of[Neighbor] = current_state;</div>
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>&#160; }</div>
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>&#160; <span class="comment">// If this is a new state, insert into open_list</span></div>
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>&#160; <span class="comment">// else update if the this state has better g score than</span></div>
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>&#160; <span class="comment">// existing one.</span></div>
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>&#160; <span class="keyword">auto</span> iter = open_list.find(Neighbor);</div>
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>&#160; <span class="keywordflow">if</span> (iter == open_list.end()) {</div>
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>&#160; open_list.emplace(Neighbor);</div>
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((*iter)-&gt;depth &gt; Neighbor-&gt;depth) {</div>
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>&#160; (*iter)-&gt;depth = Neighbor-&gt;depth;</div>
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>&#160; }</div>
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>&#160; }</div>
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>&#160; closed_list.emplace(current_state);</div>
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>&#160; }</div>
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>&#160; <span class="comment">// Cannot find the solution, return empty vector</span></div>
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>&#160; <span class="keywordflow">return</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Puzzle&gt;</a>(0);</div>
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>&#160; }</div>
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_ay_star_search_html_afaeb1cde711f5198dc3dd213dedbd726"><div class="ttname"><a href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#afaeb1cde711f5198dc3dd213dedbd726">machine_learning::aystar_search::AyStarSearch::Solution</a></div><div class="ttdeci">std::vector&lt; Puzzle &gt; Solution(std::shared_ptr&lt; Info &gt; FinalState, const MapOfPuzzleInfoWithPuzzleInfo &amp;parent_of)</div><div class="ttdoc">A helper solution: launches when a solution for AyStarSearch is found.</div><div class="ttdef"><b>Definition:</b> a_star_search.cpp:405</div></div>
<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -380,8 +381,8 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="a8687882bdb604ab367da6e8fe42a35c9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8687882bdb604ab367da6e8fe42a35c9">&#9670;&nbsp;</a></span>Solution()</h2>
<a id="afaeb1cde711f5198dc3dd213dedbd726"></a>
<h2 class="memtitle"><span class="permalink"><a href="#afaeb1cde711f5198dc3dd213dedbd726">&#9670;&nbsp;</a></span>Solution()</h2>
<div class="memitem">
<div class="memproto">
@@ -394,13 +395,13 @@ template&lt;typename Puzzle &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;Puzzle&gt; <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a>&lt; Puzzle &gt;::<a class="el" href="../../dd/d4f/class_solution.html">Solution</a> </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> *&#160;</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt;&#160;</td>
<td class="paramname"><em>FinalState</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a>, <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> *, <a class="el" href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">comparison_operator</a> &gt; &amp;&#160;</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">MapOfPuzzleInfoWithPuzzleInfo</a> &amp;&#160;</td>
<td class="paramname"><em>parent_of</em>&#160;</td>
</tr>
<tr>
@@ -425,25 +426,25 @@ template&lt;typename Puzzle &gt; </div>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>the list of moves denoting moves from final state to initial state (in reverse) </dd></dl>
<div class="fragment"><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>&#160; {</div>
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>&#160; <span class="comment">// Useful for traversing from final state to current state.</span></div>
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>&#160; <a class="code" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a47b9bc9815a2e7123ac1dc13e5377301">Info</a> *current_state = FinalState;</div>
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>&#160; <span class="comment">/*</span></div>
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>&#160;<span class="comment"> * For storing the solution tree starting from initial state to</span></div>
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>&#160;<span class="comment"> * final state</span></div>
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Puzzle&gt;</a> answer;</div>
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>&#160; <span class="keywordflow">while</span> (current_state != <span class="keyword">nullptr</span>) {</div>
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>&#160; answer.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(current_state-&gt;state);</div>
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>&#160; current_state = parent_of.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/find.html">find</a>(*current_state)-&gt;second;</div>
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>&#160; }</div>
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>&#160; <span class="keywordflow">return</span> answer;</div>
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>&#160; }</div>
<div class="fragment"><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>&#160; {</div>
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>&#160; <span class="comment">// Useful for traversing from final state to current state.</span></div>
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>&#160; <span class="keyword">auto</span> current_state = FinalState;</div>
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>&#160; <span class="comment">/*</span></div>
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>&#160;<span class="comment"> * For storing the solution tree starting from initial state to</span></div>
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>&#160;<span class="comment"> * final state</span></div>
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Puzzle&gt;</a> answer;</div>
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>&#160; <span class="keywordflow">while</span> (current_state != <span class="keyword">nullptr</span>) {</div>
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>&#160; answer.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(*current_state-&gt;state);</div>
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>&#160; current_state = parent_of.find(current_state)-&gt;second;</div>
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>&#160; }</div>
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>&#160; <span class="keywordflow">return</span> answer;</div>
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>&#160; }</div>
<div class="ttc" id="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a8687882bdb604ab367da6e8fe42a35c9_cgraph.svg" width="407" height="88"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_afaeb1cde711f5198dc3dd213dedbd726_cgraph.svg" width="407" height="88"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>

9
da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.js
View File

@@ -3,9 +3,12 @@ var classmachine__learning_1_1aystar__search_1_1_ay_star_search =
[ "comparison_operator", "d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html", "d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator" ],
[ "Info", "da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html", "da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info" ],
[ "Info", "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a47b9bc9815a2e7123ac1dc13e5377301", null ],
[ "MapOfPuzzleInfoWithInteger", "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abb04e9c0f316e6febcd486da47c4b2d0", null ],
[ "MapOfPuzzleInfoWithPuzzleInfo", "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#ad37c0d6640f887d001dbf562deba4971", null ],
[ "SetOfPuzzleInfo", "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#acffa24ad24940c421bf6bb77f71a762c", null ],
[ "AyStarSearch", "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e", null ],
[ "a_star_search", "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a5bb772fd41005fdefa8bd32edbf00cc3", null ],
[ "Solution", "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a8687882bdb604ab367da6e8fe42a35c9", null ],
[ "Final", "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a7f3033a1201a4e35b955d663491869a1", null ],
[ "Initial", "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#aa2329b2036d458bc803fd62a5545fb0d", null ]
[ "Solution", "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#afaeb1cde711f5198dc3dd213dedbd726", null ],
[ "Final", "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a1686cbc0c50ae9e6f949b1e4b46be9ff", null ],
[ "Initial", "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#ac11d62d01fac136efbd2bace6c55cea5", null ]
];

2
da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a5bb772fd41005fdefa8bd32edbf00cc3_cgraph.map
View File

@@ -8,6 +8,6 @@
<area shape="rect" id="node7" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/set/erase.html#" title=" " alt="" coords="257,259,362,285"/>
<area shape="rect" id="node8" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/map/find.html#" title=" " alt="" coords="480,343,583,369"/>
<area shape="rect" id="node9" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/set/find.html#" title=" " alt="" coords="263,360,356,387"/>
<area shape="rect" id="node10" href="$da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a8687882bdb604ab367da6e8fe42a35c9" title="A helper solution: launches when a solution for AyStarSearch is found." alt="" coords="224,411,395,467"/>
<area shape="rect" id="node10" href="$da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#afaeb1cde711f5198dc3dd213dedbd726" title="A helper solution: launches when a solution for AyStarSearch is found." alt="" coords="224,411,395,467"/>
<area shape="rect" id="node11" 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="443,425,620,452"/>
</map>

2
da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a5bb772fd41005fdefa8bd32edbf00cc3_cgraph.md5
View File

@@ -1 +1 @@
8c8c45c919edf5999cede22373099e4c
22d81ef3e73688a898844740f45dacc4

2
da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a5bb772fd41005fdefa8bd32edbf00cc3_cgraph.svg
View File

@@ -143,7 +143,7 @@
<!-- Node10 -->
<g id="node10" class="node">
<title>Node10</title>
<g id="a_node10"><a xlink:href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a8687882bdb604ab367da6e8fe42a35c9" target="_top" xlink:title="A helper solution: launches when a solution for AyStarSearch is found.">
<g id="a_node10"><a xlink:href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#afaeb1cde711f5198dc3dd213dedbd726" target="_top" xlink:title="A helper solution: launches when a solution for AyStarSearch is found.">
<polygon fill="white" stroke="black" points="164,-0.5 164,-41.5 292,-41.5 292,-0.5 164,-0.5"/>
<text text-anchor="start" x="172" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
<text text-anchor="start" x="172" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">_search::AyStarSearch::</text>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 9.5 KiB

After

Width:  |  Height:  |  Size: 9.5 KiB

0
da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a8687882bdb604ab367da6e8fe42a35c9_cgraph.map → da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_afaeb1cde711f5198dc3dd213dedbd726_cgraph.map
View File

0
da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a8687882bdb604ab367da6e8fe42a35c9_cgraph.md5 → da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_afaeb1cde711f5198dc3dd213dedbd726_cgraph.md5
View File

0
da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a8687882bdb604ab367da6e8fe42a35c9_cgraph.svg → da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_afaeb1cde711f5198dc3dd213dedbd726_cgraph.svg
View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.8 KiB

After

Width:  |  Height:  |  Size: 2.8 KiB