public static void initNotDegree(ArrayList<Integer>not){
		for (Integer in : not)// oneLeap中节点和candidate中节点的交集数
		{int number = 0;
			HashSet<Integer> adj = oneLeap.get(in);
			for(Integer out:candidate){
				if(adj.contains(out))
					number++;
			}
			degree.put(in, number);
		}
	}