搜索资源列表
Kruskal
- 用Kruskal算法实现若干个城市之间的最短路径.最大城市数目为7个.-algorithm using Kruskal several cities in the shortest path. The number of the largest city in seven.
Floyd
- Floyd最短路径算法的MATLAB程序，经过测试
Floyd-Warshall-c-chengxi
- Floyd-Warshall算法描述 1)适用范围： a)APSP(All Pairs Shortest Paths) b)稠密图效果最佳 c)边权可正可负 2)算法描述： a)初始化：dis[u,v]=w[u,v] b)For k:=1 to n For i:=1 to n For j:=1 to n If dis[i,j]>dis[i,k]+dis[k,j] Then Dis[I,j]:=dis[I,k]+dis[k,j] c)算法结
Soft20060207143559264
- 求两点间最短路径问题的高效率算法 可以直接拿来用，是数据结构中经典程序
GraphFloyd
- 建立了图的基类，并且附有球最短路径问题的floyd算法的具体代码-The establishment of a map base class, and the ball with the shortest path problem floyd algorithm specific code
Graph
- 图的基类以及最短路径算法，dijkstra,floyd，Kruskal算法等，代码来自北大赵海燕老师编著的数据结构与算法。-Graph base class as well as the shortest path algorithm, dijkstra, floyd, Kruskal algorithm, code Zhao Haiyan teachers from Beijing University and edited by the data structure and algorith
managemant_enquire
- 传统的Dijkstra 算法无疑是解决一般最短路径问题的最优算法，但接下来我们会看到传统的Dijkstra 算法在公交查询系统是不适合的。而我据对公交乘客出行心理调查的统计结果,指出换乘次数最少是乘客出行时考虑的首要因素，所以这里提出一种基于换乘次数最少的公交最短路径算法。 至于公交车的调度，需要同时考虑到公车公司和乘客的利益，必须尽量在满足双方的利益上做出合理的调度。所以这是一个多目标最优的问题。- management
Matrixvectoralgorithm
- 用Dijstra算法的矩阵向量算法，用C++编写实现路由最短路径。-Dijstra algorithm using matrix vector algorithm, using C++ to prepare to achieve the shortest path routing.
Flord
- 经典的佛洛依德算法，可以计算出图中任意两点的最短路径。-Freud classic algorithms, can calculate any two of map the shortest path.
S6_Dij
- Dijkstra算法，求有向网中任一点到其余各点的最短路径-Dijkstra' s algorithm, find the shortest path to the network at any point to the remaining points
dijkstra
- c++版本的最短路径算法 希望能帮到帮到初学者 里面有解释-the version of c++ the shortest path algorithm hope that help to help beginners which explained
Prim
- 用于求解旅行商最短路径问题的Prim算法，是一种经典的构造型算法，可用于论文实验的对比参照-Prim shortest path algorithm is used to solve the traveling salesman problem, is a classic stereotype algorithm can be used to compare the experimental reference papers。
Dijkstra迪捷斯特拉算法
- 迪杰斯特拉算法是从一个顶点到其余各顶点的最短路径算法，解决的是有向图中最短路径问题。迪杰斯特拉算法主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。(The Dijkstra algorithm is the shortest path algorithm from one vertex to the other vertices, and the shortest path problem in the directed graph is solved. The main featur
xpcxfp
- 最短路径搜索算法的应用,利用最短路径搜索作为校园地图导航()