public void work2(int v,int destnation){
		boolean used[]=new boolean [nodelen];
		//every site pass this route's cost
		int price[][]=new int[nodelen][routelen];
		
		int pre[]=new int[nodelen];
		for(int i=1;i<nodelen;i++){
			used[i]=false;
			pre[i]=0;
		}
		used[v]=true;
		pre[v]=v;
		for(int i=1;i<=nodelen;i++)if(gra[v][i])pre[i]=v;
		Queue<Integer>que=new LinkedList<Integer>();
		que.offer(v);
		price[v][0]=node[v].getLen();
		for(int i=1;i<=price[v][0];i++)price[v][i]=route[node[v].getPassRoute()[i-1]].price;
		while(!que.isEmpty()){
			int u=que.poll();
			for(int i=1;i<nodelen;i++)
				if(gra[u][i]&&!used[i]){
					//the neighborhoods
					que.offer(i);
					used[i]=true;
					price[i]=deal(price[u],i);
				}
		}
		int minv=1000;
		for(int j=1;j<routelen;j++)
		System.out.println("price"+price[destnation][j]+"    ");
		
	}