单源最短路径问题Dijkstra算法

 public final static int maxint=10000;
 private static void run(int n,int v,int dist[],int prev[],int c[][]) {
	 boolean s[]=new boolean[maxint];
	 for(int i=1;i<=n;i++) {
		 dist[i]=c[v][i];
		 s[i]=false;
		 if(dist[i]==maxint) prev[i]=0;
		 else prev[i]=v;
	 }
	 dist[v]=0;s[v]=true;
	 for(int i=1;i<n;i++) {
		 int temp=maxint;
		 int u=v;
		 for(int j=1;j<=n;j++)
			 if((!s[j])&&(dist[j]<temp)) {u=j;temp=dist[j];}
		 s[u]=true;
		 for(int j=1;j<=n;j++)
			 if((!s[j])&&(c[u][j]<maxint)) {
				 int newdist=dist[u]+c[u][j];
				 if(newdist<dist[j]) { dist[j]=newdist;prev[j]=u; }
		}
    }
 }
 private static void  递归(int x,int prev[]) {
	 if(x==1)  ;
	 else   { 递归(prev[x],prev);System.out.print( prev[x]+"--->");
	 }
 }
 private static void 最短路径(int x,int prev[],int c[][]) {
	 System.out.print(x+"的最短单源路径为：");
	 递归(x,prev);
	 System.out.println(x);
 }
 public static void main(String args[]) {
 	int n=6;
 	int v=1;
 	int dist[]=new int[6];       
 	int prev[]=new int[6];        //  0    1     2      3      4      5 
 	int c[][]=new int[][]{     /*0*/ {0,   0  ,  0   ,  0   ,  0   ,  0   },
	 						   /*1*/ {0,   0  ,  10  ,maxint,  30  ,  100 },
	 						   /*2*/ {0,maxint,  0   ,  50  ,maxint,maxint},
	 						   /*3*/ {0,maxint,maxint,  0   ,maxint,  10  },
	 						   /*4*/ {0,maxint,maxint,  20  ,  0   ,  60  },
	 						   /*5*/ {0,maxint,maxint,maxint,maxint,  0   } 
 						};
 	run(n-1,1,dist,prev,c);		
 	for(int i=2;i<n;i++) {
 	最短路径(i,prev,c);
 	System.out.println(i+"的最短单源路径长度为："+dist[i]);
 	System.out.println();
 	  } 
 	}