Floyd-Warshall多源最短路径
来源:互联网 发布:英国病人小说知乎 编辑:程序博客网 时间:2024/06/06 11:01
Floyd-Warshall多源最短路径
const int MAXN = 101 ;
const int INF = 1000000 ;
int g[MAXN][MAXN];
int d[MAXN][MAXN];
int floyd( int n)
{
int i, j, k;
for (i = 1 ; i <= n; i ++ )
for (j = 1 ; j <= n; j ++ )
d[i][j] = g[i][j];
for (k = 1 ; k <= n; k ++ )
{
for (i = 1 ; i <= n; i ++ )
for (j = 1 ; j <= n; j ++ )
{
if (d[i][k] < INF && d[k][j] < INF
&& d[i][k] + d[k][j] < d[i][j])
d[i][j] = d[i][k] + d[k][j];
}
}
return 0 ;
}
const int INF = 1000000 ;
int g[MAXN][MAXN];
int d[MAXN][MAXN];
int floyd( int n)
{
int i, j, k;
for (i = 1 ; i <= n; i ++ )
for (j = 1 ; j <= n; j ++ )
d[i][j] = g[i][j];
for (k = 1 ; k <= n; k ++ )
{
for (i = 1 ; i <= n; i ++ )
for (j = 1 ; j <= n; j ++ )
{
if (d[i][k] < INF && d[k][j] < INF
&& d[i][k] + d[k][j] < d[i][j])
d[i][j] = d[i][k] + d[k][j];
}
}
return 0 ;
}
- Floyd-Warshall多源最短路径
- 多源最短路径--Floyd-Warshall算法
- 多源最短路径问题-floyd warshall
- 多源最短路径算法---Floyd-Warshall
- 多源最短路径-Floyd-Warshall—C
- 数据结构与算法系列----多源最短路径(Floyd-Warshall算法)
- 只有五行的算法——多源最短路径 Floyd-Warshall
- 多源最短路径——floyd-Warshall算法的拓展
- PKU1125 最短路径 Floyd-Warshall算法
- Dijkstra/Floyd-Warshall 最短路径算法
- Floyd Warshall 弗洛伊德算法---最短路径
- 最短路径(Floyd-warshall)
- 最短路径之Floyd-Warshall
- Floyd-Warshall
- Floyd-Warshall
- Floyd-Warshall
- floyd-warshall
- Floyd-Warshall
- Max product
- Xlight.FTP.Server.v2.83.Professional-YAG
- STL小结(原创)
- SlySoft.Game.Jackal.Pro.v3.0.0.5-YAG
- Runtime.Captain.Nemo.Pro.v4.10-YAG
- Floyd-Warshall多源最短路径
- Shortest Palindromes
- 线段树模板
- An Interesting Set
- 猫和老鼠
- 辉辉的一天
- 字符串hash函数
- 图论算法
- 电脑小知识130条