union-find.h | 38 : parent_(max, fail), rank_(max), fail_(fail) { } 69 rank_.resize(2 * item); 85 vector<int> rank_; // Rank of an element = min. depth in tree. member in class:fst::UnionFind 93 if (rank_[x] > rank_[y]) { 97 if (rank_[x] == rank_[y]) { 98 ++rank_[y];
|