搜索资源列表
graph
- 关于数据结构中图的一些算法，包括Dijkstra、Floyd-Warshall等-About some algorithms about graph, including Dijkstra, Floyd-Warshall
Floyd-Warshall
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法-Floyd algorithm, also known as Freud algorithm, the insertion point method is an algorithm used to find the shortest path between vertices given weighted graph. The algorithm name to one of the founders,
Floyd
- 佛洛伊德演算法，可用於算最短路徑，方便好用 -Floyd Warshall algorithm
Graph
- 图论的各种最短路算法,竞赛用 包括dijkstra、Bellman-Ford（SPFA）、Floyd-Warshall、优先队列的应用等-A variety of graph theory shortest path algorithm, racing including dijkstra, Bellman-Ford (SPFA), Floyd-Warshall, the application of the priority queue
Warshall
- wallshall 算法改进 改进后的wallshall算法-wallshall Algorithm improved wallshall algorithm
Floyd-and-Warshall
- 用matlab实现Floyd和Wallshell算法，基本功能都有-Floyd and Wallshell using matlab algorithm, the basic function
FloydWarshall
- Floyd Warshall- Adjacency Matrix
LIANTONGXING
- 通信网实验通过warshall和矩阵幂算法判断图的连通性，运用图的遍历方法计算图的连通分支数-The number of branches connected communication network experiment warshall and matrix power algorithm to determine the connectivity graph, use graph traversal methods of calculation map
short_road
- 最短路Warshall算法的matlab编程，用于实现最短路问题的求解。-Warshall shortest path algorithm for solving matlab programming, to achieve the shortest path problem.
tulun1
- 图论算法，matlab实现.用 Warshall-Floyd 算法-Graph theory algorithm, matlab to achieve
R-closure
- 用C语言编写程序，实现用Warshall算法解决关系R的传递闭包问题-Write a program in C language, implemented by Warshall algorithm to solve relationship problems transitive closure R
Parallel-Floyd-Warshall-Algorithm-using-Intel-TBB
- Parallel Floyd Warshal Algorithm using INTEL T-Parallel Floyd Warshal Algorithm using INTEL TBB
tulun
- 通过邻接矩阵求可达性矩阵与距离矩阵，用warshall算法与弗洛伊德算法-Seeking reachability matrix and adjacency matrix the matrix by using warshall algorithm and Floyd algorithm
RoyWarshall
- This is a Javascr ipt implementation of Roy Warshall algoritm. It is very easy to use. Some parts of the codes and the GUI are in romanian, but is easy to translate with Google Translate.
floyd-knapsack
- floyd knapsack Floyd-Warshall算法（Floyd-Warshall algorithm）是解决任意两点间的最短路径的一种算法，可以正确处理有向图或负权的最短路径问题，同时也被用于计算有向图的传递闭包。Floyd-Warshall算法的时间复杂度为O(N3)，空间复杂度为O(N2)。 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总
s_path
- Find shortest path using floyd warshall algorithm
Archive
- 弗洛伊德算法的MPI+openmp实现. 运行指令在bash文件中。导入文件是3000个点，可以自行修改带入文件-Floyd Warshall algorithm achieved by MPI+openmp
Floyd__Warshall
- Floyd warshall implementaion
a201702122
- 通常可以在任何图中使用，包括有向图、带负权边的图。 Floyd-Warshall 算法用来找出每对点之间的最短距离。它需要用邻接矩阵来储存边，这个算法通过考虑最佳子路径来得到最佳路径。 1.注意单独一条边的路径也不一定是最佳路径。 2.从任意一条单边路径开始。所有两点之间的距离是边的权，或者无穷大，如果两点之间没有边相连。 对于每一对顶点 u 和 v，看看是否存在一个顶点 w 使得从 u 到 w 再到 v 比己知的路径更短。如果是更新它。 3.不可思议的是，只要按
qhqqirealgorithmfor
- a,要求已知一个关系矩阵R,利用warshall算法求它的闭包R-A, require a known relationship matrix R, R using warshall algorithm for its closure