編程演算法 - 並查集(disjoint set) 代碼(C)

標籤：mystra   編程演算法   並查集   代碼   c   

並查集(disjoint set) 代碼(C)

本文地址: http://blog.csdn.net/caroline_wendy

並查集(disjoint set)是一種常用的資料結構.樹形結構, 包含查詢(find)和合并(unite)操作.

時間複雜度O(a(n)), 比O(logn)要快.

代碼:

class DisjoinSet {static const int MAX_N = 10000;int par[MAX_N];int rank[MAX_N];public:void init(int n) {for (int i=0; i<n; i++) {par[i] = i;rank[i] = 0;}}int find (int x) {if(par[x] == x) {return x;} else {return par[x] = find(par[x]);}}void unite(int x, int y) {x = find(x);y = find(y);if (x == y) return;if (rank[x] < rank[y]) {par[x] = y;} else {par[y] = x;if (rank[x] == rank[y]) rank[x]++;}}bool same(int x, int y) {return find(x) == find(y);}};

編程演算法 - 並查集(disjoint set) 代碼(C)