Floyd-Warshall算法(Floyd-Warshall algorithm)是解决任意两点间的最短路径的一种算法,可以正确处理有向图或负权的最短路径问题。
import java.util.Arrays;
public class Florid {
public int n =5;
public static void main(String[] args){
//邻接矩阵
double a[][] = {{0.0,3.0,8.0,Double.MAX_VALUE,-4.0},
{Double.MAX_VALUE,0,Double.MAX_VALUE,1.0,7.0},
{Double.MAX_VALUE,4.0,0,Double.MAX_VALUE,Double.MAX_VALUE},
{2.0,Double.MAX_VALUE,-5.0,0.0,Double.MAX_VALUE},
{Double.MAX_VALUE,Double.MAX_VALUE,Double.MAX_VALUE,6.0,0.0}
};
Florid f = new Florid();
f.floridWarshall(a);
}
public void floridWarshall(double b[][]){
double a[][] = Arrays.copyOf(b, this.n);
//k代表加入的结点
for(int k=1;k<=this.n;k++){
//i代表新加入的点
for(int i=0;i<this.n;i++){
//j代表终点
for(int j=0;j<this.n;j++){
if(a[i][j]>a[i][k-1]+a[k-1][j]){
a[i][j] = a[i][k-1]+a[k-1][j];
}
}
}
}
//循环输出各点间的最短距离
for(int m = 0;m<n;m++){
for(int s=0;s<n;s++){
System.out.print(a[m][s]+" ") ;
}
System.out.println();
}
}
}