public int getCostTime(int startStation, int arrivalStation){
		int min=0;
		int j,i,k=0;
		
		for(i=0; i<size; i++){
			v[i] = 0;
			distance[i]=X;
		}
		distance[startStation] = 0;
		
		for(i=0; i<size; i++){
			min = X;
			for(j=0; j<size; j++){
				if(v[j]==0 && distance[j] < min){
					k=j;
					min = distance[j];
				}
			}
			v[k] = 1;
			if(min == X) break;
			
			for(j=0; j<size; j++){
				if(distance[j] > distance[k]+graph[k][j]){
					distance[j] = distance[k] + graph[k][j];
					via[j] = k;
				}
			}
		}
		
		return distance[arrivalStation] + Main.time;
	}