private static int[] greedyTour(UndirectedGraph ug){
		int N= ug.vertices;
		int[] tour = new int[N];
		boolean[] used = new boolean[N];
		tour[0]=0;
		used[0]=true;
		for(int i=1;i<N;i++){
			int best= -1;
			for(int j=0; j<N;j++){
				if(!used[j]&&(best==-1 || ug.dist(tour[i-1], j) < ug.dist(tour[i-1],best))){
					best=j;
				}
			}
			tour[i]=best;
			used[best]=true;
		}
		return tour;
	}