-
胜利乡有7个村庄(A, B, C, D, E, F, G)
-
各个村庄的距离用边线表示(权) ,比如 A – B 距离 5公里
-
问:如何计算出各村庄到 其它各村庄的最短距离?
package floyd;
import java.util.Arrays;
public class floydAlgorithm {
public static void main(String[] args) {
//测试看看图是否创建成功
char[] vertex = {‘A’, ‘B’, ‘C’, ‘D’, ‘E’, ‘F’, ‘D’};
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 graph = new Graph(vertex.length, matrix, vertex);
// 调用弗洛伊德算法
graph.floyd();
graph.show();
}
}
class Graph {
private char[] vertex; // 存放顶点数组
private int[][] dis; // 保存从各个顶点出发到其他顶点的距离,最后的结果,也是保存在该数组
private int[][] pre; // 保存到达目标顶点的前驱结点
/**
-
构造器
-
@param length 长度大小
-
@param matrix 初始邻接矩阵
-
@param vertex 顶点数组
*/
public Graph(int length, int[][] matrix, char[] vertex) {
this.vertex = vertex;
this.dis = matrix;
this.pre = new int[length][length];
// 对pre数组初始化,存的的是
for (int i = 0; i < length; i++) {
Arrays.fill(pre[i], i);
}
}
// 显示pre数组和dis数组{
public void show() {
// 为了显示便于阅读
char[] vertex = {‘A’, ‘B’, ‘C’, ‘D’, ‘E’, ‘F’, ‘D’};
for (int i = 0; i < dis.length; i++) {
// 先将pr数组输出
for (int j = 0; j < dis.length; j++) {
System.out.print(vertex[pre[i][j]] + " ");
}
System.out.println();
// 将dist组输出
for (int j = 0; j < dis.length; j++) {
System.out.print(“(” + vertex[i] + “到” + vertex[j] + “的最短路径是:” + dis[i][j] + ") ");
}
System.out.println();
System.out.println();
}
}
public void floyd() {
int len = 0; // 记录变量保存距离
// 对中间顶点遍历,k就是中间顶点的下标 [‘A’,‘B’,‘C’,‘D’,‘E’,‘F’,‘G’]
for (int k = 0; k < dis.length; k++) {
// 从i顶点开始出发 [‘A’,‘B’,‘C’,‘D’,‘E’,‘F’,‘G’]
for (int i = 0; i < dis.length; i++) {
// 到达j顶点,[‘A’,‘B’,‘C’,‘D’,‘E’,‘F’,‘G’]
for (int j = 0; j < dis.length; j++) {
len = dis[i][k] + dis[k][j]; // => 求出从i顶点出发,经过k中间顶点,到达j顶点距离