每对顶点的最短路径 : Floyd-Warshall 算法

public class FloydWarshall {

	static final int M = 10000; //unreachable
	
	//print-path
	static void printPath(int[][] p, int i, int j) {
		if(i == j) {
			System.out.print((char)('A' + i) + " ");
		}else if(p[i][j] == -1) { //unreachable
			
		} else {
			printPath(p, i, p[i][j]);
			System.out.print((char)('A' + j) + " ");
		}
	}
	
	//floyd-warshall
	static void floydWarshall(int[][] W) {
		int n = W.length;
		//D0
		int[][] D = W;
		//∏0
		int[][] p = new int[W.length][W[0].length];
		for(int i = 0; i < W.length; i++) {
			for(int j = 0; j <  W[i].length; j++) {
				if(i == j || W[i][j] == M) {
					p[i][j] = -1;
				} else {
					p[i][j] = i;
				}
			}
		}
		
		for(int k = 0; k < n; k++) {
			//Dn
			int[][] L = new int[D.length][D[0].length];
			//∏n
			int[][] P = new int[D.length][D[0].length];
			for(int i = 0; i <  n; i++) {
				for(int j = 0; j < n; j++) {
					if(D[i][j] <= (D[i][k] + D[k][j])) {
						L[i][j] = D[i][j];
						P[i][j] = p[i][j];
					} else {
						L[i][j] = D[i][k] + D[k][j];
						P[i][j] = p[k][j];
					}
				}
			}
			D = L;
			p = P;
		}
		
		//print
		for(int i = 0; i < n; i++) {
			for(int j = 0; j < n; j++) {
				System.out.printf("%c -> %c (%d) : ", (char)('A' + i), (char)('A' + j), D[i][j]);
				printPath(p, i, j);
				System.out.println();
			}
			System.out.println();
		}
		System.out.println();
	}
	
	
	
	public static void main(String[] args) {
		int[][] edges = {
				{0, 3, 8, M, -4},
				{M, 0, M, 1, 7},
				{M, 4, 0, M, M},
				{2, M, -5, 0, M},
				{M, M, M, 6, 0}
		};
		
		floydWarshall(edges);
	}
}