Dijkstra算法求最短路径

/*使用Dijkstra算法求最短路径 * 假设起点是0，它到节点i的路径长度是d[i] * w[i][j] = MAX表示边(i,j)不存在 * */import java.util.Arrays;import java.util.Scanner;public class Dijkstra {static final int MAX = 1 << 20;public static void main(String[] args) {Scanner scanner = new Scanner(System.in);int n = scanner.nextInt();// 节点个数int m = scanner.nextInt();// 边个数int[][] w = new int[n][n];// w[i][j]边(i,j)的权值int[] d = new int[n];int[] v = new int[n];// 标记顶点是否被访问过 是1 否 0Arrays.fill(d, MAX);d[0] = 0;for (int i = 0; i < n; i++) {Arrays.fill(w[i], MAX);}for (int i = 0; i < m; i++) {// 输入各条边的起点、终点和权值w[scanner.nextInt()][scanner.nextInt()] = scanner.nextInt();}for (int i = 0; i < n; i++) {int x = 0, max = MAX;for (int y = 0; y < n; y++) {// 选出d值最小的节点xif (v[y] == 0 && d[y] <= max)max = d[x = y];}v[x] = 1;for (int y = 0; y < n; y++) {// 从x出发的所有边更新d[y]值d[y] = Math.min(d[y], d[x] + w[x][y]);}}Dijkstra di = new Dijkstra();for (int i = 0; i < n; i++) {di.print(w, d, i);}}private void print(int[][] w, int[] d, int i) {if (d[i] == 0) {System.out.println(i);return;} else {for (int j = 0; j < d.length; j++) {if (d[i] == d[j] + w[j][i]) {System.out.printf("%d ", i);print(w, d, j);}}}}}

输入：6110 1 200 2 600 4 100 5 651 2 301 3 702 3 403 4 354 5 205 2 405 3 80输出：01 02 1 03 1 03 2 1 04 05 4 0