搜索资源列表
shortestroadsearch
- 求解最短路径的各种算法,包括dijstra、floyd等,用dilphi编写,稍有不成熟之处,还望批评指正-solving the shortest path algorithm, including dijstra, floyd. dilphi prepared with a little premature's Office, also criticized the correct look
Floyd
- Floyd最短路径算法的MATLAB程序,经过测试
floy
- floyd算法 数据结构 求最短路径
Floyd-Warshall-c-chengxi
- 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)算法结
Floyd
- floyd算法 floyd算法
floyd.rar
- floyd算法Matlab的m文件,输出任意两点间的最短路径。,floyd算法Matlab的m文件,输出任意两点间的最短路径。
GraphFloyd
- 建立了图的基类,并且附有球最短路径问题的floyd算法的具体代码-The establishment of a map base class, and the ball with the shortest path problem floyd algorithm specific code
Graph
- 图的基类以及最短路径算法,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 algorith
Shortest-path
- 弗洛伊德(Floyd)算法 MPI并行算法 MPI.h MPI.c源码-Floyd (Floyd) algorithm source MPI parallel algorithm MPI.h MPI.c
floyd
- floyd算法计算最短路的matlab源程序-floyd calculated
Floyd
- Floyd算法,使用C语言算法编写很好很好的,非常专业化的-Floyd Algorithm.Using the C language coding
shuzhifenxi
- Floyd算法,很好 的专业算法。北航数据结构课程作业源代码-Floyd algorithm, very, very good professional algorithm
floyd-matlab
- floyd算法,用于计算网络节点间的最短距离-failed to translate
Floyd
- 对最短路径算法的研究,是matlab的,用于研究最短路径算法-Study on the algorithm of the shortest path, matlab algorithm for the shortest path,
Floyd
- 佛洛伊德演算法,可用於算最短路徑,方便好用 -Floyd Warshall algorithm
shortestPath
- dijkstra最短路径求解。floyd算法。-dijkstra Shortest Path Problem. floyd algorithms.
Floyd
- 这是一个完整可用的flyod的计算算法。我们可以通过flyod对图论进行快速的分析和解算。-This is a complete flyod algorithm for computing. We can quickly analyze and solve the graph theory through flyod.
MPI_OpenMP_code
- 压缩包里包含几个用C编写的并行代码,运行无误。其中包括,电路满足性的MP程序,floyd算法MPI代码,Sieve_Eratoshenes筛法MPI代码,矩阵相乘的MPI代码以及计算PI值的OpenMP代码。-Which contains several parallel programs written in C to run correctly. Among them, including Floyd algorithm procedures, matrix multiplication M
MPI-and-OpenMP-parallel-programming
- 《MPI与OpenMP并行程序设计(C语言版)》是美国Oregon州立大学的Michael J.Quinn教授在多年讲授“并行程序设计”课程的基础上编写而成的,主要介绍用C语言,并结合使用MPI和OpenMP进行并行程序设计,内容包括并行体系结构、并行算法设计、消息传递编程、Eratosthenes 筛法、Floyd 算法、性能分析、矩阵向量乘法、文档分类、蒙特卡洛法、矩阵乘法、线性方程组求解、有限差分方法、排序、快速傅立叶变换、组合搜索、共享存储编程、融合OpenMP和MPI以及5个附录。-&
floyd
- 适用于APSP(All Pairs Shortest Paths,多源最短路径),是一种动态规划算法,稠密图效果最佳,边权可正可负。此算法简单有效-floyd All Pairs Shortest Paths