十大算法之弗洛伊德算法

弗洛伊德(Floyd)算法图解分析

设置顶点vi到顶点vk的最短路径已知为Lik，顶点vk到vj的最短路径已知为Lkj，顶点vi到vj的路径为Lij，则vi到vj的最短路径为：min((Lik+Lkj),Lij)，vk的取值为图中所有顶点，则可获得vi到vj的最短路径
至于vi到vk的最短路径Lik或者vk到vj的最短路径Lkj，是以同样的方式获得

弗洛伊德(Floyd)算法图解分析-举例说明

public class FloydAlgorithm {
    public static void main(String[] args) {
        // 测试看看图是否创建成功
        char[] vertex = {'A', 'B', 'C', 'D', 'E', 'F', 'G'};
        // 创建邻接矩阵
        int[][] matrix = new int[vertex.length][vertex.length];
        final int N = 65535;
        matrix[0] = new int[]{0, 5, 7, N, N, N, 2};
        matrix[1] = new int[]{5, 0, N, 9, N, N, 3};
        matrix[2] = new int[]{7, N, 0, N, 8, N, N};
        matrix[3] = new int[]{N, 9, N, 0, N, 4, N};
        matrix[4] = new int[]{N, N, 8, N, 0, 5, 4};
        matrix[5] = new int[]{N, N, N, 4, 5, 0, 6};
        matrix[6] = new int[]{2, 3, N, N, 4, 6, 0};

        //创建 Graph 对象
        FGraph graph = new FGraph(vertex, matrix);
        //调用弗洛伊德算法
        graph.floyd();
        graph.show();
    }
}

class FGraph {
    public char[] vertexs;
    public int[][] matrix;
    public int[][] pre;

    public FGraph(char[] vertexs, int[][] matrix) {
        this.vertexs = vertexs;
        this.matrix = matrix;
        pre = new int[vertexs.length][vertexs.length];
        for (int i = 0; i < matrix.length; i++) {
            Arrays.fill(pre[i], i);
        }
    }

    /**
     * 弗洛伊德算法
     */
    public void floyd() {
        // 对中间顶点遍历， k 就是中间顶点的下标 [A, B, C, D, E, F, G]
        for (int k = 0; k < vertexs.length; k++) {
            // 从i顶点开始出发 [A, B, C, D, E, F, G]
            for (int i = 0; i < vertexs.length; i++) {
                // 到达j顶点 // [A, B, C, D, E, F, G]
                for (int j = 0; j < vertexs.length; j++) {
                    // 求出从i 顶点出发，经过 k中间顶点，到达 j 顶点距离
                    int len = matrix[i][k] + matrix[k][j];
                    if (len < matrix[i][j]) {
                        // 更新距离
                        matrix[i][j] = len;
                        // 更新前驱顶点 
                        pre[i][j] = pre[k][j];
                    }
                }
            }
        }
    }

    public void show() {
        System.out.println("距离矩阵：");
        for (int i = 0; i < matrix.length; i++) {
            System.out.println(Arrays.toString(matrix[i]));
        }

        System.out.println("前驱矩阵:");
        for (int i = 0; i < pre.length; i++) {
            System.out.println(Arrays.toString(pre[i]));
        }
    }
}

距离矩阵：
[0, 5, 7, 12, 6, 8, 2]
[5, 0, 12, 9, 7, 9, 3]
[7, 12, 0, 17, 8, 13, 9]
[12, 9, 17, 0, 9, 4, 10]
[6, 7, 8, 9, 0, 5, 4]
[8, 9, 13, 4, 5, 0, 6]
[2, 3, 9, 10, 4, 6, 0]
前驱矩阵:
A A A F G G A 
B B A B G G B 
C A C F C E A 
G D E D F D F 
G G E F E E E 
G G E F F F F 
G G A F G G G