有权图的Floyed

最新推荐文章于 2022-08-10 07:37:28 发布

weixin_30341735

最新推荐文章于 2022-08-10 07:37:28 发布

阅读量67

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/leeeee/p/7276140.html

本文详细介绍了Floyd算法的实现过程，用于解决给定矩阵中任意两点间的最短路径问题。通过克隆矩阵并迭代更新连接表，最终得到包含所有节点间最短路径的矩阵。

public class Floyed {

    public final static int UNLIMITED = Integer.MAX_VALUE;

    public static int[][] caculate(final int[][] linkedMatrix) {
        int M = linkedMatrix.length;
        int[][] connectTable = linkedMatrix.clone();
        for (int mid = 0; mid < M; mid++) {
            for (int left = 0; left < M; left++) {
                if (connectTable[left][mid] < UNLIMITED) {
                    for (int right = 0; right < M; right++) {
                        if (connectTable[mid][right] < UNLIMITED) {
                            int newValue = connectTable[left][mid] + connectTable[mid][right];
                            if (newValue < connectTable[left][right]) {
                                connectTable[left][right] = newValue;
                            }
                        }
                    }
                }
            }
        }
        return connectTable;
    }

    public static void main(String[] args) {
        int[][] linkedMatrix = new int[][]{
            {0, 50, UNLIMITED, 80, UNLIMITED},
            {UNLIMITED, 0, 60, 90, UNLIMITED},
            {UNLIMITED, UNLIMITED, 0, UNLIMITED, 40},
            {UNLIMITED, UNLIMITED, 20, 0, 70},
            {UNLIMITED, 50, UNLIMITED, UNLIMITED, 0}
        };
        int[][] connectTable = Floyed.caculate(linkedMatrix);
        int M = connectTable.length;
        for (int i = 0; i < M; i++) {
            for (int j = 0; j < M; j++) {
                System.out.print((connectTable[i][j] == UNLIMITED ? "-" : connectTable[i][j]) + "\t");
            }
            System.out.println();
        }

    }
}

输出：

0	50	100	80	140	
-	0	60	90	100	
-	90	0	180	40	
-	110	20	0	60	
-	50	110	140	0

转载于:https://www.cnblogs.com/leeeee/p/7276140.html