算法实验三最短路径(9)

int[] shortPath = Dijsktra(W,start);

for(int i = 0;i < shortPath.length;i++){ out.write(shortPath[i]+"\t"); } out.write("\n"); } out.flush(); out.close();

System.out.println("E:\\Workspace\\Dijkstra\\dijkstraoutput2.txt创建成功，请查看"); } } Folyd

import java.io.File; import java.io.FileWriter; public class floyd1 {

public static int[][] Floyd(int[][]w){ int k,i,j;

for(k=0;k<w[0].length;k++){

for(i=0;i<w[0].length;i++){

for(j=0;j<w[0].length;j++){

w[i][j]=Min(w[i][j],w[i][k]+w[k][j]);

}}}

return w;