搜索资源列表
a-star-algorithm-implementation
- 基于stl的a star寻路算法的高效实现
AStar1
- A-Star算法完整版，c++源码实现 -A-Star algorithm is the full version, c++ source implementation
AStarDll A星路径搜索(采用二叉堆)
- 算法简述：A星路径搜索(采用二叉堆)，最短路径寻路算法-Algorithm Descr iption: A star path search (using the binary heap), the shortest path Algorithm for Route
Astar
- A*算法实现的一个8数码问题,使用的算法是A*算法，比较简单。-A* A STAR
a-star-algorithm-implementation
- A* 算法可复用的实现（用了模板）, 并配有几个简单例子-the implementation of A star algorithm with C++ template. some simple but classic problems solved with it is here too.
A
- 本文件为C语言编写，A星寻路算法，自动寻找最优路径-This document is written in C, A Star pathfinding algorithm, automatically find the optimal path. .
ClassAstar
- A*搜寻算法，俗称A星算法。这是一种在图形平面上，有多个节点的路径，求出最低通过成本的算法。常用于游戏中的NPC的移动计算，或线上游戏的BOT的移动计算上。-A* search algorithm, called A Star algorithm. This is a plane in the graphics, there are multiple nodes in the path, find the lowest cost method adopted. Commonly used in
A star
- 这是A*算法，一种评估函数算法，广度优先搜索其实是A*算法的特例，它的评估函数只有深度-Search
main
- 完成了简单的A*（A star）算法 可以用于求解第K短路径-Completion of a simple A* (A star) algorithm can be used to solve the first K shortest paths
2-SAT
- 本文详细介绍了2-STAR算法，此算法在图论里面具有较高的地位，本文详细推到了染色算法的时间复杂度O(e).具有较高的学术价值。-This paper describes a 2-STAR algorithm, the algorithm in graph theory, which has a higher status, the paper pushed to the coloring algorithm of time complexity O (e). Has high academic
A
- 实现a星寻路，可以根据a星寻路算法，寻找电子地图中的路径-Find its way to achieve a star
AStar
- A*（A-Star)算法是一种静态路网中求解最短路最有 A star算法在静态路网中的应用 效的方法-A* (A-Star) is a static network algorithm for solving the shortest path algorithm in most A star network of the static effective way
delphi_A-Star_PAS
- 一个DELPHI的A星算法源码PAS..可用于游戏等自动寻最短路径-DELPHI s a source PAS .. A star algorithm can be used to automatically find the shortest path games
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)
Knapsack
- 基于0-1背包问题的A星算法，在VC++6.0上运行通过。-A Star algorithm based on 0-1 Knapsack problem ,it can run in VC++ 6.0 platform.
dijkstra
- Java语言编写的迪杰斯特拉算法，通过演示以及代码的分析可以帮助大家掌握此算法。-Java language Dijkstra algorithm, demos, and code analysis can help us grasp the algorithm.
a_star
- a_star算法,A*（A-Star)算法是一种静态路网中求解最短路最有效算法。本工程实现了简单了a_star算法，并在vc6.0下直接编译通过。-a_star algorithm, A* (A-Star) algorithm is a static network in the most efficient algorithm for solving the shortest path. The project achieved a simple a_star algorithm, and i
A-Star-Algoritm
- A*算法演示程序,介绍A*算法及其演示的程序-A Star Algorithm Program
AStar_knight
- A star算法求解的国际象棋骑士，也就是马从一个位置走到另一个位置的最小步数。-A star algorithm chess knight, it is a horse from one location to another location of the minimum number of steps.
A-Star-Develope
- 一篇翻译过来的A星算法的详细探讨材料，讲得很透彻，很通俗易懂，附Delphi的实现-A translation from A Star algorithm discussed in detail material, very thorough, very easy to understand, attached to the realization of Delphi