unionfind.java

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

/*
 * 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;

import java.util.Set;

public interface UnionFind<T> extends Set<T>{
	public boolean makeSet(T item);
	public boolean union(T iteml,T itemr);
	public T findSetRepresent(T item);
	public T[] getItemsInSetOf(T item);
	//public boolean linkSet(T iteml,T itemr);

}