mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-07-11 22:46:11 +08:00
Documentation for 341ed50da8
This commit is contained in:
github-actions
@@ -2,8 +2,8 @@
|
||||
<html xmlns="http://www.w3.org/1999/xhtml">
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
||||
<meta name="generator" content="Doxygen 1.9.1"/>
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
||||
<meta name="generator" content="Doxygen 1.9.2"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: machine_learning::aystar_search::AyStarSearch< Puzzle > Class Template Reference</title>
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
@@ -17,9 +17,9 @@
|
||||
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||||
<script type="text/javascript" src="../../search/search.js"></script>
|
||||
<script type="text/x-mathjax-config">
|
||||
MathJax.Hub.Config({
|
||||
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||||
jax: ["input/TeX","output/HTML-CSS"],
|
||||
MathJax.Hub.Config({
|
||||
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||||
jax: ["input/TeX","output/HTML-CSS"],
|
||||
});
|
||||
</script>
|
||||
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||||
@@ -32,8 +32,7 @@
|
||||
<tbody>
|
||||
<tr style="height: 56px;">
|
||||
<td id="projectalign" style="padding-left: 0.5em;">
|
||||
<div id="projectname">Algorithms_in_C++
|
||||
 <span id="projectnumber">1.0.0</span>
|
||||
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
||||
</td>
|
||||
@@ -42,21 +41,22 @@
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.9.1 -->
|
||||
<!-- Generated by Doxygen 1.9.2 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search','.html');
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
|
||||
/* @license-end */
|
||||
</script>
|
||||
<script type="text/javascript" src="../../menudata.js"></script>
|
||||
<script type="text/javascript" src="../../menu.js"></script>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(function() {
|
||||
initMenu('../../',true,false,'search.php','Search');
|
||||
$(document).ready(function() { init_search(); });
|
||||
});
|
||||
/* @license-end */</script>
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="main-nav"></div>
|
||||
</div><!-- top -->
|
||||
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||||
@@ -70,7 +70,7 @@ $(function() {
|
||||
</div>
|
||||
</div>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(document).ready(function(){initNavTree('da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html','../../'); initResizable(); });
|
||||
/* @license-end */
|
||||
</script>
|
||||
@@ -97,21 +97,14 @@ $(document).ready(function(){initNavTree('da/d02/classmachine__learning_1_1aysta
|
||||
<a href="#pri-types">Private Types</a> |
|
||||
<a href="#pri-attribs">Private Attributes</a> |
|
||||
<a href="../../da/df3/classmachine__learning_1_1aystar__search_1_1_ay_star_search-members.html">List of all members</a> </div>
|
||||
<div class="headertitle">
|
||||
<div class="title">machine_learning::aystar_search::AyStarSearch< Puzzle > Class Template Reference</div> </div>
|
||||
<div class="headertitle"><div class="title">machine_learning::aystar_search::AyStarSearch< Puzzle > Class Template Reference</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>A class defining <a href="https://en.wikipedia.org/wiki/A*_search_algorithm">A* search algorithm</a>. for some initial state and final state.
|
||||
<p>A class defining <a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">A* search algorithm</a>. for some initial state and final state.
|
||||
<a href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#details">More...</a></p>
|
||||
<div class="dynheader">
|
||||
Collaboration diagram for machine_learning::aystar_search::AyStarSearch< Puzzle >:</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="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">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
|
||||
Classes</h2></td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">comparison_operator</a></td></tr>
|
||||
<tr class="memdesc:"><td class="mdescLeft"> </td><td class="mdescRight">Custom comparator for open_list. <a href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html#details">More...</a><br /></td></tr>
|
||||
@@ -120,62 +113,60 @@ Classes</h2></td></tr>
|
||||
<tr class="memdesc:"><td class="mdescLeft"> </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"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-types"></a>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-types" name="pub-types"></a>
|
||||
Public Types</h2></td></tr>
|
||||
<tr class="memitem:ad37c0d6640f887d001dbf562deba4971"><td class="memItemLeft" align="right" valign="top"><a id="ad37c0d6640f887d001dbf562deba4971"></a>
|
||||
<tr class="memitem:ad37c0d6640f887d001dbf562deba4971"><td class="memItemLeft" align="right" valign="top"><a id="ad37c0d6640f887d001dbf562deba4971" name="ad37c0d6640f887d001dbf562deba4971"></a>
|
||||
using </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>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</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="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</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> ></td></tr>
|
||||
<tr class="separator:ad37c0d6640f887d001dbf562deba4971"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:abb04e9c0f316e6febcd486da47c4b2d0"><td class="memItemLeft" align="right" valign="top"><a id="abb04e9c0f316e6febcd486da47c4b2d0"></a>
|
||||
<tr class="memitem:abb04e9c0f316e6febcd486da47c4b2d0"><td class="memItemLeft" align="right" valign="top"><a id="abb04e9c0f316e6febcd486da47c4b2d0" name="abb04e9c0f316e6febcd486da47c4b2d0"></a>
|
||||
using </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>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>< <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> >, 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> ></td></tr>
|
||||
<tr class="separator:abb04e9c0f316e6febcd486da47c4b2d0"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:acffa24ad24940c421bf6bb77f71a762c"><td class="memItemLeft" align="right" valign="top"><a id="acffa24ad24940c421bf6bb77f71a762c"></a>
|
||||
<tr class="memitem:acffa24ad24940c421bf6bb77f71a762c"><td class="memItemLeft" align="right" valign="top"><a id="acffa24ad24940c421bf6bb77f71a762c" name="acffa24ad24940c421bf6bb77f71a762c"></a>
|
||||
using </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>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</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> ></td></tr>
|
||||
<tr class="separator:acffa24ad24940c421bf6bb77f71a762c"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
|
||||
<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:abaff2ea6d309e1133fd95bbd1e39946e"><td class="memItemLeft" align="right" valign="top"> </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 &initial, const Puzzle &final)</td></tr>
|
||||
<tr class="memdesc:abaff2ea6d309e1133fd95bbd1e39946e"><td class="mdescLeft"> </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"> </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>< Puzzle > </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>< <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">MapOfPuzzleInfoWithPuzzleInfo</a> &parent_of)</td></tr>
|
||||
<tr class="memdesc:afaeb1cde711f5198dc3dd213dedbd726"><td class="mdescLeft"> </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"> </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>< Puzzle > </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>< uint32_t(const Puzzle &, const Puzzle &)> &dist, const uint32_t permissible_depth=30)</td></tr>
|
||||
<tr class="separator:a5bb772fd41005fdefa8bd32edbf00cc3"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a0a26aa9ad3d73707370d9fe83707aca4"><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>< Puzzle > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4">Solution</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</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">MapOfPuzzleInfoWithPuzzleInfo</a> &parent_of)</td></tr>
|
||||
<tr class="memdesc:a0a26aa9ad3d73707370d9fe83707aca4"><td class="mdescLeft"> </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#a0a26aa9ad3d73707370d9fe83707aca4">More...</a><br /></td></tr>
|
||||
<tr class="separator:a0a26aa9ad3d73707370d9fe83707aca4"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a48284e156fdd48fd0c41008c7e48f201"><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>< Puzzle > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201">a_star_search</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>< uint32_t(const Puzzle &, const Puzzle &)> &dist, const uint32_t permissible_depth=30)</td></tr>
|
||||
<tr class="separator:a48284e156fdd48fd0c41008c7e48f201"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-types"></a>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-types" name="pri-types"></a>
|
||||
Private Types</h2></td></tr>
|
||||
<tr class="memitem:a47b9bc9815a2e7123ac1dc13e5377301"><td class="memItemLeft" align="right" valign="top"><a id="a47b9bc9815a2e7123ac1dc13e5377301"></a>
|
||||
typedef struct <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">machine_learning::aystar_search::AyStarSearch::Info</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a47b9bc9815a2e7123ac1dc13e5377301">Info</a></td></tr>
|
||||
<tr class="memitem:a47b9bc9815a2e7123ac1dc13e5377301"><td class="memItemLeft" align="right" valign="top"><a id="a47b9bc9815a2e7123ac1dc13e5377301" name="a47b9bc9815a2e7123ac1dc13e5377301"></a>
|
||||
typedef struct <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">machine_learning::aystar_search::AyStarSearch::Info</a> </td><td class="memItemRight" valign="bottom"><b>Info</b></td></tr>
|
||||
<tr class="memdesc:a47b9bc9815a2e7123ac1dc13e5377301"><td class="mdescLeft"> </td><td class="mdescRight">Struct that handles all the information related to the current state. <br /></td></tr>
|
||||
<tr class="separator:a47b9bc9815a2e7123ac1dc13e5377301"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
|
||||
<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:ac11d62d01fac136efbd2bace6c55cea5"><td class="memItemLeft" align="right" valign="top"><a id="ac11d62d01fac136efbd2bace6c55cea5"></a>
|
||||
<tr class="memitem:ac11d62d01fac136efbd2bace6c55cea5"><td class="memItemLeft" align="right" valign="top"><a id="ac11d62d01fac136efbd2bace6c55cea5" name="ac11d62d01fac136efbd2bace6c55cea5"></a>
|
||||
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>< <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> > </td><td class="memItemRight" valign="bottom"><b>Initial</b></td></tr>
|
||||
<tr class="separator:ac11d62d01fac136efbd2bace6c55cea5"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a1686cbc0c50ae9e6f949b1e4b46be9ff"><td class="memItemLeft" align="right" valign="top"><a id="a1686cbc0c50ae9e6f949b1e4b46be9ff"></a>
|
||||
<tr class="memitem:a1686cbc0c50ae9e6f949b1e4b46be9ff"><td class="memItemLeft" align="right" valign="top"><a id="a1686cbc0c50ae9e6f949b1e4b46be9ff" name="a1686cbc0c50ae9e6f949b1e4b46be9ff"></a>
|
||||
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>< <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> > </td><td class="memItemRight" valign="bottom"><b>Final</b></td></tr>
|
||||
<tr class="separator:a1686cbc0c50ae9e6f949b1e4b46be9ff"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><h3>template<typename Puzzle><br />
|
||||
class machine_learning::aystar_search::AyStarSearch< Puzzle ></h3>
|
||||
|
||||
<p>A class defining <a href="https://en.wikipedia.org/wiki/A*_search_algorithm">A* search algorithm</a>. for some initial state and final state. </p>
|
||||
<p><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> class is defined as the informed search algorithm that is formulated in terms of weighted graphs: starting from a specific starting node of a graph (initial state), it aims to find a path to the given goal node having the smallest cost (least distance travelled, shortest time, etc.) The weighted edges (or cost) is evaluated on two factors, G score (cost required from starting node or initial state to current state) and H score (cost required from current state to final state). The <code>F(state)</code>, then is evaluated as: <code>F(state) = G(state) + H(state)</code>. The best search would be the final state having minimum <code>F(state)</code> value </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<div class="textblock"><div class="compoundTemplParams">template<typename Puzzle><br />
|
||||
class machine_learning::aystar_search::AyStarSearch< Puzzle ></div><p >A class defining <a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">A* search algorithm</a>. for some initial state and final state. </p>
|
||||
<p ><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> class is defined as the informed search algorithm that is formulated in terms of weighted graphs: starting from a specific starting node of a graph (initial state), it aims to find a path to the given goal node having the smallest cost (least distance travelled, shortest time, etc.) The weighted edges (or cost) is evaluated on two factors, G score (cost required from starting node or initial state to current state) and H score (cost required from current state to final state). The <code>F(state)</code>, then is evaluated as: <code>F(state) = G(state) + H(state)</code>. The best search would be the final state having minimum <code>F(state)</code> value </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">Puzzle</td><td>denotes the puzzle or problem involving initial state and final state to be solved by A* search. </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section note"><dt>Note</dt><dd>1. The algorithm is referred from pesudocode from <a href="https://en.wikipedia.org/wiki/A*_search_algorithm">Wikipedia page</a> as is.<ol type="1">
|
||||
<dl class="section note"><dt>Note</dt><dd>1. The algorithm is referred from pesudocode from <a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">Wikipedia page</a> as is.<ol type="1">
|
||||
<li>For <code><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></code> to work, the definitions for template Puzzle is compulsory. a. Comparison operator for template Puzzle (<code><</code>, <code>==</code>, and <code><=</code>) b. <code>generate_possible_moves()</code> </li>
|
||||
</ol>
|
||||
</dd></dl>
|
||||
</div><h2 class="groupheader">Constructor & Destructor Documentation</h2>
|
||||
<a id="abaff2ea6d309e1133fd95bbd1e39946e"></a>
|
||||
<a id="abaff2ea6d309e1133fd95bbd1e39946e" name="abaff2ea6d309e1133fd95bbd1e39946e"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#abaff2ea6d309e1133fd95bbd1e39946e">◆ </a></span>AyStarSearch()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
@@ -219,16 +210,16 @@ template<typename Puzzle > </div>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  {</div>
|
||||
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  Initial = std::make_shared<Info>(initial);</div>
|
||||
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  Final = std::make_shared<Info>(<span class="keyword">final</span>);</div>
|
||||
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  }</div>
|
||||
<div class="fragment"><div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> {</div>
|
||||
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> Initial = std::make_shared<Info>(initial);</div>
|
||||
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> Final = std::make_shared<Info>(<span class="keyword">final</span>);</div>
|
||||
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<h2 class="groupheader">Member Function Documentation</h2>
|
||||
<a id="a5bb772fd41005fdefa8bd32edbf00cc3"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a5bb772fd41005fdefa8bd32edbf00cc3">◆ </a></span>a_star_search()</h2>
|
||||
<a id="a48284e156fdd48fd0c41008c7e48f201" name="a48284e156fdd48fd0c41008c7e48f201"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a48284e156fdd48fd0c41008c7e48f201">◆ </a></span>a_star_search()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
@@ -239,7 +230,7 @@ template<typename Puzzle > </div>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><Puzzle> <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a>< Puzzle >::a_star_search </td>
|
||||
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< Puzzle > <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a>< Puzzle >::a_star_search </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>< uint32_t(const Puzzle &, const Puzzle &)> & </td>
|
||||
<td class="paramname"><em>dist</em>, </td>
|
||||
@@ -262,7 +253,7 @@ template<typename Puzzle > </div>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Main algorithm for finding <code>FinalState</code>, given the <code>InitialState</code> </p><dl class="params"><dt>Parameters</dt><dd>
|
||||
<p >Main algorithm for finding <code>FinalState</code>, given the <code>InitialState</code> </p><dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">dist</td><td>the heuristic finction, defined by the user </td></tr>
|
||||
<tr><td class="paramname">permissible_depth</td><td>the depth at which the A* search discards searching for solution </td></tr>
|
||||
@@ -270,119 +261,119 @@ template<typename Puzzle > </div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>List of moves from Final state to initial state, if evaluated, else returns an empty array </dd></dl>
|
||||
<p>Stores the parent of the states</p>
|
||||
<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="l00431"></a><span class="lineno"> 431</span>  {</div>
|
||||
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  MapOfPuzzleInfoWithPuzzleInfo</div>
|
||||
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  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>  MapOfPuzzleInfoWithInteger g_score; <span class="comment">/// Stores the g_score</span></div>
|
||||
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  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>  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>  </div>
|
||||
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <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>  open_list.emplace(Initial);</div>
|
||||
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  parent_of[Initial] = <span class="keyword">nullptr</span>;</div>
|
||||
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  g_score[Initial] = 0;</div>
|
||||
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  </div>
|
||||
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="keywordflow">while</span> (!open_list.empty()) {</div>
|
||||
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <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>  <span class="keyword">typename</span> SetOfPuzzleInfo::iterator it_low_f_score;</div>
|
||||
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  uint32_t min_f_score = 1e9;</div>
|
||||
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <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>  ++iter) {</div>
|
||||
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <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>  <span class="comment">// (distance between current state and final state)</span></div>
|
||||
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  uint32_t f_score = (*iter)->heuristic_value + (*iter)->depth;</div>
|
||||
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordflow">if</span> (f_score < min_f_score) {</div>
|
||||
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  min_f_score = f_score;</div>
|
||||
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  it_low_f_score = iter;</div>
|
||||
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  }</div>
|
||||
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  }</div>
|
||||
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  </div>
|
||||
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <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>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr<Info></a> current_state = *it_low_f_score;</div>
|
||||
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  </div>
|
||||
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <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>  <span class="keywordflow">if</span> (*(current_state->state) == *(Final->state)) {</div>
|
||||
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <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>  }</div>
|
||||
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="comment">// else remove from open list as visited.</span></div>
|
||||
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  open_list.erase(it_low_f_score);</div>
|
||||
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <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>  <span class="comment">// neighbor checking</span></div>
|
||||
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordflow">if</span> (current_state->depth >= permissible_depth) {</div>
|
||||
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keywordflow">continue</span>;</div>
|
||||
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  }</div>
|
||||
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <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>  <span class="comment">// state</span></div>
|
||||
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<Puzzle></a> total_possible_moves =</div>
|
||||
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  current_state->state->generate_possible_moves();</div>
|
||||
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  </div>
|
||||
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keywordflow">for</span> (Puzzle &neighbor : total_possible_moves) {</div>
|
||||
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="comment">// calculate score of neighbors with respect to</span></div>
|
||||
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="comment">// current_state</span></div>
|
||||
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr<Info></a> Neighbor = std::make_shared<Info>(</div>
|
||||
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  neighbor, dist(neighbor, *(Final->state)),</div>
|
||||
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  current_state->depth + 1U);</div>
|
||||
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  uint32_t temp_g_score = Neighbor->depth;</div>
|
||||
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  </div>
|
||||
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="comment">// Check whether this state is explored.</span></div>
|
||||
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <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>  <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>  <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>  <span class="keywordflow">if</span> (closed_list_iter != closed_list.end()) {</div>
|
||||
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <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>  <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>  <span class="comment">// 2. Else don't explore this state.</span></div>
|
||||
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keywordflow">if</span> (Neighbor->depth < (*closed_list_iter)->depth) {</div>
|
||||
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  closed_list.erase(closed_list_iter);</div>
|
||||
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordflow">continue</span>;</div>
|
||||
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  }</div>
|
||||
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  }</div>
|
||||
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <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>  <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>  <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>  <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>  <span class="keywordflow">if</span> (neighbor_g_score_iter->second > temp_g_score) {</div>
|
||||
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  neighbor_g_score_iter->second = temp_g_score;</div>
|
||||
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  parent_of[Neighbor] = current_state;</div>
|
||||
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  }</div>
|
||||
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  g_score[Neighbor] = temp_g_score;</div>
|
||||
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  parent_of[Neighbor] = current_state;</div>
|
||||
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  }</div>
|
||||
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <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>  <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>  <span class="comment">// existing one.</span></div>
|
||||
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keyword">auto</span> iter = open_list.find(Neighbor);</div>
|
||||
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keywordflow">if</span> (iter == open_list.end()) {</div>
|
||||
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  open_list.emplace(Neighbor);</div>
|
||||
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((*iter)->depth > Neighbor->depth) {</div>
|
||||
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  (*iter)->depth = Neighbor->depth;</div>
|
||||
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  }</div>
|
||||
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  }</div>
|
||||
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  closed_list.emplace(current_state);</div>
|
||||
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  }</div>
|
||||
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="comment">// Cannot find the solution, return empty vector</span></div>
|
||||
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keywordflow">return</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<Puzzle></a>(0);</div>
|
||||
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  }</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< Puzzle > Solution(std::shared_ptr< Info > FinalState, const MapOfPuzzleInfoWithPuzzleInfo &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>
|
||||
<p >Stores the parent of the states</p>
|
||||
<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 id="l00431" name="l00431"></a><span class="lineno"> 431</span> {</div>
|
||||
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> MapOfPuzzleInfoWithPuzzleInfo</div>
|
||||
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> parent_of; <span class="comment">/// Stores the parent of the states</span></div>
|
||||
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> MapOfPuzzleInfoWithInteger g_score; <span class="comment">/// Stores the g_score</span></div>
|
||||
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> SetOfPuzzleInfo open_list; <span class="comment">/// Stores the list to explore</span></div>
|
||||
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> SetOfPuzzleInfo closed_list; <span class="comment">/// Stores the list that are explored</span></div>
|
||||
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> </div>
|
||||
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span> <span class="comment">// Before starting the AyStartSearch, initialize the set and maps</span></div>
|
||||
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> open_list.emplace(Initial);</div>
|
||||
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span> parent_of[Initial] = <span class="keyword">nullptr</span>;</div>
|
||||
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> g_score[Initial] = 0;</div>
|
||||
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> </div>
|
||||
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> <span class="keywordflow">while</span> (!open_list.empty()) {</div>
|
||||
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> <span class="comment">// Iterator for state having having lowest f_score.</span></div>
|
||||
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> <span class="keyword">typename</span> SetOfPuzzleInfo::iterator it_low_f_score;</div>
|
||||
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> uint32_t min_f_score = 1e9;</div>
|
||||
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"> 447</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> iter = open_list.begin(); iter != open_list.end();</div>
|
||||
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span> ++iter) {</div>
|
||||
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> <span class="comment">// f score here is evaluated by g score (depth) and h score</span></div>
|
||||
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span> <span class="comment">// (distance between current state and final state)</span></div>
|
||||
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</span> uint32_t f_score = (*iter)->heuristic_value + (*iter)->depth;</div>
|
||||
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"> 452</span> <span class="keywordflow">if</span> (f_score < min_f_score) {</div>
|
||||
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span> min_f_score = f_score;</div>
|
||||
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span> it_low_f_score = iter;</div>
|
||||
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"> 455</span> }</div>
|
||||
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span> }</div>
|
||||
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"> 457</span> </div>
|
||||
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> <span class="comment">// current_state, stores lowest f score so far for this state.</span></div>
|
||||
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr<Info></a> current_state = *it_low_f_score;</div>
|
||||
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span> </div>
|
||||
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> <span class="comment">// if this current state is equal to final, return</span></div>
|
||||
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> <span class="keywordflow">if</span> (*(current_state->state) == *(Final->state)) {</div>
|
||||
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4">Solution</a>(current_state, parent_of);</div>
|
||||
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> }</div>
|
||||
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> <span class="comment">// else remove from open list as visited.</span></div>
|
||||
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> open_list.erase(it_low_f_score);</div>
|
||||
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> <span class="comment">// if current_state has exceeded the allowed depth, skip</span></div>
|
||||
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> <span class="comment">// neighbor checking</span></div>
|
||||
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> <span class="keywordflow">if</span> (current_state->depth >= permissible_depth) {</div>
|
||||
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"> 470</span> <span class="keywordflow">continue</span>;</div>
|
||||
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span> }</div>
|
||||
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> <span class="comment">// Generate all possible moves (neighbors) given the current</span></div>
|
||||
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> <span class="comment">// state</span></div>
|
||||
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno"> 474</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<Puzzle></a> total_possible_moves =</div>
|
||||
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"> 475</span> current_state->state->generate_possible_moves();</div>
|
||||
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno"> 476</span> </div>
|
||||
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span> <span class="keywordflow">for</span> (Puzzle &neighbor : total_possible_moves) {</div>
|
||||
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> <span class="comment">// calculate score of neighbors with respect to</span></div>
|
||||
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"> 479</span> <span class="comment">// current_state</span></div>
|
||||
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"> 480</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr<Info></a> Neighbor = std::make_shared<Info>(</div>
|
||||
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span> neighbor, dist(neighbor, *(Final->state)),</div>
|
||||
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> current_state->depth + 1U);</div>
|
||||
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span> uint32_t temp_g_score = Neighbor->depth;</div>
|
||||
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> </div>
|
||||
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> <span class="comment">// Check whether this state is explored.</span></div>
|
||||
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> <span class="comment">// If this state is discovered at greater depth, then discard,</span></div>
|
||||
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> <span class="comment">// else remove from closed list and explore the node</span></div>
|
||||
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> <span class="keyword">auto</span> closed_list_iter = closed_list.find(Neighbor);</div>
|
||||
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> <span class="keywordflow">if</span> (closed_list_iter != closed_list.end()) {</div>
|
||||
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> <span class="comment">// 1. If state in closed list has higher depth, then remove</span></div>
|
||||
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span> <span class="comment">// from list since we have found better option,</span></div>
|
||||
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> <span class="comment">// 2. Else don't explore this state.</span></div>
|
||||
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"> 493</span> <span class="keywordflow">if</span> (Neighbor->depth < (*closed_list_iter)->depth) {</div>
|
||||
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> closed_list.erase(closed_list_iter);</div>
|
||||
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> <span class="keywordflow">continue</span>;</div>
|
||||
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> }</div>
|
||||
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span> }</div>
|
||||
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span> <span class="keyword">auto</span> neighbor_g_score_iter = g_score.find(Neighbor);</div>
|
||||
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno"> 500</span> <span class="comment">// if the neighbor is already created and has minimum</span></div>
|
||||
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno"> 501</span> <span class="comment">// g_score, then update g_score and f_score else insert new</span></div>
|
||||
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno"> 502</span> <span class="keywordflow">if</span> (neighbor_g_score_iter != g_score.end()) {</div>
|
||||
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno"> 503</span> <span class="keywordflow">if</span> (neighbor_g_score_iter->second > temp_g_score) {</div>
|
||||
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"> 504</span> neighbor_g_score_iter->second = temp_g_score;</div>
|
||||
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"> 505</span> parent_of[Neighbor] = current_state;</div>
|
||||
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</span> }</div>
|
||||
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno"> 507</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno"> 508</span> g_score[Neighbor] = temp_g_score;</div>
|
||||
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno"> 509</span> parent_of[Neighbor] = current_state;</div>
|
||||
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"> 510</span> }</div>
|
||||
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"> 511</span> <span class="comment">// If this is a new state, insert into open_list</span></div>
|
||||
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno"> 512</span> <span class="comment">// else update if the this state has better g score than</span></div>
|
||||
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span> <span class="comment">// existing one.</span></div>
|
||||
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno"> 514</span> <span class="keyword">auto</span> iter = open_list.find(Neighbor);</div>
|
||||
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"> 515</span> <span class="keywordflow">if</span> (iter == open_list.end()) {</div>
|
||||
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno"> 516</span> open_list.emplace(Neighbor);</div>
|
||||
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno"> 517</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((*iter)->depth > Neighbor->depth) {</div>
|
||||
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno"> 518</span> (*iter)->depth = Neighbor->depth;</div>
|
||||
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"> 519</span> }</div>
|
||||
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"> 520</span> }</div>
|
||||
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno"> 521</span> closed_list.emplace(current_state);</div>
|
||||
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno"> 522</span> }</div>
|
||||
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno"> 523</span> <span class="comment">// Cannot find the solution, return empty vector</span></div>
|
||||
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno"> 524</span> <span class="keywordflow">return</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<Puzzle></a>(0);</div>
|
||||
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"> 525</span> }</div>
|
||||
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_ay_star_search_html_a0a26aa9ad3d73707370d9fe83707aca4"><div class="ttname"><a href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4">machine_learning::aystar_search::AyStarSearch::Solution</a></div><div class="ttdeci">std::vector< Puzzle > Solution(std::shared_ptr< Info > FinalState, const MapOfPuzzleInfoWithPuzzleInfo &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>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a5bb772fd41005fdefa8bd32edbf00cc3_cgraph.svg" width="626" height="472"><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_a48284e156fdd48fd0c41008c7e48f201_cgraph.svg" width="626" height="472"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="afaeb1cde711f5198dc3dd213dedbd726"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#afaeb1cde711f5198dc3dd213dedbd726">◆ </a></span>Solution()</h2>
|
||||
<a id="a0a26aa9ad3d73707370d9fe83707aca4" name="a0a26aa9ad3d73707370d9fe83707aca4"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a0a26aa9ad3d73707370d9fe83707aca4">◆ </a></span>Solution()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
@@ -393,7 +384,7 @@ template<typename Puzzle > </div>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><Puzzle> <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a>< Puzzle >::<a class="el" href="../../dd/d4f/class_solution.html">Solution</a> </td>
|
||||
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< Puzzle > <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a>< Puzzle >::<a class="el" href="../../dd/d4f/class_solution.html">Solution</a> </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>< <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> > </td>
|
||||
<td class="paramname"><em>FinalState</em>, </td>
|
||||
@@ -426,25 +417,25 @@ template<typename Puzzle > </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="l00407"></a><span class="lineno"> 407</span>  {</div>
|
||||
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <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>  <span class="keyword">auto</span> current_state = FinalState;</div>
|
||||
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="comment">/*</span></div>
|
||||
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span> <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> <span class="comment"> * final state</span></div>
|
||||
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span> <span class="comment"> */</span></div>
|
||||
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<Puzzle></a> answer;</div>
|
||||
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <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>  answer.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(*current_state->state);</div>
|
||||
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  current_state = parent_of.find(current_state)->second;</div>
|
||||
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  }</div>
|
||||
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordflow">return</span> answer;</div>
|
||||
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  }</div>
|
||||
<div class="fragment"><div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> {</div>
|
||||
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> <span class="comment">// Useful for traversing from final state to current state.</span></div>
|
||||
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> <span class="keyword">auto</span> current_state = FinalState;</div>
|
||||
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> <span class="comment">/*</span></div>
|
||||
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span><span class="comment"> * For storing the solution tree starting from initial state to</span></div>
|
||||
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span><span class="comment"> * final state</span></div>
|
||||
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span><span class="comment"> */</span></div>
|
||||
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<Puzzle></a> answer;</div>
|
||||
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> <span class="keywordflow">while</span> (current_state != <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> answer.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(*current_state->state);</div>
|
||||
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> current_state = parent_of.find(current_state)->second;</div>
|
||||
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> }</div>
|
||||
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> <span class="keywordflow">return</span> answer;</div>
|
||||
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> }</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_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 class="center"><iframe scrolling="no" frameborder="0" src="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a0a26aa9ad3d73707370d9fe83707aca4_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>
|
||||
|
||||
@@ -459,7 +450,7 @@ Here is the call graph for this function:</div>
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></li><li class="navelem"><b>aystar_search</b></li><li class="navelem"><a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">AyStarSearch</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.1 </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.2 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
|
||||
@@ -1,14 +1,9 @@
|
||||
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" ],
|
||||
[ "comparison_operator", "d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html", null ],
|
||||
[ "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#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 ]
|
||||
[ "a_star_search", "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201", null ],
|
||||
[ "Solution", "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4", null ]
|
||||
];
|
||||
@@ -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 2.48.0 (20210717.1556)
|
||||
<!-- Generated by graphviz version 2.49.0 (20210828.1703)
|
||||
-->
|
||||
<!-- Title: machine_learning::aystar_search::AyStarSearch::Solution Pages: 1 -->
|
||||
<svg width="305pt" height="66pt"
|
||||
|
Before Width: | Height: | Size: 2.8 KiB After Width: | Height: | Size: 2.8 KiB |
@@ -3,11 +3,11 @@
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/set/begin.html#" title=" " alt="" coords="257,5,362,32"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/set/emplace.html#" title=" " alt="" coords="248,56,371,83"/>
|
||||
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/set/empty.html#" title=" " alt="" coords="255,107,364,133"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/map/end.html#" title=" " alt="" coords="258,157,361,184"/>
|
||||
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/set/end.html#" title=" " alt="" coords="262,208,357,235"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/set/end.html#" title=" " alt="" coords="262,157,357,184"/>
|
||||
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/map/end.html#" title=" " alt="" coords="258,208,361,235"/>
|
||||
<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#afaeb1cde711f5198dc3dd213dedbd726" title="A helper solution: launches when a solution for AyStarSearch is found." alt="" coords="224,411,395,467"/>
|
||||
<area shape="rect" id="node8" 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,309,356,336"/>
|
||||
<area shape="rect" id="node9" 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,368,583,395"/>
|
||||
<area shape="rect" id="node10" href="$da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4" 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>
|
||||
@@ -0,0 +1 @@
|
||||
917ef1f6aec9dcbb1295ded3f018b12e
|
||||
@@ -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 2.48.0 (20210717.1556)
|
||||
<!-- Generated by graphviz version 2.49.0 (20210828.1703)
|
||||
-->
|
||||
<!-- Title: machine_learning::aystar_search::AyStarSearch::a_star_search Pages: 1 -->
|
||||
<svg width="469pt" height="354pt"
|
||||
@@ -68,32 +68,32 @@
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/end.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="189.5,-212.5 189.5,-231.5 266.5,-231.5 266.5,-212.5 189.5,-212.5"/>
|
||||
<text text-anchor="middle" x="228" y="-219.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::end</text>
|
||||
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/end.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="192.5,-212.5 192.5,-231.5 263.5,-231.5 263.5,-212.5 192.5,-212.5"/>
|
||||
<text text-anchor="middle" x="228" y="-219.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::end</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M128.1,-198.8C145,-202.77 163.01,-206.99 178.96,-210.73"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="178.57,-214.24 189.11,-213.11 180.17,-207.42 178.57,-214.24"/>
|
||||
<path fill="none" stroke="midnightblue" d="M128.1,-198.8C146.2,-203.05 165.55,-207.59 182.29,-211.51"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="181.81,-215 192.35,-213.87 183.41,-208.18 181.81,-215"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/end.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="192.5,-174.5 192.5,-193.5 263.5,-193.5 263.5,-174.5 192.5,-174.5"/>
|
||||
<text text-anchor="middle" x="228" y="-181.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::end</text>
|
||||
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/end.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="189.5,-174.5 189.5,-193.5 266.5,-193.5 266.5,-174.5 189.5,-174.5"/>
|
||||
<text text-anchor="middle" x="228" y="-181.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::end</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node6 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M128.1,-184C146.2,-184 165.55,-184 182.29,-184"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="182.35,-187.5 192.35,-184 182.35,-180.5 182.35,-187.5"/>
|
||||
<path fill="none" stroke="midnightblue" d="M128.1,-184C145,-184 163.01,-184 178.96,-184"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="179.11,-187.5 189.11,-184 179.11,-180.5 179.11,-187.5"/>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
@@ -113,37 +113,37 @@
|
||||
<!-- Node8 -->
|
||||
<g id="node8" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_node8"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/find.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="356,-73.5 356,-92.5 433,-92.5 433,-73.5 356,-73.5"/>
|
||||
<text text-anchor="middle" x="394.5" y="-80.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::find</text>
|
||||
<g id="a_node8"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/find.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="193,-98.5 193,-117.5 263,-117.5 263,-98.5 193,-98.5"/>
|
||||
<text text-anchor="middle" x="228" y="-105.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::find</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node8 -->
|
||||
<g id="edge7" class="edge">
|
||||
<title>Node1->Node8</title>
|
||||
<path fill="none" stroke="midnightblue" d="M94.91,-163.26C113.91,-150.99 139.46,-136.12 164,-127 224.58,-104.48 298.64,-92.95 345.94,-87.45"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="346.36,-90.93 355.9,-86.34 345.58,-83.97 346.36,-90.93"/>
|
||||
<path fill="none" stroke="midnightblue" d="M96.58,-163.32C115.56,-151.54 140.51,-137.14 164,-127 169.99,-124.41 176.44,-122.04 182.85,-119.9"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="184.33,-123.11 192.81,-116.76 182.22,-116.43 184.33,-123.11"/>
|
||||
</g>
|
||||
<!-- Node9 -->
|
||||
<g id="node9" class="node">
|
||||
<title>Node9</title>
|
||||
<g id="a_node9"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/find.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="193,-60.5 193,-79.5 263,-79.5 263,-60.5 193,-60.5"/>
|
||||
<text text-anchor="middle" x="228" y="-67.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::find</text>
|
||||
<g id="a_node9"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/find.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="356,-54.5 356,-73.5 433,-73.5 433,-54.5 356,-54.5"/>
|
||||
<text text-anchor="middle" x="394.5" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::find</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node9 -->
|
||||
<g id="edge8" class="edge">
|
||||
<title>Node1->Node9</title>
|
||||
<path fill="none" stroke="midnightblue" d="M83.32,-163.35C101.96,-143.37 132.53,-113.33 164,-94 170.73,-89.86 178.29,-86.24 185.78,-83.15"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="187.09,-86.39 195.15,-79.51 184.56,-79.87 187.09,-86.39"/>
|
||||
<path fill="none" stroke="midnightblue" d="M79.82,-163.23C97.18,-140.7 128.17,-105.72 164,-89 222.2,-61.84 297.46,-58.89 345.62,-60.48"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="345.63,-63.98 355.76,-60.89 345.92,-56.99 345.63,-63.98"/>
|
||||
</g>
|
||||
<!-- 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#afaeb1cde711f5198dc3dd213dedbd726" 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#a0a26aa9ad3d73707370d9fe83707aca4" 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>
|
||||
@@ -154,14 +154,14 @@
|
||||
<!-- Node1->Node10 -->
|
||||
<g id="edge9" class="edge">
|
||||
<title>Node1->Node10</title>
|
||||
<path fill="none" stroke="midnightblue" d="M76.22,-163.06C92.38,-134.54 124.63,-83.34 164,-51 165.54,-49.73 167.15,-48.5 168.81,-47.31"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="170.96,-50.08 177.42,-41.69 167.13,-44.22 170.96,-50.08"/>
|
||||
<path fill="none" stroke="midnightblue" d="M77.26,-163.29C94.14,-136.09 126.71,-88.04 164,-56 167.66,-52.85 171.65,-49.86 175.79,-47.04"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="177.88,-49.86 184.42,-41.53 174.11,-43.96 177.88,-49.86"/>
|
||||
</g>
|
||||
<!-- Node10->Node8 -->
|
||||
<!-- Node10->Node9 -->
|
||||
<g id="edge11" class="edge">
|
||||
<title>Node10->Node8</title>
|
||||
<path fill="none" stroke="midnightblue" d="M283.78,-41.65C308.42,-50.93 336.77,-61.62 358.48,-69.8"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="357.36,-73.12 367.95,-73.37 359.83,-66.57 357.36,-73.12"/>
|
||||
<title>Node10->Node9</title>
|
||||
<path fill="none" stroke="midnightblue" d="M292.13,-37.5C310.46,-42.29 330.13,-47.43 347.22,-51.9"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="346.39,-55.3 356.95,-54.45 348.16,-48.53 346.39,-55.3"/>
|
||||
</g>
|
||||
<!-- Node11 -->
|
||||
<g id="node11" class="node">
|
||||
|
Before Width: | Height: | Size: 9.5 KiB After Width: | Height: | Size: 9.5 KiB |
@@ -1 +0,0 @@
|
||||
22d81ef3e73688a898844740f45dacc4
|
||||
Reference in New Issue
Block a user