private void findRecycleRoutine(Stack<Node> stack2) {
		int size = stack2.size();
		while (size >= 3) {
			Node stackLastNode = stack2.lastElement();
			int i = 0;
			while ((size - i) >= 3) {
				Node stackSecondNode = stack2.get(i);
				boolean result = judeExistsRelationOfLink(stackLastNode,
						stackSecondNode);// жϽڵ֮ǷŸӹϵ
				if (result) {
					System.out.println("ʾĻ·ʱi" + i);
					number++;
					// 
					int sizeK = stack2.size() - 1;
					while (sizeK != i) {// Ҫ¸ֵ
						System.out.print(stack2.get(sizeK).getId() + " ");
						sizeK--;
					}
					if (i == 0) {
						System.out.println(stack2.get(i).getId());
					} else {
						System.out.println(stack2.get(i).getId());
					}
					System.out.println();
				} else {
					// System.out.println("ӻ·");
				}
				i++;
			}
			stack2.pop();
			size = stack2.size();
		}
	}