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 否 0
		Arrays.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值最小的节点x
				if (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);
				}
			}
		}
	}
}

输入：
6
11
0 1 20
0 2 60
0 4 10
0 5 65
1 2 30
1 3 70
2 3 40
3 4 35
4 5 20
5 2 40
5 3 80
输出：
0
1 0
2 1 0
3 1 0
3 2 1 0
4 0
5 4 0