type_gactionpathsearch.html
来自「一个由Mike Gashler完成的机器学习方面的includes neural」· HTML 代码 · 共 39 行
HTML
39 行
<html><head><title>Generated Documentation</title></head><body> <image src="headerimage.png"> <br><br><table><tr><td><big><big><big style="font-family: arial;"><b>GActionPathSearch</b></big></big></big><br><br></td><td> This is the base class of search algorithms that can only perform a discreet set of actions (as opposed to jumping to anywhere in the search space), and seeks to minimize the error of a path of actions</td></tr></table><br><br><big><big><i>Constructors (public)</i></big></big><br><div style="margin-left: 40px;"><big><b>GActionPathSearch</b></big>(<a href="type_GActionPathState.html">GActionPathState</a>* pStartState, int nActionCount)<br><div style="margin-left: 80px;"><font color=brown> Takes ownership of pStartState</font></div><br></div><br><big><big><i>Destructors</i></big></big><br><div style="margin-left: 40px;"><big><b>~GActionPathSearch</b></big>()<br></div><br><big><big><i>Abstracts</i></big></big><br><div style="margin-left: 40px;"><a href="type_GActionPath.html">GActionPath</a>* <big><b>GetBestPath</b></big>()<br><div style="margin-left: 80px;"><font color=brown> Returns the best known path so far</font></div><br>double <big><b>GetBestPathError</b></big>()<br><div style="margin-left: 80px;"><font color=brown> Returns the error of the best known path</font></div><br>bool <big><b>Iterate</b></big>()<br><div style="margin-left: 80px;"><font color=brown> Call this in a loop to do the searching. If it returns true, then it's done so don't call it anymore.</font></div><br></div><br><big><big><i>Public</i></big></big><br><div style="margin-left: 40px;">int <big><b>GetActionCount</b></big>()<br><div style="margin-left: 80px;"><font color=brown> Returns the number of possible actions</font></div><br></div><br></body></html>
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?