最短路径问题（Dijkstra迪杰斯特拉、Floyd弗洛伊德算法）

题目：

找出出发顶点到其他点的最短距离

 

Dijkstra迪杰斯特拉算法：

第一步：由出发顶点，遍历其他顶点并更新距离表，找出距离最近的点

第二步：由第一步中距离最近的点为入口，遍历其他顶点并更新距离表，找出最近的点……

重复第二步直到所有顶点都找完。更新距离表：动态规划思想，比较加入改点与不加该店的距离

 代码实现：

public class DijkstraAlgorithm {
    public static void main(String[] args) {
        final int N = 65535;//表示不可连接
        char[] vertex = {'A', 'B', 'C', 'D', 'E', 'F', 'G'};
        int length = vertex.length;
        int[][] matrix = new int[][]{
                {0, 5, 7, N, N, N, 2},
                {5, 0, N, 9, N, N, 3},
                {7, N, 0, N, 8, N, N},
                {N, 9, N, 0, N, 4, N},
                {N, N, 8, N, 0, 5, 4},
                {N, N, N, 4, 5, 0, 6},
                {2, 3, N, N, 4, 6, 0}
        };
        MyDij(vertex, matrix, 6);
    }

    public static void MyDij(char[] vertex, int[][] matrix, int start) {
        int length = vertex.length;
        boolean[] s = new boolean[length];
        int[] dis = new int[length];
        Arrays.fill(dis, 65535);
        int i = start;
        dis[i] = 0;
        for (int m = 0; m < length; m++) {
            //遍历s[]，找出未访问且离出发顶点距离最短的顶点
            int min = 65535;
            int index = 0;
            for (int n = 0; n < length; n++) {
                if (s[n] == false && dis[n] < min) {
                    min = dis[n];
                    index = n;
                }
            }
            //以该未访问且离出发顶点距离最短的顶点为入口，遍历matrix[i]，更新dis[]
            i = index;
            s[index] = true;
            for (int j = 0; j < length; j++) {
                if (dis[i] + matrix[i][j] < dis[j]) {//通过i点到j点的距离<到j点的距离，更新
                    dis[j] = dis[index] + matrix[i][j];
                }
            }
            System.out.println("G->" + vertex[i] + "最短距离为" + dis[i]);
        }
        System.out.println(Arrays.toString(dis));
    }
}
//老师写法
class Dijkstra {
    private char[] vertex;
    private int[][] matrix;
    private VisitedVertex vv;//已经访问的顶点的集合

    public Dijkstra(char[] vertex, int[][] matrix) {
        this.vertex = vertex;
        this.matrix = matrix;
    }

    //迪杰斯特拉算法实现，index表示出发顶点
    public void djs(int index) {
        vv = new VisitedVertex(vertex.length, index);
        update(index);
        for (int j = 1; j < vertex.length; j++) {
            index = vv.updateArr();
            update(index);
        }

    }

    public void update(int index) {
        int len = 0;
        for (int j = 0; j < vertex.length; j++) {
            len = vv.getDis(index) + matrix[index][j];
            //若顶点j没有被访问过，并且len<出发顶点到j的距离，则更新
            if (!vv.in(j) && len < vv.getDis(j)) {
                vv.updatePre(j, index);
                vv.updateDis(j, len);
            }
        }
    }
}

class VisitedVertex {
    public int[] already_arr;
    public int[] pre_visited;
    public int[] dis;

    public VisitedVertex(int vertexs, int index) {
        this.already_arr = new int[vertexs];
        this.pre_visited = new int[vertexs];
        this.dis = new int[vertexs];
        Arrays.fill(dis, 65535);//出发点到其他点距离设为最大值
        this.already_arr[index] = 1;
        this.dis[index] = 0;//出发点到自己距离设为0
    }

    //判断index顶点是否被访问
    public boolean in(int index) {
        return already_arr[index] == 1;
    }

    //更新出发顶点到index的距离
    public void updateDis(int index, int len) {
        dis[index] = len;
    }

    //更新顶点的前驱为index结点
    public void updatePre(int pre, int index) {
        pre_visited[pre] = index;
    }

    //更新出发顶点到index顶点的距离
    public int getDis(int index) {
        return dis[index];
    }

    public int updateArr() {
        int min = 65535, index = 0;
        for (int i = 0; i > already_arr.length; i++) {
            if (already_arr[i] == 0 && dis[i] < min) {
                min = dis[i];
                index = i;
            }
        }
        already_arr[index] = 1;
        return index;
    }
}

 Floyd弗洛伊德算法：

第一层for循环：分别用各个顶点作中转点

第二、三层for循环：遍历邻接矩阵，比较直接连接两点，与经过中转点的距离大小

 代码实现：

public class FloydAlgorithm {
    public static void main(String[] args) {
        final int N = 65535;//表示不可连接
        char[] vertex = {'A', 'B', 'C', 'D', 'E', 'F', 'G'};
        int length = vertex.length;
        int[][] matrix = new int[][]{
                {0, 5, 7, N, N, N, 2},
                {5, 0, N, 9, N, N, 3},
                {7, N, 0, N, 8, N, N},
                {N, 9, N, 0, N, 4, N},
                {N, N, 8, N, 0, 5, 4},
                {N, N, N, 4, 5, 0, 6},
                {2, 3, N, N, 4, 6, 0}
        };
        Graph graph = new Graph(7, matrix,vertex);
        graph.floyd();
        graph.show();
    }
}
class Graph{
    private char[] vertex;//顶点
    private int[][] dis;//记录最短距离
    private int[][] pre;//记录路径
    public Graph(int length,int[][] matrix,char[] vertex){
       this.vertex=vertex;
       this.dis=matrix;
       this.pre=new int[length][length];
       for (int i=0;i<length;i++)
           Arrays.fill(pre[i],i);
    }
    public void floyd(){
        int len=0;
        for (int k=0;k<dis.length;k++){//记录中转点
            for (int i=0;i<dis.length;i++){//两次for循环，遍历matrix[][]，更新经过中转点的距离
                for (int j=0;j<dis.length;j++){
                    len=dis[i][k]+dis[k][j];
                    if (len<dis[i][j]){//更新距离
                        dis[i][j]=len;
                        pre[i][j]=pre[k][j];
                    }
                }
            }
        }
    }
    public void show(){
        for (int i=0;i<vertex.length;i++){
            System.out.println(Arrays.toString(dis[i]));
        }
        System.out.println("********************************");
        for (int i=0;i<vertex.length;i++){
            System.out.println(Arrays.toString(pre[i]));
        }
    }
}