搜索资源列表
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)算法结
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
Matrixvectoralgorithm
- 用Dijstra算法的矩阵向量算法，用C++编写实现路由最短路径。-Dijstra algorithm using matrix vector algorithm, using C++ to prepare to achieve the shortest path routing.
dijkstra
- c++版本的最短路径算法 希望能帮到帮到初学者 里面有解释-the version of c++ the shortest path algorithm hope that help to help beginners which explained
ClsPathFinder
- ArcEngine +C# 寻找最短路径-ArcEngine+C# find the shortest path
zdlj
- 基于arcgis engine,利用C#语言，实现最短路径分析-arcgis engine and c#, networkanalyst
Astar
- A星寻路算法，输入矩阵，输出路径点，得到一条最短路径(A star algorithm source code)
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
交通咨询系统
- 设计一个交通咨询系统，能让旅客咨询从任一个城市到另一个城市之间的最短路径（里程）。(Design a traffic consulting system that allows passengers to consult the shortest path (mileage) from one city to another.)