CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - floyd warshall
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - floyd warshall - List
[
Other resource
]
Floyd-Warshall-c-chengxi
DL : 0
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的连通情况。
Date
: 2008-10-13
Size
: 3.48kb
User
:
江晨
[
Data structs
]
graphic_algorithm
DL : 0
每对节点间最短路径 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
Date
: 2025-07-11
Size
: 9kb
User
:
changxia
[
Mathimatics-Numerical algorithms
]
floyd_warshall
DL : 0
用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.
Date
: 2025-07-11
Size
: 159kb
User
:
李文
[
source in ebook
]
Floyd-Warshall-c-chengxi
DL : 0
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
Date
: 2025-07-11
Size
: 3kb
User
:
江晨
[
Data structs
]
FLOYD
DL : 0
数据结构中有关FLOYD算法的VC++程序,帮助大家理解FLOYD这个数据结构-Data structure relating to FLOYD algorithm VC++ Procedures to help everyone understand the data structure FLOYD
Date
: 2025-07-11
Size
: 1.78mb
User
:
杨博
[
Windows Develop
]
floyd
DL : 0
Floyd算法,计算任意两点间的最短路径,并加入MFC和文件操作,比较实用。-Floyd algorithm to calculate arbitrary shortest path between two points, and to join MFC and file operations, more practical.
Date
: 2025-07-11
Size
: 1.79mb
User
:
李亚飞
[
matlab
]
floyd
DL : 0
floyd求解最短路,并将路径还原。经过验证,程序中有清楚注释-floyd Solving the shortest path, and path restoration. After authentication, the Notes program has clearly
Date
: 2025-07-11
Size
: 1kb
User
:
steawen
[
matlab
]
Floyd
DL : 0
用来处理路径优化等问题的FLOYD等算法。-Used to deal with issues such as path optimization algorithm FLOYD, etc..
Date
: 2025-07-11
Size
: 5kb
User
:
崔宁
[
source in ebook
]
Graph
DL : 0
图的基类以及最短路径算法,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 algorithm.
Date
: 2025-07-11
Size
: 648kb
User
:
张淼
[
Other
]
matlab
DL : 0
floyd最短路算法&求网络的最小费用最大流&匈牙利算法&求网络的最小费用最大流-Floyd s short for network algorithm and the minimum cost flow and Hungary algorithm for the minimum cost and maximum flow network
Date
: 2025-07-11
Size
: 233kb
User
:
江奇
[
Windows Develop
]
johnson_floyd-washall
DL : 0
在windows下的Floyd-Warshall与johnson算法及性能比较-Under the windows with the Floyd-Warshall algorithm and performance comparison johnson
Date
: 2025-07-11
Size
: 3kb
User
:
sun
[
matlab
]
floyd
DL : 0
图和网络最短路径法则的弗洛伊德算法,从振动论坛下载。挺不错的哟-Network map and the law of the shortest path algorithm Freud, from the vibration of the forum to download. Pretty good yo. .
Date
: 2025-07-11
Size
: 2kb
User
:
田中玉
[
matlab
]
Floyd
DL : 0
此文介绍了floyd算法的一种改进方法,实践价值高,方法的创新性好-This article introduces an improved algorithm floyd methods, the practice of high value, innovative methods of good
Date
: 2025-07-11
Size
: 477kb
User
:
vumeng
[
Windows Develop
]
floydwarshall
DL : 0
floyd warshall algorithm in c-floyd warshall algorithm in c++
Date
: 2025-07-11
Size
: 1kb
User
:
lifeless
[
Algorithm
]
Floyd-Warshall
DL : 0
Floyd-Warshall algorithm for shortest path problem
Date
: 2025-07-11
Size
: 1kb
User
:
SomeOne
[
Algorithm
]
Floyd-Warshall
DL : 0
Floyd–Warshall algorithm
Date
: 2025-07-11
Size
: 1kb
User
:
profiler007
[
matlab
]
FastFloyd
DL : 0
floyd warshall algorithm
Date
: 2025-07-11
Size
: 1kb
User
:
arta
[
Mathimatics-Numerical algorithms
]
Floyd-Warshall
DL : 0
The Floyd-Warshall algorithm to find the shortest path
Date
: 2025-07-11
Size
: 1kb
User
:
aaaadddiii
[
Mathimatics-Numerical algorithms
]
Warshall-Floyd
DL : 0
floyd warshall algorithm
Date
: 2025-07-11
Size
: 1kb
User
:
paulicim
[
Other
]
dist
DL : 0
用最短路径算法算出特定两点之间的距离 输入:直接读取net.in文件 第一行为四个整数N,M,S,T,每两个整数之间用一个空格隔开,分别表示网络的节点(编号为1到N),网络线段数,以及起点终点编号 接下来M行,每行三个整数U,V,D,每个整数之间用空格隔开,表示节点U和V之间有一条线路相连,距离是D,(两个节点可能有多条线路) 输出:直接写入到net.out文件,输出只有一行,表示从S点到T点的最短距离(如果不通则输出-1) (N<=100,M<=N*N,D<=1000)(Use the shortest path algorithm to calculate the distance between two specific two points Input: read the net.in file directly The first behavior is four integers N, M, S and T. Every two integers are separated by a space, representing the node of the network (number 1 to N), the number of network segments, and the origin and destination number. Next, M row, each row three integers U, V, D, each integer is separated by spaces, indicating that there is a line between nodes U and V, the distance is D, (there may be multiple lines in two nodes). Output: write directly to net.out file, output only one line, which indicates the shortest distance from S point to T point (if it doesn't connect, output -1) (N<=100, M<=N*N, D<=1000). Floyd-Warshall algorithm)
Date
: 2025-07-11
Size
: 3.18mb
User
:
kelin6
«
1
2
3
4
»
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.