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

}

public static int Min(int a,int b){ if(a>b)return b; else return a; }

public static void main(String[] args)throws Exception {

int[][] W1 = { { 0, 20, 15, 1000, 1000, 1000 }, { 2, 0, 1000, 1000, 10,

30 },

{ 1000, 4, 0, 1000, 1000, 10 }, { 1000, 1000, 2, 0, 1000,

1000 },

{ 1000, 1000, 1000, 15, 0, 1000 }, { 1000, 1000, 1000, 4, 10, 0 } };//

建立一个权值矩阵

int[][]distance=new int[W1[0].length][W1[0].length];

distance=Floyd(W1);

for (int i = 0; i < distance.length; i++) {

File file = new File("E:\\Workspace\\Floyd\\floydoutput1.txt"); //

for (int j = 0; j < distance[i].length; j++) {

System.out.print(distance[i][j] + " "); } System.out.println(); }

存放数组数据的文件

FileWriter out = new FileWriter(file); //文件写入流

//将数组中的数据写入到文件中。每行各数据之间TAB间隔 for(int i=0;i<distance[0].length;i++){ for(int j=0;j<distance[0].length;j++){ out.write(distance[i][j]+"\t");} out.write("\n");}

out.flush();