Floyd算法求最短路径，JAVA实现

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class TestMainIO {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		TestMainIO test_print = new TestMainIO();
		int[][] G = test_print.intputGragh("D:\\Users\\test.txt" , 6);
		int[][] Dis = test_print.floyd(G, 6);	
		test_print.printG(Dis, 6);
	}
	
	public void printG(int[][] G,int n){
		for(int i=0;i"+j+"  "+G[i][j]);
			}
		}
	}

	public int[][] intputGragh(String path , int num) throws FileNotFoundException{
		int[][] G = new int[num][num];
		for(int i=0;i





Dis[i][k]+Dis[k][j]){
						Dis[i][j]=Dis[i][k]+Dis[k][j];
					}
				}
			}
		}
		return Dis;
	}
}