目的：解決等價問題。
表示方法：森林，底層實現用數組
主要操作：find()、union()
優化手段：
①find()時路徑壓縮
②union()時按規模合并、按樹高合并（依據情況而定）
Java實現：
class DisjointSet {int father[];DisjointSet(){}DisjointSet(int n) {this.father = new int[n];for (int i = 0; i < n; i++)father[i] = i;}int find(int x) {if (x != father[x])father[x] = find(father[x]); // 回溯、壓縮路徑return father[x];}void union(int x, int y) {x = find(x);y = find(y);if (x == y)return;if (x < y) {if (father[y] == y)father[x] = father[x] == x ? -2 : father[x] - 1;elsefather[x] += father[y];father[y] = x;} else {if (father[x] == x)father[y] = father[y] == y ? -2 : father[y] - 1;elsefather[y] += father[x];father[x] = y;}}
}
?解決問題：迷宮生成問題、樹節點的最近祖先、連通回路等
)
)
