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

weight[start][i]){

weight[start][i] = weight[start][k] + weight[k][i]; path[i]=path[k]+"-->"+i;} } }

for(int i=0;i<n;i++)

System.out.println("从"+start+"出发到"+i+"的最短路径为："+path[i]);

System.out.println("---------------------------------"); return shortPath; }

public static void main(String[] args)throws Exception { int[][] W = {//邻接矩阵

{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 start=0;

int[] shortPath = Dijsktra(W,start); for(int i = 0;i < shortPath.length;i++)

System.out.println("从"+start+"出发到"+i+"的最短距离为："+shortPath[i]);

File file=new File("E:\\Workspace\\Dijkstra\\dijkstraoutput1.txt"); FileWriter out=new FileWriter(file); for(int i=0;i<shortPath.length;i++){