八、迪杰斯特拉算法
![在这里插入图片描述](https://img-blog.csdnimg.cn/a3c28eb2970d44428dbe55d361cc7860.png?x-oss-process=image/watermark,type_d3F5LXplbmhlaQ,shadow_50,text_Q1NETiBA6LSl54Gr572X5rGJ5p6c,size_20,color_FFFFFF,t_70,g_se,x_16)注:代码中有两个部分会更新dis【】,分别是直连距离和通过其他顶点到该顶点的距离
代码实现
package Algorithm.Dijkstra;
import java.util.Arrays;
public class DD {
public static void main(String[] args) {
char[] vertex = {'A', 'B', 'C', 'D', 'E', 'F', 'G'};
int[][] matrix = new int[vertex.length][vertex.length];
final int N = 65535;//表示不可链接
matrix[0] = new int[]{N, 5, 7, N, N, N, 2};
matrix[1] = new int[]{5, N, N, 9, N, N, 3};
matrix[2] = new int[]{7, N, N, N, 8, N, N};
matrix[3] = new int[]{N, 9, N, N, N, 4, N};
matrix[4] = new int[]{N, N, 8, N, N, 5, 4};
matrix[5] = new int[]{N, N, N, 4, 5, N, 6};
matrix[6] = new int[]{2, 3, N, N, 4, 6, N};
Graph graph = new Graph(vertex, matrix);
graph.dsj(6);
}
}
class Graph {
char[] vertex;//顶点数组
int[][] matrix;//邻接矩阵
VisitedVertex vv;//已经访问过的顶点的集合
public Graph(char[] vertex, int[][] matrix) {
this.vertex = vertex;
this.matrix = matrix;
}
//迪杰斯特拉算法实现
public void dsj(int index) {//表示出发顶点对应的下标
vv = new VisitedVertex(vertex.length, index);
update(index);//先更新第一个顶点
for (int j = 1; j < vertex.length; j++) {
index = vv.updateArr();
update(index);//更新剩余顶点
}
vv.show();
}
//更新index顶点到周围顶点的距离、前驱节点
public void update(int index) {
int len = 0;
for (int j = 0; j < matrix[index].length; j++) {
//len表示出发顶点到index顶点+index顶点到j顶点的距离
len = vv.getDis(index) + matrix[index][j];
//如果j顶点没被访问过,且len<出发顶点到j顶点的距离,则更新
if (!vv.visited(j) && len < vv.getDis(j)) {
vv.updatePre(index, j);
vv.updateDis(j, len);
vv.already_arr[index] = 1;
}
}
}
}
class VisitedVertex {
int[] already_arr;//记录定点是否已经被访问过
int[] pre_visited;//前一个顶点下标
int[] dis;//记录从出发顶点到所有顶点的距离
//初始化
public VisitedVertex(int length, int index) {//length表示顶点个数,index表示出发顶点
this.already_arr = new int[length];
this.pre_visited = new int[length];
this.dis = new int[length];
//初始化dis数组,先全部填充为最大值,然后把自己标0
Arrays.fill(dis, 65535);
this.already_arr[index] = 1;//设置出发顶点被访问过
this.dis[index] = 0;
}
//判断顶点是否访问过
public boolean visited(int index) {
return already_arr[index] == 1;
}
//返回出发顶点到index顶点的距离
public int getDis(int index) {
return dis[index];
}
//更新出发顶点到index顶点的距离
public void updateDis(int index, int len) {
dis[index] = len;
}
//更新节点前驱为index
public void updatePre(int index, int pre) {
pre_visited[pre] = index;
}
//更新访问节点和dis
public int updateArr() {
int min = 65535;
int 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;
}
public void show(){
for (int i = 0; i < already_arr.length; i++) {
System.out.print(already_arr[i]+" ");
System.out.print(pre_visited[i]+" ");
System.out.print(dis[i]);
System.out.println();
}
}
}