private static void updateDeg(DegList deglist,
			HashMap<Integer, Pair> candidate) {
		HashMap<Integer, Node> deg2node = new HashMap<Integer, Node>();
		ArrayList<Node> nodes = new ArrayList<Node>();
		for (Pair ca : candidate.values())// oneLeap中节点和candidate中节点的交集数
		{
			int number = 0;
			HashSet<Integer> adj = oneLeap.get(ca.point);
			if (candidate.size() < adj.size()) {
				for (Integer out : candidate.keySet()) {
					if (adj.contains(out))
						number++;
				}
			} else {
				for (Integer a : adj) {
					if (candidate.containsKey(a))
						number++;
				}
			}
			Node it = deg2node.get(number);
			if (it == null) {
				HashSet<Integer> nset = new HashSet<Integer>();
				nset.add(ca.point);
				Node tn = new Node();
				tn.deg = number;
				tn.points = nset;
				nodes.add(tn);
				deg2node.put(number, tn);
				ca.node = tn;
			} else {
				it.points.add(ca.point);
				ca.node = it;
			}
			ca.cdeg = number;
		}
		Collections.sort(nodes);
		deglist.makeList(nodes);
	}