.Floyd-Warshall算法——任意点对最短路算法

//Floyd-Warshall算法——任意点对最短路算法

//求图中任意两点的最短距离的算法
    for (int i = 0; i < n; i++) {//初始化为0  
                    for (int j = 0; j < n; j++)  
                        scanf("%lf", &dis[i][j]);  
                }  
                for (int k = 0; k < n; k++) {  
                    for (int i = 0; i < n; i++) {  
                        for (int j = 0; j < n; j++) {  
                            dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);  
                        }  
                    }  
                }