最短路径 Floyd算法

最短路径——Floyd

算法4：Floyd算法

• 求每对节点之间最短距离问题：例如，求一个图的直径，即所有最短路径中最长的。

• 如果多次调用单源最短路径算法，效果并不好。特别是对有负边的图。

• 如果无负环，则有简单的Floyd-warshell算法。这是动态规划算法。

动态规划算法

定义DP[i][j][k] = 路径中间只允许经过节点1…k的情况下，i到j的最短路距离

它的两种情况

最短路经过点k，DP[i][j][k] = DP[i][k][k-1] + DP[k][j][k-1]

最短路不经过点k，DP[i][j][k] = DP[i][j][k-1]

综合起来的状态转移方程

DP[i][j][k] = min (DP[i][k][k-1] + DP[k][j][k-1], DP[i][j][k-1])

边界条件

DP[i][j][0] = len[i][j] (不存在的记为Inf)

算法描述

Floyd( )
	for i = 1 to N do
		for j = 1 to N do
			Dis[i][j] = Len[i][j]
	for k = 1 to N do
		for i = 1 to N do
			for j = 1 to N do
				Dis[i][j] = min(Dis[i][j], Dis[i][k] + Dis[k][j])

C语言程序

//有向图的Floyd
#include <algorithm>
#include <cstdio>
#include <cstring>

using namespace std;
int DP[105][105];
int Len[105][105];
int V, E, Start, End, Weight;

void Floyd( ) {
	for (int i = 1; i <= V; i++) {
		for (int j = 1; j <= V; j++) {
			DP[i][j] = Len[i][j];
		}
	}
	for (int k = 1; k <= V; k++) {
		for (int i = 1; i <= V; i++) {
			for (int j = 1; j <= V; j++) {
				DP[i][j] = min(DP[i][j], DP[i][k] + DP[k][j]);
			}
		}
	}
}

int main( ) {
	memset(Len, 0x3f, sizeof(Len));
	scanf("%d%d", &V, &E);
	for (int i = 1; i <= E; i++) {
		scanf("%d%d%d", &Start, &End, &Weight);
		Len[Start][End] = min(Len[Start][End], Weight);
	}
	for (int i = 1; i <= V; i++) {
		Len[i][i] = 0;
	}
	Floyd( );
	printf("           ");
	for (int i = 1; i <= V; i++) {
		printf("%-11d", i);
	}
	printf("\n");
	for (int i = 1; i <= V; i++) {
		printf("%-11d", i);
		for (int j = 1; j <= V; j++) {
			printf("%-11d", DP[i][j]);
		}
		printf("\n");
	}
	return 0;
}