src/test/java/edu/neu/coe/info6205/union_find/Alternative2.java
public void union(int p, int q) {
        // CONSIDER can we avoid doing find again?
        mergeComponents(find(p), find(q));
        count--;
    }
/**
     * Merges the component containing site {@code p} with the
     * the component containing site {@code q}.
     *
     * @param p the integer representing one site
     * @param q the integer representing the other site
     * @throws IllegalArgumentException unless
     *                                  both {@code 0 <= p < n} and {@code 0 <= q < n}
     */
Merges the component containing site  p with the
the component containing site  q.

@param p the integer representing one site
@param q the integer representing the other site
@throws IllegalArgumentException unless
both  0 <= p < n and  0 <= q < n
Merges the component containing site p with the the component containing site q . @param p the integer representing one site @param q the integer representing the other site @throws IllegalArgumentException unless both 0 < = p < n and 0 < = q < n
public void union(int p, int q) {
        mergeComponents(find(p), find(q));
        count--;
    }
public void union ( int p , int q ) { mergeComponents ( find ( p ) , find ( q ) ) ; count -- ; }
Merges the component containing site {@code p} with the
 the component containing site {@code q}.
Merges the component containing site { @code p } with the the component containing site { @code q } .
// CONSIDER can we avoid doing find again?