Location:
Search - Dijkstra Floyd
Search list
Description: 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)算法结束：dis即为所有点对的最短路径矩阵
3)算法小结：此算法简单有效，由于三重循环结构紧凑，对于稠密图，效率要高于执行|V|次Dijkstra算法。时间复杂度O(n^3)。
考虑下列变形：如(I,j)∈E则dis[I,j]初始为1,else初始为0，这样的Floyd算法最后的最短路径矩阵即成为一个判断I,j是否有通路的矩阵。更简单的，我们可以把dis设成boolean类型，则每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”来代替算法描述中的蓝色部分，可以更直观地得到I,j的连通情况。
Platform: |
Size: 3567 |
Author: 江晨 |
Hits:
Description: 最短路径的分析，可以用于理解迪克杰拉和FLOYD的算法。-shortest path analysis can be used to understand and Dikejiela FLOYD algorithm.
Platform: |
Size: 12288 |
Author: wtr |
Hits:
Description: 包含Dijkstra、Floyd、kruskal、动态规划、随机数生成等MATLAB程序-Contains Dijkstra, Floyd, kruskal, dynamic programming, random number generator, such as MATLAB program
Platform: |
Size: 149504 |
Author: chen |
Hits:
Description: 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)算法结束：dis即为所有点对的最短路径矩阵
3)算法小结：此算法简单有效，由于三重循环结构紧凑，对于稠密图，效率要高于执行|V|次Dijkstra算法。时间复杂度O(n^3)。
考虑下列变形：如(I,j)∈E则dis[I,j]初始为1,else初始为0，这样的Floyd算法最后的最短路径矩阵即成为一个判断I,j是否有通路的矩阵。更简单的，我们可以把dis设成boolean类型，则每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”来代替算法描述中的蓝色部分，可以更直观地得到I,j的连通情况。
-err
Platform: |
Size: 3072 |
Author: 江晨 |
Hits:
Description: 这个是严蔚敏版的数据结构上机教程中的部分源代码，都是自己写的，包括最短路径的dijkstra,floyd，最小生成树的prim,kruskal以及链表，Huffman Tree等等的c++代码-This is Yan Wei-min version of the data structure on the machine part of the tutorial source code, are written in their own, including the shortest path dijkstra, floyd, minimum spanning tree of the prim, kruskal as well as the list, Huffman Tree, etc. c++ code
Platform: |
Size: 12288 |
Author: wang yucao |
Hits:
Description: //有向图:有向图,无向图基本操作
//运行环境：VC
//有向图,无向图基本操作,包括:
//1、邻接矩阵
//2、邻接表
//3、深度优先遍历
//4、广度优先遍历
//5、最小生成树
//6、拓扑排序
//7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic operation// Operating Environment: VC// directed graph, undirected graph basic operation, including:// 1, adjacency matrix// 2, the adjacent table// 3 , depth-first traversal// 4, breadth-first traversal// 5, minimum spanning tree// 6, topological sorting// 7, each of the shortest path between vertices (Dijkstra, Floyd two algorithms)
Platform: |
Size: 3072 |
Author: atom |
Hits:
Description: 图的基类以及最短路径算法，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 algorithm.
Platform: |
Size: 663552 |
Author: 张淼 |
Hits:
Description: Dijkstra最短路算法 .详细中文注释.-Dijkstra shortest path algorithm. Detailed English Notes.
Platform: |
Size: 1024 |
Author: Jiandong Yang |
Hits:
Description: java 实现的一些算法： 赛选法求素数，最短路径（dijkstra，floyd），线段树，LCD，LCM-java implementation of a number of algorithms: tournament selection method Primes, the shortest path (dijkstra, floyd), segment tree, LCD, LCM
Platform: |
Size: 21504 |
Author: daniel cao |
Hits:
Description: 实现Floyd算法，并求所示有向图中各顶点之间的最短路径及其长度。-Floyd algorithm to achieve, and for directed graph shown in between the vertex and the length of the shortest path.
Platform: |
Size: 1024 |
Author: wangjing |
Hits:
Description: 包含dijkstra、Floyd、kruskal、动态规划、随机数生成等matlab程序
包含dijkstra、Floyd、kruskal、动态规划、随机数生成等matlab程序-Contains dijkstra, Floyd, kruskal, dynamic programming, random number generation, etc. matlab process consists of dijkstra, Floyd, kruskal, dynamic programming, random number generation and so on matlab program
Platform: |
Size: 149504 |
Author: stephen |
Hits:
Description: 说明：这是个在公园里各景点之间最短路径的控制台程序。非常好，使用dijkstra,floyd算法-Note: This is the various attractions in the park where the shortest path between the console program. Very good, using dijkstra, floyd algorithm
Platform: |
Size: 214016 |
Author: 将军 |
Hits:
Description: Weighted diagram/undiagram plus dijkstra/floyd algorithm ,shortest path between every two pair vertex.
Platform: |
Size: 5120 |
Author: ineeddownload |
Hits:
Description: Dijkstra算法及逆向Dijkstra算法的matlab软件实现，很方便很实用-D algorithm and reverse D algorithm
Platform: |
Size: 10240 |
Author: 林逸墨 |
Hits:
Description: dijkstra floyd 匈牙利算法
最小流算法-dijkstra floyd minimum flow algorithm Hungarian algorithm
Platform: |
Size: 4096 |
Author: 张俊峰 |
Hits:
Description: Floyd算法又称为插点法，是一种利用动态规划的思想寻找给定的加权图中多源点之间最短路径的算法，与Dijkstra算法类似。(Shortest path algorithm)
Platform: |
Size: 1024 |
Author: xly1233333
|
Hits:
Description: 移动机器人的最优路径规划 Dijkstra 算法程序代码 路径规划程序(path planning
Optimal path planning of mobile robot Dijkstra algorithm code path planning program)
Platform: |
Size: 1024 |
Author: alan40
|
Hits:
Description: 最短路径的典型算法——Dijkstra、Floyd。使用C++语言，对算法使用类模板，可方便开发者直接调用。文件中包含了图的ADT(The shortest path of the typical algorithm - Dijkstra, Floyd. Use C + + language, the use of class template algorithm can be convenient for developers to call directly. The document contains the figure ADT)
Platform: |
Size: 23552 |
Author: 启明jun
|
Hits:
Description: Floyd算法又称为插点法，是一种利用动态规划的思想寻找给定的加权图中多源点之间最短路径的算法，与Dijkstra算法类似(Floyd algorithm, also called plug point method, is an algorithm based on the idea of dynamic programming to find the shortest path between multiple source points in a weighted graph, similar to the Dijkstra algorithm.)
Platform: |
Size: 79872 |
Author: 盖世帝尊 |
Hits:
Description: 数据解构中的经典算法，图的最短路径算法之迪杰斯特拉和弗洛伊德的C++实现(Classic algorithms in data deconstruction, Dijkstra's and Floyd's C++ implementation of the shortest path algorithm of graphs)
Platform: |
Size: 1024 |
Author: 大爱快船 |
Hits: