Location:
Search - Warshall
Search list
Description: a、要求已知一个关系矩阵R，利用warshall算法求它的闭包R+
b、有良好的用户界面
c、有一个用于演示warshall算法的demo关系矩阵
d、能够求出用户输入的任何关系矩阵的闭包
e、能够将用户要求的结果清晰的显示在终端上
-a, a requirement known matrix R, warshall algorithm for the use of its closure R b, a good user interface c, an algorithm for demonstrating warshall demo matrix d, user input can be obtained in any relationship matrix Closure e, can be user requirements the results clearly show that the terminal
Platform: |
Size: 7634 |
Author: 张大鹏 |
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的连通情况。
Platform: |
Size: 3567 |
Author: 江晨 |
Hits:
Description: a、要求已知一个关系矩阵R，利用warshall算法求它的闭包R+
b、有良好的用户界面
c、有一个用于演示warshall算法的demo关系矩阵
d、能够求出用户输入的任何关系矩阵的闭包
e、能够将用户要求的结果清晰的显示在终端上
-a, a requirement known matrix R, warshall algorithm for the use of its closure R b, a good user interface c, an algorithm for demonstrating warshall demo matrix d, user input can be obtained in any relationship matrix Closure e, can be user requirements the results clearly show that the terminal
Platform: |
Size: 232448 |
Author: 张大鹏 |
Hits:
Description:
每对节点间最短路径
Floyd-Warshall 算法
D[i,j]表示从i到j的最短距离；
P[i,j]表示从i到j的最短路径上j 的父节点-between each pair of nodes Shortest Path Floyd-Warshall algorithm D [i, j] said from i to j is the shortest distance; P [i, j] said from i to j the shortest path on the parent node j
Platform: |
Size: 9216 |
Author: changxia |
Hits:
Description: 用C语言实现最短路径算法中的Floyd-Warshall算法，这个算法可以用来解决信号处理中的一些问题。floyd_warshall.c是源程序；distance_2.txt文件存放图中各点之间的距离，以99999表示无穷大；floyd.txt文件是输出文件，其中存放各轮得到的输出矩阵，以及最后得到的各点间最短距离，如果有负回路则返回FALSE。-C language shortest path algorithm of Floyd-Warshall algorithm, The algorithm can be used to solve signal processing some of the problems. Floyd_warshall.c yes source; distance_2.txt document storage map of the distance between points, 99,999 said to infinity; floyd.txt document output files, which kept the round of the output matrix, and finally come to the point of the shortest distance, If there is a negative loop it returns FALSE.
Platform: |
Size: 162816 |
Author: 李文 |
Hits:
Description: 图论算法库 C++ 语言实现 代码内容 图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。 该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。 虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 - -graph theory is the C language code as graph theory algorithm library, including the following algorithm : single source Dijkstra shortest path algorithm for single-source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall algorithm language C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, VisualAge C 4.0 debugging through. The compressed file contains Graph.h all library functions, procedures call interface see Notes. Other documents are used to test the algorithm testing procedures, the VisualAge C compiler running under 4.0. The algorithm is to participate in the ACM/ICPC contest and the preparation of information, because the competit
Platform: |
Size: 4096 |
Author: |
Hits:
Description: 编译原理中在自下而上分析和优先分析方法中使用的Washall算法-Compilation Principle of priority in the bottom-up analysis and analytical methods used in Washall algorithm
Platform: |
Size: 31744 |
Author: |
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: 解决图论中Warshall-Floyd 算法，Kruskal 避圈法，匈牙利算法，求最佳匹配的算法，求最大流的Ford--Fulkerson 标号算法，求解最小费用流问题的matlab程序-Solve the graph theory Warshall-Floyd algorithm, Kruskal avoid lap law, Hungary algorithm, and the best matching algorithm, for maximum flow of the Ford- Fulkerson labeling algorithm for solving the minimum cost flow problem of matlab procedures
Platform: |
Size: 47104 |
Author: yangfei |
Hits:
Description: 图论算法库 C++ 语言实现 代码内容 图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。-Graph Theory Algorithm Library C++ Language code realize the contents of graph theory algorithm library, which includes the following algorithms: single-source shortest path Dijkstra algorithm for single-source shortest path Bellman-Ford algorithm Prim minimum spanning tree algorithm between each pair of nodes Flod-Warshall shortest path algorithm Language C++ compiler platform VisualAge C++ 4.0 Author starfish (starfish.h @ china.com) Remarks procedures used C++ language in VisualAge C++ 4.0 debugging through.
Platform: |
Size: 1024 |
Author: 王兵 |
Hits:
Description: 编程实现《图论》中著名的Warshall算法，输出输出格式参见源代码-Programming, " Graph Theory" of well-known Warshall algorithm, the output output format, see the source code
Platform: |
Size: 154624 |
Author: 彭艺 |
Hits:
Description: 用Warshall算法求二元关系的传递闭包。输入一个N*N的0、1矩阵M，将矩阵M作为二元关系的关系矩阵，用Warshall 算法求出A的传递闭包M，输出M。-Warshall algorithm is seeking to use the transitive closure of binary relations. Enter an N* N of the 0,1 matrix M, the matrix M as a binary relation, the relationship between the matrix A, with the Warshall algorithm for transitive closure find M, the output M.
Platform: |
Size: 14336 |
Author: jhp627 |
Hits:
Description: 实现数学中的warshall算法，既完成对传递闭包的求解-To achieve in mathematics warshall algorithm, both to complete the transitive closure of the solution
Platform: |
Size: 1388544 |
Author: 麦穗 |
Hits:
Description: warshall算法代码，便于计算关系矩阵的传递闭包，同时便于计算强分图-warshall algorithm code
Platform: |
Size: 462848 |
Author: 洪学飙 |
Hits:
Description: 离散数学中的warshall算法c语言实现代码，写的很辛苦的-Discrete Mathematics warshall algorithm c language code, written in a very hard
Platform: |
Size: 225280 |
Author: gunner |
Hits:
Description: warshall算法，系统工程里经常用到的，求可达性矩阵的算法。-warshall algorithm, often used in engineering, seeking up to matrix algorithms.
Platform: |
Size: 9216 |
Author: fanmin |
Hits:
Description: Floy-Warshall算法的一个具体应用实例。用于解决城市消防队选址问题-Floy-Warshall algorithm for a specific application example. Used to address the city fire department location problem
Platform: |
Size: 156672 |
Author: Mengxianyu |
Hits:
Description: 用c++实现离散数学中wahshall算法计算可传递闭包的程序-warshall
Platform: |
Size: 8192 |
Author: mzy |
Hits:
Description: floyd warshall algorithm
Platform: |
Size: 1024 |
Author: paulicim |
Hits:
Description: 使用warshall寻找最短路径，IDE使用的是QT5.8(use the warshall to find the shortest road)
Platform: |
Size: 116736 |
Author: 五啦啦啦 |
Hits: