搜索资源列表
SJ5_6
- 弗洛伊德算法--最短路径 文件上穿为.cpp格式-Floyd algorithm-- the shortest path to wear paper. Cpp format
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_warshall
- 用C语言实现最短路径算法中的Floyd-Warshall算法，这个算法可以用来解决信号处理中的一些问题。floyd_warshall.c是源程序；distance_2.txt文件存放图中各点之间的距离，以99999表示无穷大；floyd.txt文件是输出文件，其中存放各轮得到的输出矩阵，以及最后得到的各点间最短距离，如果有负回路则返回FALSE。-C language shortest path algorithm of Floyd-W
FloydMATLAB
- Floyd算法，推荐-Floyd algorithm, recommended clamor clamor clamor clamor clamor
floydsf
- 最短路算法------floyd算法 -shortest path algorithm------ floyd Algorithm
zhudlj
- 最短路径的分析，可以用于理解迪克杰拉和FLOYD的算法。-shortest path analysis can be used to understand and Dikejiela FLOYD algorithm.
floyd_MATLAB
- matlab impletion of floyd algorith-Matlab impletion of floyd algorith
xydy
- 示例校园导游系统C源码(佛罗伊德算法,带示例地图)-examples campus tour guides System C source (Floyd algorithm, with examples map)
Arithmetic
- 包含Dijkstra、Floyd、kruskal、动态规划、随机数生成等MATLAB程序-Contains Dijkstra, Floyd, kruskal, dynamic programming, random number generator, such as MATLAB program
BayerandFloyd-Steinberg
- 能够实现Bayer抖动显示图像及Floyd-Steinberg抖动显示图像，只支持256色的图像。-Jitter can be realized Bayer show images and show the Floyd-Steinberg dithering images, only support 256-color images.
TherealizationgofFloydarithmetibymatlab
- 用MATLAB仿真工具实现Floyd算法，求任意两端间的最短路径-MATLAB simulation tool used to achieve Floyd algorithm, for any shortest path between two ends
Mindistance
- 对于无向图或有向图，程序可以计算出图中每两个顶点之间的最短路径，并列出Floyd算法的具体实现-For undirected graph or directed graph, the program can calculate a figure between every two vertices of the shortest path, and lists the specific realize Floyd algorithm
IMGCaputre
- 包含两种图像显示方式，bayer抖动显示和floyd-steinberg抖动显示。-Contains two types of image display, bayer jitter display and show the floyd-steinberg dithering.
floy
- floyd算法 数据结构 求最短路径-floyd algorithm for data structure for shortest path
guide
- 采用floyd算法实现的校园导游系统,区别于迪杰斯特拉算法,包中有源代码,以及可以直接运行的exe文件!-Floyd algorithm using campus tour guide system, different from the Dijkstra algorithm, the package source code, and can directly run the exe file!
floydmatla
- 通用的floyd算法程序，能够很好地解决最短路径问题，同时给出最短路的具体路径。-Floyd algorithm universal procedures, able to solve the shortest path problem, shortest path at the same time given the specific path.
FLYD
- 最短路径——弗洛伊德算法，做了很长时间才做好的-The shortest path- Floyd algorithm, so a long time to do a good job of
floyd
- 简单的floyd运用 第一行输入一个整数C。C是测试的情况（0< C <=30）.第二行一个正整数N( 0< N <=100),表示道路的总数.紧接N行，每一行包含两个字符串， Si,，Ti，和一个整数Di,代表从Si到Ti的距离(0<= Di <=150)。最后一行有两个字符串，S 和 T，你得找出从S 到 T的最短的距离。地名是不超过120个小写字符的串（从‘a’到‘z’)。假设这里最多有
graphprogramming
- 解决图论中Warshall-Floyd 算法，Kruskal 避圈法，匈牙利算法，求最佳匹配的算法，求最大流的Ford--Fulkerson 标号算法，求解最小费用流问题的matlab程序-Solve the graph theory Warshall-Floyd algorithm, Kruskal avoid lap law, Hungary algorithm, and the best matching algorithm, f
floy
- Floyd算法的基本思想是，从邻接矩阵a开始进行n次迭代，第一次迭代后a[i,j]的值是从vi到vj且中间不经过变化大于1的顶点的最短路径长度；第k次迭代后a[i,j]的值是从vi到vj且中间不经过变化大于k的顶点的最短路径长度 第n次迭代后a[i,j]的值就是从vi到vj的最短路径长度。-Floyd algorithm for the basic idea is that from the adjacency matrix a sta