迪吉斯特拉算法解决最短路径问题

总的概括就是

使用三个数组记录

1.记录前驱节点

2.记录该点是否被访问过

3.记录首节点到该节点的距离

package 十大算法;

import java.util.Arrays;

public class 迪吉斯特算法解决最短路径 {
    public static void main(String[] args) {

        char[] zifuji = { 'A', 'B', 'C', 'D', 'E', 'F', 'G' };

        final int N = 65535;// 表示不可以连接
        int [][] map = new int[][]{
            {N,5,7,N,N,N,2},
            {5,N,N,9,N,N,3},
            {7,N,N,N,8,N,N},
            {N,9,N,N,N,4,N},
            {N,N,8,N,N,5,4},
            {N,N,N,4,5,N,6},
            {2,3,N,N,4,6,N}
        };

        f1(zifuji, map, 'E');
    }

//    迪吉斯特算法
    public static void f1(char[] zifuji, int [][] map, char firstStep){
        int[] prePoint = new int[zifuji.length];//记录前驱节点的数组
        int[] visited = new int[zifuji.length];//记录是否被访问过的节点
        int[] ponitDistance = new int[zifuji.length];//记录该点到起始顶点的距离
        Arrays.fill(ponitDistance, 65535);

        int weizhi = findWeizhi(zifuji, firstStep);//头的位置   ==6
        visited[weizhi] = 1;
        //更新头的前驱节点
        for (int i = 0; i < map.length; i++){
            if (map[weizhi][i] != 65535){
                prePoint[i] = weizhi;
                ponitDistance[i] = map[weizhi][i];
            } else if (weizhi == i){
                ponitDistance[i] = 0;
            }
        }
        System.out.println("prePoint : " + Arrays.toString(prePoint));
        System.out.println("visited : " + Arrays.toString(visited));
        System.out.println("ponitDistance : " + Arrays.toString(ponitDistance));
        System.out.println("=====================");
        for (int i = 0; i < zifuji.length-1; i++){
//            可访问的节点
            int index = f2(zifuji, visited, ponitDistance);
            visited[index] = 1;//将该节点设置为被访问过，将该节点设置为头
            for (int j = 0; j < zifuji.length; j++){
                int len = ponitDistance[index] + map[index][j];

                if (len < ponitDistance[j] && visited[j] != 1){
                    prePoint[j] = index;
                    ponitDistance[j] = len;
                }
            }
        }

        System.out.println("prePoint : " + Arrays.toString(prePoint));
        System.out.println("visited : " + Arrays.toString(visited));
        System.out.println("ponitDistance : " + Arrays.toString(ponitDistance));

    }

//    找出可访问的节点
    public static int f2(char[] zifuji, int[] visited, int[] ponitDistance){
        int distance = 65535;
        int index = -1;
        for (int i = 0; i < zifuji.length; i++){
            if (visited[i] == 0 && ponitDistance[i] < distance){
                index = i;
                distance = ponitDistance[i];
            }
        }
        return index;
    }

//    查找对应的字符的位置
    public static int findWeizhi(char[] zifuji, char firstStep){
        for (int i = 0; i < zifuji.length; i++){
            if (zifuji[i] == firstStep){
                return i;
            }
        }
        return -1;
    }


}