type_gastarsearch.html

来自「一个由Mike Gashler完成的机器学习方面的includes neural」· HTML 代码 · 共 31 行

HTML
31 行
字号 
<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>GAStarSearch</b></big></big></big><br>extends <a href="type_GActionPathSearch.html">GActionPathSearch</a><br></td><td></td></tr></table><br><br><big><big><i>Statics (public)</i></big></big><br><div style="margin-left: 40px;">void <big><b>Test</b></big>()<br></div><br><big><big><i>Constructors (public)</i></big></big><br><div style="margin-left: 40px;"><big><b>GAStarSearch</b></big>(<a href="type_GActionPathState.html">GActionPathState</a>* pStartState, int nActionCount, int nMaxPaths)<br><div style="margin-left: 80px;"><font color=brown> Takes ownership of pStartState nMaxPaths is the max number of unique paths to hold in the priority queue. When		this number is exceeded, it throws out the worst paths. if nMaxPaths is small,		the search resembles bar-search, except with a best-first ordering.</font></div><br></div><br><big><big><i>Destructors</i></big></big><br><div style="margin-left: 40px;"><big><b>~GAStarSearch</b></big>()<br></div><br><big><big><i>Virtual (public)</i></big></big><br><div style="margin-left: 40px;"><a href="type_GActionPath.html">GActionPath</a>* <big><b>GetBestPath</b></big>()<br>double <big><b>GetBestPathError</b></big>()<br>bool <big><b>Iterate</b></big>()<br></div><br></body></html>

type_gastarsearch.html - 源码说明

本页面展示了「一个由Mike Gashler完成的机器学习方面的includes neural net, naive bayesian classifier, decision tree, KNN, a genet」中的 type_gastarsearch.html 源码文件，采用 HTML 编程语言编写，共 31 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与classifier相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?