最短路

第七届山东acm省赛：Proxy

题目中需要注意的是：①求最短路，没有输出-1

                                  ②输出最短路中距离起点最近的那个点

                                  ③存在多个最短路时，输出最小的那个点

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;

public class B {

	static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
	static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));

	public static int nextInt() throws IOException {
		in.nextToken();
		return (int) in.nval;
	}

	public static String next() throws IOException {
		in.nextToken();
		return (String) in.sval;
	}

	static int[][] map = new int[1005][1005];
	static boolean vis[] = new boolean[1005];
	static int path[] = new int[1005];
	static int d[] = new int[1005];
	static int n, m;
	static final int INF = 0xffffff;

	// 0是自己的电脑 N + 1 是目标网站的电脑、、
	public static void main(String[] args) throws IOException {
		int t = nextInt();
		while (t-- > 0) {
			Init();
			n = nextInt();
			m = nextInt();
			int u, v, w;
			for (int i = 0; i < m; i++) {
				u = nextInt();
				v = nextInt();
				w = nextInt();
				map[v][u] = Math.min(map[v][u], w);  //反向存入、便于找距离起点的前驱结点
			}

			dijkstra();
			if (d[0] == INF) {
				out.println("-1");
			} else {
				out.println(path[0]);
			}
			out.flush();
		}

	}

	public static void dijkstra() {
		for (int i = 0; i <= n + 1; i++) {
			vis[i] = false;
			d[i] = map[n + 1][i];
			if (map[n + 1][i] < INF) {
				path[i] = 0;
			} else {
				path[i] = -1;
			}
		}
		path[n + 1] = 0;
		while (true) {
			int v = -1;
			for (int u = 0; u <= n + 1; u++) {
				if (!vis[u] && (v == -1 || d[u] < d[v])) {
					v = u;
				}
			}
			if (v == -1) {
				break;
			}
			vis[v] = true;
			for (int u = 0; u <= n + 1; u++) {
				if (!vis[u] && d[u] > d[v] + map[v][u]) {
					d[u] = d[v] + map[v][u];
					path[u] = v;
				} else if (!vis[u] && d[u] == d[v] + map[v][u]) { // 条件三
					path[u] = Math.min(v, path[u]);
				}
			}
		}
	}

	public static void Init() {
		for (int i = 0; i < 1005; i++) {
			for (int j = 0; j < 1005; j++) {
				if (i == j) {
					map[i][j] = 0;
				} else {
					map[i][j] = INF;
				}
			}
		}
	}

}