弗洛伊德算法（Java实现）

算法思路：

通过Floyd计算图G=(V,E)中各个顶点的最短路径时，需要引入两个矩阵，矩阵S中的元素a[i][j]表示顶点i(第i个顶点)到顶点j(第j个顶点)的距离。矩阵P中的元素b[i][j]，表示顶点i到顶点j经过了b[i][j]记录的值所表示的顶点。

假设图G中顶点个数为N，则需要对矩阵D和矩阵P进行N次更新。初始时，矩阵D中顶点a[i][j]的距离为顶点i到顶点j的权值；如果i和j不相邻，则a[i][j]=∞，矩阵P的值为顶点b[i][j]的j的值。 接下来开始，对矩阵D进行N次更新。第1次更新时，如果”a[i][j]的距离” > “a[i][0]+a[0][j]”(a[i][0]+a[0][j]表示”i与j之间经过第1个顶点的距离”)，则更新a[i][j]为”a[i][0]+a[0][j]”,更新b[i][j]=b[i][0]。 同理，第k次更新时，如果”a[i][j]的距离” > “a[i][k-1]+a[k-1][j]”，则更新a[i][j]为”a[i][k-1]+a[k-1][j]”,b[i][j]=b[i][k-1]。更新N次之后，操作完成！

public class Floyd算法 {

static int M = Integer.MAX_VALUE;
public static void main(String[] args){
int weight[][] = {
{0, M, 10, M, 30, 100},
{M, 0, 5, M, M, M},
{M, M, 0, 50, M, M},
{M, M, M, 0, M, 10},
{M, M, M, 20, 0, 60},
{M, M, M, M, M, 0}
};
Floyd(weight);
}
private static void Floyd(int[][] weight) {
// TODO Auto-generated method stub
int n = weight.length;
int path[][] = new int[n][n];           //存储的是i到j的前驱
//初始化
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
path[i][j] = j;
}
}
//计算最短路径，弗洛伊德的核心是三重循环,k作为中间点
for(int k = 0; k < n; k++){
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
int temp = (weight[i][k] == M || weight[k][j] == M ? M :(weight[i][k] + weight[k][j]));
if(weight[i][j] > temp){
weight[i][j] = temp;
path[i][j] = path[i][k];
}
}
}
}
for(int j = 0; j < n; j++){
if(weight[0][j] == M){
System.out.print("无穷大" + " ");
continue;
}
System.out.print(weight[0][j] + " ");
}
System.out.println();
for(int i = 0; i < n; i++){
for(int j = i + 1; j < n; j++){
int k = path[i][j];
if(weight[i][j] == M){
System.out.print("(" + i + "," + j + ")无穷大");
System.out.println();
continue;
}
System.out.print("(" + i + "," + j + ")" + weight[i][j] + ":  ");  
System.out.print(i);
while(k != j){
System.out.print("->" + k);
k = path[k][j];
}
System.out.println("->" + j);
}
System.out.println();
}
}
}