Location:
Search - c floyd
Search list
Description: 此程式為mfc visual c++ 6.0
內容包含讀檔、寫檔、複製、貼上、
bayer抖動顯示
floyd stdinberg抖動顯示
Platform: |
Size: 210106 |
Author: porkp617 |
Hits:
Description: 最短路径 迪杰斯特拉
最短路径 迪杰斯特拉-Shortest Path Floyd Shortest Path Floyd
Platform: |
Size: 23552 |
Author: lsx |
Hits:
Description: 用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。-from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.
Platform: |
Size: 38912 |
Author: |
Hits:
Description: Dijkstrat和Floyd算法实现。
算法请参考《通信网理论基础》周炯磐-Dijkstrat and Floyd algorithm. Algorithm Reference "communications network theoretical foundation", Zhou Jiong Line
Platform: |
Size: 239616 |
Author: 飞扬 |
Hits:
Description: Floyd-Steinberg算法的源代码.要注意的是，误差传播有时会引起流水效应，即误差不断向下，向右累加传播。解决的办法是：奇数行从左到右传播，偶数行从右到左传播。-Floyd-Steinberg algorithm source code. It should be noted, Error Propagation sometimes causes water effects, that is, constant downward error, right cumulative spread. The solution is : OK whatever odd communication, even from right-to-left line transmission.
Platform: |
Size: 1024 |
Author: 陆芸 |
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: floyd算法的C实现！！ ！！ ！！ 1-floyd algorithm realize the C! ! ! ! ! ! ! ! ! ! 1
Platform: |
Size: 1024 |
Author: zuowu |
Hits:
Description: Floyd最短路径算法的MATLAB程序，经过测试-Floyd shortest path algorithm of MATLAB procedures tested
Platform: |
Size: 1024 |
Author: zuotian |
Hits:
Description: floyd算法
数据结构
求最短路径-floyd algorithm for data structure for shortest path
Platform: |
Size: 258048 |
Author: Liang |
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: 实现Floyd算法的程序，用vc++编写，清楚易懂-Floyd algorithm realize the procedure, using vc++ Prepared, clear and understandable
Platform: |
Size: 209920 |
Author: damxie |
Hits:
Description: 数据结构中有关FLOYD算法的VC++程序，帮助大家理解FLOYD这个数据结构-Data structure relating to FLOYD algorithm VC++ Procedures to help everyone understand the data structure FLOYD
Platform: |
Size: 1862656 |
Author: 杨博 |
Hits:
Description: 【佛洛伊德最短路徑解】Dev-C++
Floyd minimum path
以陣列的方式運算得到最短路徑陣列解-The shortest path solution Freudian [] Dev-C++ Floyd minimum path to the array of ways to be the shortest path computation array solution
Platform: |
Size: 3072 |
Author: echo |
Hits:
Description: 最短路径的Floyd算法，是用ｃ＃编的，经典的算法-Floyd shortest path algorithm, is made with c
Platform: |
Size: 29696 |
Author: 史习云 |
Hits:
Description: floyd算法c实现，可以用来求所有节点对之间的最短路径值。-implementation of floyd algorithm using c
Platform: |
Size: 1024 |
Author: wyg |
Hits:
Description: floyd算法c实现，可以用来求所有节点对之间的最短路径值。-implementation of floyd algorithm using c
Platform: |
Size: 3681280 |
Author: wyg |
Hits:
Description: Floyd-wharshall algoritm for the shortest path problem. I wrote this in C. It s easy to compile and work in all *nix like systems.-Floyd-wharshall algoritm for the shortest path problem. I wrote this in C. It s easy to compile and work in all*nix like systems.
Platform: |
Size: 27648 |
Author: lupsyn |
Hits:
Description: Floyd s algorithm in C-Floyd s algorithm in C++
Platform: |
Size: 8192 |
Author: anan |
Hits:
Description: It is the source code of the Floyd-Warshall algorithm for finding the shortest path between all nodes.
The shortest path between two nodes of a graph is a sequence of connected nodes so that the sum of the edges that inter-connect them is minimal
Platform: |
Size: 8192 |
Author: Roger |
Hits:
Description: floyd warshall algorithm in c-floyd warshall algorithm in c++
Platform: |
Size: 1024 |
Author: lifeless |
Hits: