Description: 有关启发式搜索的经典算法：A*最短路径算法的实例和对应程序。关注的朋友可以留意一下。（比传统的Dijistra算法效率高很多哦！^_^）-the heuristic search algorithm of the classic : A* shortest path algorithm examples and the corresponding procedures. Concerned friends can look. (Dijistra than the traditional algorithm efficiency is much higher oh 70,000 Platform: |
Size: 34816 |
Author:莜月 |
Hits:
Description: 用C写的源程序功能分别是1.用DFS算法判断有向图中是否有环2.从文件中读图，用邻接链表保存信息，寻找两个结点vi,vj间的最短路径-written in C source is a function respectively. DFS algorithm used to determine whether there are plans Central 2. Interpret drawings from the file, use the adjacent Chain preservation of information to find two nodes vi, vj the shortest path Platform: |
Size: 3072 |
Author:光光 |
Hits:
Description: Windows应用程序，C#编写，实现了求最短路径的Dijkstra算法，方便操作，可以自已在程序界面上指定每一个点的位置，在界面上空白的地方每点击一下生成一个点（该点是一个可以点击的按钮），这些按钮按照出现的先后顺序自动从1开始编号（目前程序设定最多支持100个点，可自行更改）。界面右上角是计算结果显示区，往下是权值输入区和“连线”、“清屏”“计算”三个按钮以及状态区，状态区显示当前的起点和终点，连线和计算都要用到该信息（点击生成的顺序编号的那些按钮可以依次改变起点和终点）。输入权值后点“连线”则把编号为状态区显示的起点和终点连接起来，并在线的中央标明权值。点击“计算”则计算状态区显示的起点和终点的最短距离及路径，并将结果输出到右上角。右下角为异常显示区，显示程序运行过程中出现的异常，比如权值输入一个字母，因字母无法转为整型，就会产生异常，该异常信息就显示在右下角。-Windows applications, C#, for the realization of the Dijkstra shortest path algorithm, convenient operation, the procedure can own interface on a point each designated location, gaps at the interface of each click generated a point (the point is a can click on the button), these buttons with the automatic sequence starting from No. 1 (the current procedure set up to support 100 points can make changes). Instructions interface is calculated results show, right down the value of the importation and the "Alliance" "screen" "calculated" button and the three state area, the current state of the district show the starting and finishing points. Alliance and calculation should use the information (click generation of serial numbers of those buttons can be followed to Platform: |
Size: 11264 |
Author: |
Hits:
Description: 校园导游图，包括选择最短路径，选择不同景点，不同参观顺序。-campus tour map, including the choice of the shortest path, choose a different attractions, visited different order. Platform: |
Size: 1961984 |
Author:郝平 |
Hits:
Description: 一个找多条路径中最短的的算法示例.有图例来显示的-find more of a shortest path algorithm examples. Legend has to show the Platform: |
Size: 19456 |
Author:王泵 |
Hits:
Description: 这是数学建模中图论中的几个重要的模型求解。包括最短路径的两种方法，以及加权的求法-This is the mathematical modeling of graph theory of a number of important model solution. Shortest Path, including the two methods, and the weighted Solution Platform: |
Size: 4096 |
Author:王清 |
Hits:
Description: A*算法是一个求最短路径的函数，为许多即时战略游戏所用刀（或许人家大型的即时战略游戏笔者算法更好，不管它）。它由两个函数组成，一个是评估函数，也就是确定人物移动的下一个位置必须离目标位置最近，评估函数评估的结果越精确，则寻径的速度越快；另一个就是寻径函数，也就根据评估的结果做出响应，然后从新位置继续评估下一个位置，若无路可走（四周都是障碍什么的），那么折回一个路径节点，尝试其他方向，这个算法有个缺点，随着游戏中人物增多，相应的处理节点就增多了，会影响处理速度，而且占用大量的内存。
有兴趣的朋友可以改成动态的寻径，就是当入口和出口位置都在变化的时候进行寻径，这个代码也只有200多行。
我的算法还不能算是最优的，因为评估函数只不过是简单的测试两点距离（这会带来误差），选择离出口最短的且非障碍物的方向，进行下一个路径节点的移动。-A* algorithm is a shortest path function, To many time strategy games as a knife (and perhaps others of immediate large-scale strategy game better writer algorithm, regardless of it). It consists of two components function, a function is to assess, is to determine the movement of people under one location to be away from the target location recently to assess the function of the assessment results more precise, Routing is the faster; Another is the routing function, also based on the results of the assessment to respond, then the new location to continue to assess a position where, if there is no way out (what are surrounded by the barrier), then retrace a path nodes, try other directions, this algorithm has a shortcoming, as the game figures increased, corresponding to the processing nod Platform: |
Size: 3072 |
Author:yzmars |
Hits:
Description: 用Visual C++编写的一个基于文本文件的最短路径程序源码-prepared text of a document based on the shortest path procedures FOSS Platform: |
Size: 1640448 |
Author:王亚文 |
Hits:
Description: 这是用于个GIS中的最短路径的算法，通常的经典算法有无法自学习的功能，而此算法很好的解决了此问题-This is a GIS for the shortest path algorithm, usually classical algorithm is not self-learning function, This algorithm good solution of this problem Platform: |
Size: 19456 |
Author:lizhi |
Hits:
Description: this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Notes:
1. Input error checking included
2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value -this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter, value Platform: |
Size: 4096 |
Author:宏姬 |
Hits:
Description: 一个最短路径算法，可以作为初学参考，具有一定的价值和扩展空间-A shortest path algorithm, can serve as a beginner reference, has a certain value and the expansion of space Platform: |
Size: 1024 |
Author:追风 |
Hits:
Description: 如何找到一条最短的路径是程序员需要设计的算法，目前最为流行的寻路算法就是A*算法，这个就是A*算法的一个简单例子-How to find a shortest path is programmers need to design algorithms, is currently the most popular routing algorithm is the A* algorithm, this is the A* algorithm is a simple example Platform: |
Size: 326656 |
Author:cn |
Hits:
Description: 一种快速求得最短路径的经典算法，可以在运筹规划或在统筹安排中使用-Express obtained a classic shortest path algorithm, can be planned or in operation in co-ordinating arrangements for the use of Platform: |
Size: 51200 |
Author:chendong |
Hits:
Description: 经典最短路径算法，内含多个工程项目，可下载-The classic shortest path algorithm, contain a number of projects, can be downloaded Platform: |
Size: 84992 |
Author:y.g |
Hits:
Description: 这是一个用Java编写的最短路算法，很实用。-It is written in Java using a shortest path algorithm is very practical. Platform: |
Size: 1024 |
Author:陈严 |
Hits:
Description: Dijkstra提出按各顶点与源点v间的路径长度的递增次序，生成到各顶点的最短路径的算法。既先求出长度最短的一条最短路径，再参照它求出长度次短的一条最短路径，依次类推，直到从源点v 到其它各顶点的最短路径全部求出为止。-Dijkstra proposed by the vertex and the path between the source point v in increasing order of length, to generate the shortest path to each vertex the algorithm. Both first find the shortest length of a shortest path, then it is calculated with reference to a short length of time the shortest path, and so on, until the point from the source vertex v to each other all the calculate the shortest path so far. Platform: |
Size: 1024 |
Author:庞存岐 |
Hits:
Search - a* shortest path