Description: C#实现的最短路径AStar算法,是我见过最好的AStar算法。-c# shortest path AStar calculation, It is the best calculation I ve ever seen Platform: |
Size: 65536 |
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: 最短路径计算，比较简单的测试
可用于网上地图服务中路径分析-The shortest path calculation, a relatively simple test can be used for online mapping service in the path analysis Platform: |
Size: 2048 |
Author:胡庆武 |
Hits:
Description: \程序\sj\统计度、出度、入度、出权、入权、边权、点权分布程序\sj\计算最短路径和聚类系数2-Sj statistical procedures, the out-degree, to the degree of power, into the right side of right, point right to the distribution of the shortest path calculation procedures sj and clustering coefficient of 2 Platform: |
Size: 3072 |
Author:朱鹏鹏 |
Hits:
Description: 最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。
Dijkstra算法是很有代表性的最短路算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。
-The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on. Platform: |
Size: 1024 |
Author:haiyan |
Hits:
Description: 实现中国铁路最短路径的计算，基于图的PRIM算法，MFC实现动态演示-China Railway the shortest path to achieve the calculation of the PRIM algorithm based on the map, MFC dynamic presentation Platform: |
Size: 1961984 |
Author:zhangyan |
Hits:
Description: 最短路径计算程序，很简单，明了，适用于初学者-The shortest path calculation program is very simple and clear, suitable for beginners Platform: |
Size: 1354752 |
Author:markboo |
Hits:
Description: 最短路径的计算,是我自己变得,比较适合建模用,希望对大家有用.-The shortest path calculation, is my own to become more suitable for modeling with the hope that be useful to everyone. Platform: |
Size: 3072 |
Author:fenghan |
Hits:
Description: 利用模拟退火算法实现有向图最短路径的计算，基本与康立山的参数确定方法相同，只是结束条件改为温度下降到0.2截止。-Simulated annealing algorithm has to map the shortest path calculation, basic and Kang Lishan determine the parameters of the same way, but the conditions to end cut-off temperature dropped to 0.2. Platform: |
Size: 7168 |
Author:闫雪飞 |
Hits:
Description: 此代码实现了网络结点之中最短路径的计算，并输出了各个网络结点的路由表
，路由表包括：目的网络，下一跳，代价，详细地址。此代码的原理是Dijstra算法。在代码的注释中有测试用例,用户测试时只需将程序运行后再将测试用例复制到DOS黑框中即可。测试用例中有详细的用例解释。-This code implements the network nodes being the shortest path calculation, and output of each network node routing table, routing table, including: the destination network, the next hop, the cost, full address. The principle of this code is Dijstra algorithm. There are comments in the code test cases, users only need to run test after test cases can be copied to the DOS black borders. Test use cases in detail to explain. Platform: |
Size: 1024 |
Author:刘伟强 |
Hits:
Search - shortest path calculation