01
02
03
04
05
06
07
08
09
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
 
package algs15;
import java.util.Arrays;
import stdlib.*;
/* **************************************************************************
 *  Compilation:  javac WeightedQuickUnionHalvingUF.java
 *  Execution:  java WeightedQuickUnionHalvingUF < input.txt
 *  Dependencies: StdIn.java StdOut.java
 *
 *  Weighted quick-union with path compression via halving.
 *
 ****************************************************************************/

public class XWeightedHalvingUF implements UF {
  private int[] id;    // id[i] = parent of i
  private int[] sz;    // sz[i] = number of objects in subtree rooted at i
  private int count;   // number of components

  // instantiate N isolated components 0 through N-1
  public XWeightedHalvingUF(int N) {
    count = N;
    id = new int[N];
    sz = new int[N];
    for (int i = 0; i < N; i++) {
      id[i] = i;
      sz[i] = 1;
    }
  }

  // return number of connected components
  public int count() {
    return count;
  }

  // return component identifier for component containing p
  public int find(int p) {
    int root = p;
    while (root != id[root]) {
      if (id[root] != id[id[root]]) {
        id[root] = id[id[root]];    // path compression by halving
        if (TestUF.SHOW_COMPRESSION_STEPS) { StdOut.format("%2d %2d> %2d%s\n", root, id[root], this.count(), this); toGraphviz(); }
      }
      root = id[root];
    }
    return root;
  }
  // return component identifier for component containing p
  public int findSimple(int p) {
    int root = p;
    while (root != id[root]) {
      id[root] = id[id[root]];
      root = id[root];
    }
    return root;
  }

  // are elements p and q in the same component?
  public boolean connected(int p, int q) {
    return find(p) == find(q);
  }

  // merge components containing p and q, making smaller root point to larger one
  public void union(int p, int q) {
    int pid = find(p);
    int qid = find(q);
    if (pid == qid) return;
    // in the case of a tie, p is the champion
    if   (sz[pid] < sz[qid]) { id[pid] = qid; sz[qid] += sz[pid]; }
    else                     { id[qid] = pid; sz[pid] += sz[qid]; }
    count--;
  }

  public String toString() { return Arrays.toString (id); }
  public void toGraphviz() { GraphvizBuilder.ufToFile (id); }

  public static void main(String[] args) {
    boolean print = true;
    StdIn.fromFile ("data/tinyUF.txt"); 
    //StdIn.fromFile ("data/mediumUF.txt"); print = false;
    //StdIn.fromFile ("data/largeUF.txt"); print = false;

    int N = StdIn.readInt();
    XWeightedHalvingUF uf = new XWeightedHalvingUF(N);
    if (print) { uf.toGraphviz(); StdOut.println("   : " + uf); }

    // read in a sequence of pairs of integers (each in the range 0 to N-1),
    // calling find() for each pair: If the members of the pair are not already
    // call union() and print the pair.
    Stopwatch sw = new Stopwatch ();
    while (!StdIn.isEmpty()) {
      int p = StdIn.readInt();
      int q = StdIn.readInt();
      if (uf.connected(p, q)) continue;
      uf.union(p, q);
      if (print) { StdOut.println(p + " " + q + ": " + uf); uf.toGraphviz(); }
    }
    StdOut.format("XWeightedHalvingUF # components: %d [%f]", uf.count(), sw.elapsedTime ());
  }

}