搜索资源列表
Dijkstra
- Dijkstra算法,实现加权有向图中从确定的起点寻找最短路径并输出-Dijkstra algorithm, to achieve a weighted directed graph from the starting point to determine the shortest path to find and output
Dijkstra
- 用Dijkstra算法实现最短路径,在VC++6.0中运行-Using Dijkstra shortest path algorithm in VC++6.0 run
Dijkstra-Shortest-Path
- 一种快速求得最短路径的经典算法,可以在运筹规划或在统筹安排中使用-Express obtained a classic shortest path algorithm, can be planned or in operation in co-ordinating arrangements for the use of
Dijkstra-omp
- C语言和OpenMP编写的可在多核或SMP处理器上进行多线程运行的最短路径算法。可了解多核多线程和OpenMP的并行编程技术。-C language and can be prepared OpenMP or multi-core processors on SMP multi-threading to run the shortest path algorithm. Learn to multi-core multi-thread and OpenMP parallel programming
dijkstra
- 计算最短路径,根据单源最短路径算法中的Dijkstra‘s算法-computer Dijkstra s shortest path
Dijkstra
- 迪杰斯科拉算法:从某个源点到其余各顶点的最短路径-DiGisi Kola algorithm: from a source point to the remaining vertex of the shortest path
Dijkstra-althorim
- 这是一个基于JAVA实现的点对点(S-T)Dijkstra算法的改进。用于求两点间的所有最短路径。-this si a althorim named Dijkstra used for router
Dijkstra
- Dijkstra算法求单源最短路径 输入结点数关系数然后输入结点和其间的关及系权值,得出最短路径-Dijkstra algorithm for single-source shortest path relationship between the number of input nodes and then enter the node and which the Department of Customs and the right value, the shortest path ob
Dijkstra
- 求最短路径 基于单文档视图实现 并且有地图等显示功能-shortpath
Public-transport-system-the-best-path-algorithm.ra
- 公共交通最佳路径算法在分析城市道路网络最短路径算法 SP算法 和公交网络的特点的基础上,提出公共交通系 ( ) ( ) 统最佳路径算法.首先引入直达矩阵 T矩阵 和最小换乘矩阵 Q 矩阵 ,讨论公交网络节点间换乘 问题,得出最少换乘算法.利用 Q 矩阵确定节点间最少换乘次数,评价公交网络方便可达性.其次 ( ) 结合最少换乘算法,对最短路径算法 Dijkstra 算法 进行改进.在标号过程中,利用 Q 矩阵对待检验 T标号点进行筛选,减少 T 标号计算量,得到一条综合考虑
DIJKSTRA
- 最短路径问题是重要的最优化问题之一,在现实生活中具有重要意义,比如:管道铺设、线路安排。-The shortest path problem is an important one of the most optimization problems, in real life is of great significance, such as: pipeline, line arrangement.
dijkstra
- 解决图论中指定点到任意一点的最短路问题,并给出最短路径。-dijkstra
Graph
- 图的大部分实现 图的深度优先周游 图的广度优先周游 由队列方式实现的拓扑排序 由深度优先搜索方式实现的拓扑排序 单源最短路径(Dijkstra算法) 每对顶点之间的最短路径(Floyd算法) 最小支撑树(Prim算法) 最小支撑树(Kruskal算法)-Figure most of the implementation diagram of the depth-first breadth-first tour travel map be achieved by the topological s
Dijkstra
- 用Dijkstra法求最短路径,有向图与无向图均可-void ShortestPath_DIJ( Node a ,Status i ,Status v0 ,Status*D ,Status*pre ) { int v,w,j,l=1 Status*final Status min final=(Status*)malloc( sizeof(Status)*i ) for(v=0 v<i v++) { final[v]=FA
dijkstra_z
- 单源dijkstra邻接阵形式 单源最短路径,dijkstra算法,邻接阵形式,复杂度O(n^2)-Dijkstra adjacency matrix form of single-source single-source shortest path, dijkstra algorithm, adjacency matrix form, the complexity of O (n ^ 2)
ijkstra_binary_heap
- 单源最短路径,dijkstra算法+二分堆,邻接表形式,复杂度O(mlogm)-Single-source shortest path, dijkstra algorithm+ 2 sub-heap, adjacency list form, complexity of O (mlogm)
dijkstra
- 迪杰斯特拉算法 计算图中两点间的最短路径-dijkstra
Dijkstra
- 最短路径选取算法在地图中的实现-Shortest path selection algorithm in the realization of the map
Dijkstra
- Dijkstra算法(最短路径法)的matlab应用程序-Dijkstra algorithm (shortest path method) of matlab applications