01
02
03
04
05
06
07
08
09
10
11
12
13
14
package algs15;
/**
 *  The <tt>UF</tt> interface represents a union-find data data structure.
 *  It supports the <em>union</em> and <em>find</em>
 *  operations, along with a method for determining the number of
 *  disjoint sets.
 */

public interface UF {
  public abstract int find(int p);
  public abstract int count();
  public abstract boolean connected(int p, int q);
  public abstract void union(int p, int q);
}