算法设计与分析--单源最短路径

public class Dijkstra {


		public static void main(String[] args) {
			float max = Float.MAX_VALUE;
			float[][] a = new float[][] {
  {0, 0, 0, 0, 0, 0},
								         {0, max, 10, max, 30, 100},
								         {0, max, max, 50, max, max},
								         {0, max, max, max, max, 10},
								         {0, max, max, 20, max, 60},
								         {0, max, max, max, max, max}};
			int v = 1;
			int n = 5;
			float[] dist = new float[n + 1];
			int[] prev = new int[n + 1];
			dijkstra(v, a, dist, prev);
		    outPath( 1, prev, dist );
			}
		
		public static void dijkstra(int v, float[][] a, float[] dist, int[] prev) {
			
			int n = dist.length - 1;
			if (v < 1 || v > n) return;
			// 代表当前顶点是否被添加到集合S中
			boolean[] s = new boolean[n + 1];
			// 初始化
			for (int i = 1; i <= n; i++) {
				dist[i] = a[v][i];
				s[i] = false;
				if (dist[i] == Float.MAX_VALUE) prev[i] = 0;
				els