48     assertFalse(uf.isConnected(i1.seek(0), i2.seek(7)));  in testTree()
49     uf.union(i1.seek(0), i2.seek(1));  in testTree()
50     assertTrue(uf.isConnected(i1.seek(0), i2.seek(1)));  in testTree()
51     uf.union(i1.seek(2), i2.seek(3));  in testTree()
52     assertFalse(uf.isConnected(i1.seek(0), i2.seek(2)));  in testTree()
53     uf.union(i1.seek(0), i2.seek(2));  in testTree()
54     assertTrue(uf.isConnected(i1.seek(3), i2.seek(1)));  in testTree()
55     uf.union(i1.seek(4), i2.seek(5));  in testTree()
56     uf.union(i1.seek(6), i2.seek(7));  in testTree()
57     uf.union(i1.seek(4), i2.seek(6));  in testTree()
58     assertFalse(uf.isConnected(i1.seek(0), i2.seek(4)));  in testTree()
59     uf.union(i1.seek(0), i2.seek(4));  in testTree()
62         assertTrue(uf.isConnected(i1.seek(i), i2.seek(j)));  in testTree()
85       final boolean ufc = uf.isConnected(i1.seek(o1), i2.seek(o2));  in testBruteForce()
110     assertFalse(uf.isConnected(i1.seek(0), i2.seek(1)));  in testWorstCase()
111     uf.union(i1.seek(0), i2.seek(1));  in testWorstCase()
112     assertTrue(uf.isConnected(i1.seek(0), i2.seek(1)));  in testWorstCase()
113     uf.union(i1.seek(2), i2.seek(3));  in testWorstCase()
114     assertFalse(uf.isConnected(i1.seek(0), i2.seek(2)));  in testWorstCase()
115     uf.union(i1.seek(5), i2.seek(4));  in testWorstCase()
116     uf.union(i1.seek(7), i2.seek(6));  in testWorstCase()
117     uf.union(i1.seek(8), i2.seek(9));  in testWorstCase()
118     uf.union(i1.seek(1), i2.seek(3));  in testWorstCase()
119     assertTrue(uf.isConnected(i1.seek(0), i2.seek(2)));  in testWorstCase()
120     uf.union(i1.seek(4), i2.seek(6));  in testWorstCase()
121     assertTrue(uf.isConnected(i1.seek(5), i2.seek(7)));  in testWorstCase()
122     uf.union(i1.seek(3), i2.seek(7));  in testWorstCase()
123     assertTrue(uf.isConnected(i1.seek(0), i2.seek(4)));  in testWorstCase()
124     assertFalse(uf.isConnected(i1.seek(0), i2.seek(9)));  in testWorstCase()
125     uf.union(i1.seek(0), i2.seek(9));  in testWorstCase()
128         assertTrue(uf.isConnected(i1.seek(i), i2.seek(j)));  in testWorstCase()
138     uf.union(i1.seek(0), i2.seek(1));  in testRoots()
139     uf.union(i1.seek(2), i2.seek(3));  in testRoots()
141     uf.union(i1.seek(0), i2.seek(2));  in testRoots()
143     uf.union(i1.seek(4), i2.seek(5));  in testRoots()
144     uf.union(i1.seek(6), i2.seek(7));  in testRoots()
145     uf.union(i1.seek(4), i2.seek(6));  in testRoots()
147     uf.union(i1.seek(0), i2.seek(4));  in testRoots()