弗洛伊德求多源最短路径算法

FloyAlogrithms

public static void main(String[] args) {
        int min = 65535;
        char[] vertexs = {'A', 'B', 'C', 'D', 'E', 'F', 'G'};
        int[][] matrix = {{0, 7, min, 5, min, min, min},
                {7, 0, 8, 9, 7, min, min},
                {min, 8, 0, min, 5, min, min},
                {5, 9, min, 0, 15, 6, min},
                {min, 7, 5, 15, 0, 8, 9},
                {min, min, min, 6, 8, 0, 11},
                {min, min, min, min, 9, 11, 0}};
        FloyShortestRoad(matrix);
        //TODO 打印matrix数组
      
    }
 
    private static void FloyShortestRoad(int[][] matrix) {
        //遍历所有顶点，通过该顶点作为中介点更新最短路径
        for (int i = 0; i < matrix.length; i++) {
            //遍历二维数组所有点
            for (int j = 0; j < matrix.length; j++) {
                for (int k = 0; k < matrix.length; k++) {
                    int temp = matrix[j][i] + matrix[i][k];
                    if( temp < matrix[j][k]){
                        matrix[j][k] = temp;
                    }
                }
            }

        }
    }