搜索资源列表
dijkstra.tar
- 实现Dijkstra算法:算法首先打印一个图,然后用户给出一个起始点和终止点,算法就可以给出这两个点之间的最短距离,或提示没有路径。-Implementation Dijkstra algorithm: algorithm first print a map, then give users a starting point and termination point, the algorithm can give these two
DIJKSTRAs
- 这是从点S到T找寻最短路径的Dijkstra算法-Find shortest path from point S to piont T for positive weight matrix W by Dijkstra method. This is the fastest routine.
chengshidaoluzuiduanDijkstra
- 城市道路最短路径的Dijkstra算法优化,应用于城市交通规划-Dijkstra
Dijkstra
- 最短路的Dijkstra算法,程序用c#语言实现-The Dijkstra shortest path algorithm, the procedure with c# language implementation
Dijkstra
- Dijkstra算法--c++源代码 单源最短路径问题,或者称为最短路径问题,是要确定从s到V中没一个其他 顶点的距离,这里从顶点s到x的距离定义为从s到x的最短路径问题。-Dijkstra algorithm- c++ source code for single-source shortest path problem, or known as the shortest path problem is to determi
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 a
dij
- 这是一个将Dijkstra算法的时间复杂度从O(n*n) 优化为O(nlogn)的方法-This method can reduce time complexity from O(n*n) to O(nlogn) for Dijkstra s algorithm.
dijkstra
- Dijkstra算法 邻接表向量实现(求最短路径及具体走法) -Dijkstra algorithm to achieve adjacency list vector (for the shortest path and the specific moves)
Dijkstra
- Dijkstra算法 实现Dijkstra算法。 要求:对有向网络用Dijkstra算法求出单源最短路径。 -Dijkstra algorithm Dijkstra algorithm. Requirements: on the network using Dijkstra algorithm to find single-source shortest path.
Dijkstra
- 最短路径算法 C语言版的 很好用 需要的试试吧-Shortest path algorithm C language version of the well with
shortest
- Dijkstra算法通过邻接表实现最短路径,-Dijkstra algorithm to achieve the shortest path adjacency list,
dijkstra
- 用C语言实现dijkstra算法-Using C language algorithm dijkstra
Dijkstra
- 利用C++实现的dijkstra算法,希望对大家有帮助-the implementation of dijkstra . share it with friends
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
- Dijkstra算法的基本思路是:假设每个点都有一对标号 (dj, pj),其中dj是从起源点s到点j的最短路径的长度 (从顶点到其本身的最短路径是零路(没有弧的路),其长度等于零);pj则是从s到j的最短路径中j点的前一点。求解从起源点s-Dijkstra algorithm is the basic idea: the assumption that each point has a pair of numbers (dj, pj
Dijkstra
- 带权有向图最短路径算法 Dijkstra算法-Weighted directed graph shortest path algorithm shortest path algorithm Dijkstra algorithm
Dijkstra
- 用弗洛伊德算法和狄克斯特拉算法实现求最短路径-Algorithm and狄克斯特拉with Freud for the shortest path algorithm
Introduction_to_Algorithm
- 常见算法设计的源代码。配合著名的那本“算法导论”。其中主要包括: 归并排序 活动选择问题 矩阵链乘问题 矩阵链乘问题的备忘录解法 逆序对问题 求和问题 装配线问题 最短路径Dijkstra算法和堆操作 -Common algorithm design of the source code. With the well-known that the " Introduction to Al
Dijkstra_MapX_VB
- VB+MapX实现Dijkstra算法,通过输入起始点坐标可以得到两点间的最短路径-Implement the Dijkstra algorithm By Visual Basic And MapX5.0