思路:
从起始点出发,广度遍历,记录到该点距离最短的顶点,记录下来,再广度遍历剩余的顶点,直到确定所有顶点都为最短时结束
代码:
package com.wangyq.datastructrue.arithmetic;
import java.util.Arrays;
public class Dijkstra {
private static int MAX = 1000;
public static void main(String[] args) {
//构建图
int[][] ints = new int[7][7];
String[] names = new String[7];
names[0] = "A";
names[1] = "B";
names[2] = "C";
names[3] = "D";
names[4] = "E";
names[5] = "F";
names[6] = "G";
for (int[