搜索资源列表
astar
- A*算法详解，含例子，包括VC++和Basic两个版本-A* find path
Astar
- Astar算法 Astar算法 Astar算法-Astar
astar
- This is a A* algorith.
Astar
- A*寻路算法的相关源代码，收录了两种A*算法的实现-A* pathfinding algorithm related to the source code, contains two kinds of A* Algorithm
AStar
- VS2008开发环境 A*算法的一个简单小例子，主要体现A*寻路的方法，适合A*算法的初学者学习-VS2008 development environment, a simple A* algorithm is a small example, the main embodiment of the method of A* pathfinding for beginners A* algorithm
ASTAR
- A*地图搜索,搜索到达目标的最佳路径. 用C编写的。-Searching in a map using A*.Seek for the best path to your goal,written in C language.
AStar
- A*算法实现了的寻路算法，此代码采用了STL的泛型程序设计，效率非常高！值得你的下载。-A* algorithm has to search for paths algorithm
AStar
- A*算法，在VS2005上实现，带界面和动画的-A* algorithm with windows
astar
- A* is a shortesr path algorithm. it is useful to find a shortest path.
Astar
- a star method for finding path planning of a moving object
Astar(V5-14)
- A*算法（DTM格式数据） GIS环境下用到的最短路径算法模块，支持带权图和二值图，改进过，收敛速度不错 （实验室做的算法，请勿用于商业用途）-A* algorithm (DTM format data) GIS environment, shortest path algorithm used in modules to support a weighted graph and a binary image, improving over, a good convergence rat
AStar
- 这个一种A*算法的设计在J2ME上实现的-The design of a kind of A* algorithm implemented on the J2ME
Java.Game.Programming.AStar.algorithm.code
- Java游戏编程AStar算法源代码Java Game Programming AStar algorithm source code -Java Game Programming AStar algorithm source code
ASTAR
- astar program it will find the shortest path to reach the destination
Astar
- 人工智能系统中的A*寻径算法,以寻找最佳路径。-Artificial intelligence system A* routing algorithm to find the best path.
AStar
- 用于避障的A星算法，适用于机器人的轨迹规划-A star for Obstacle Avoidance Algorithm for Robot Path Planning
astar
- Astar algorithm using simple method to code it
Astar
- Astar algorythm in EightPuzzle problem. Done in NetBeans
Astar-path-finding--based-on-MFC
- 基于MFC的A*算法，可以设置起点、终点、障碍等-astar algriumn based on MFC
AStar
- A*（A-Star)算法是一种静态路网中求解最短路最有效的方法。公式表示为： f(n)=g(n)+h(n),其中f(n) 是从初始点经由节点n到目标点的估价函数，g(n) 是在状态空间中从初始节点到n节点的实际代价，h(n)是从n到目标节点最佳路径的估计代价。 -A* (A-Star) is a static network algorithm for solving the shortest most effective way. Formula is expressed as: f (n)