int []deal(int []a,int id){
		//a means the node before ,id means the index of this node .
		int[] nodepassroute=node[id].getPassRoute();
		int passLen=node[id].getLen();
		int tmpans[]=new int[nodelen];
		boolean findit;
		int minv=(int)INFDOUBLE;
		for(int i=0;i<a[0];i++)if(a[i]!=0)minv=Math.min(minv, a[i]);
		for(int j=0;j<passLen;j++){
			findit=false;
			for(int i=1;i<nodelen&&!findit;i++){
				if(nodepassroute[j]==i){
					findit=true;
					tmpans[i]=a[i];
				}
			}
			if(!findit){
				tmpans[j]=minv+route[nodepassroute[j]].getPrice();
			}
		}
		//tmpans:current node's price via this way
		return tmpans;
	}