unionfindsetnode.java

来自「<算法导论>第二版大部分算法实现. 1. 各类排序和顺序统计学相关」· Java 代码 · 共 58 行

/*
 * Copyright (C) 2003-2008 Wang Pengcheng <[e-mail]>
 * Permission is granted to copy, distribute and/or modify this
 * document under the terms of the GNU Free Documentation License,
 * Version 2.0 or any later version published by the Free Software Foundation;
 * with no Invariant Sections.
 * You may obtain a copy of the License at
 *   http://www.gnu.org/licenses/lgpl.txt
 */
//9 Apr 2008
package cn.edu.whu.iss.algorithm.unit21;

class UnionFindSetNode<T>{

	private T item;
	private int rank;
	private UnionFindSetNode<T> parent;
	
	public UnionFindSetNode(T item) {
		super();
		this.item = item;
	}
	
	public void makeSet(){
		rank = 0;
		parent = this;
	}

	public UnionFindSetNode<T> getParent() {
		return parent;
	}

	public int getRank() {
		return rank;
	}

	public T getItem() {
		return item;
	}

	public void setItem(T item) {
		this.item = item;
	}

	public void setRank(int rank) {
		this.rank = rank;
	}

	public void setParent(UnionFindSetNode<T> parent) {
		this.parent = parent;
	}
	
	public void incRank(){
		rank++;
	}

}