Disjoint Set Data Structures

-

Disjoint Set Data Structures

The disjoint set data structure, or DSDS, is a collection of different trees. The DSDS is an efficient way to search up whether two nodes are in the same group or not or to keep track of the connected components of an undirected graph. It is efficient because it remembers all operations done on the structure, and makes those exact operations more efficient in the future, giving it an edge over plain brute-force search. Implementations of the DSDS for specific problems commonly require different specifications and changes, but the unimproved DSDS has three methods:

 1. MakeSet(),
 2. Find(),
 3. and Unify().

MakeSet() initializes a tree with only one node and adds it to the DSDS (forest). This method is run before any other method calls. The node of an unimproved DSDS has the following attributes:

 1. node.parent (the ancestor of the node)
 2. (only necessary for optimizations and commonly redundant) node.rank

Initially, node.parent is set to itself (since every node is its own ancestor), and node.rank is set to 0. The redundant node.rank will not be discussed in depth here, see the [Wikipedia article][1] on the DSDS for more information.

Find(x) locates the deepest ancestor of a node x (since x.parent.parent might not be equal to x.parent), and sets ALL sub-ancestors of x to the true ancestor of x along the way, speeding up future operations.
An unimproved DSDS implementation of find(x) in C++ can be

int find(int v)
{
    if(father[v]==v) return v; 
    father[v]=find(father[v]);
    return father[v];
}


Unify(x, y) merges the trees containing node X and the tree containing node Y by locating the ancestors of X and Y and then binding them together with another node, making the two sub-trees (now one tree) taller in the process. A common (no-rank) implementation in C++ can be:

void unify(int x, int y) 
{
int fx,fy; fx=find(x); fy=find(y);
        if (fx==fy) return;
  father[fx]=fy;
}

Modifications


Coming soon!

Uses (Appearances)

NOI 2002: Legend of Galactic Heroes

Oh, and:

  https://en.wikipedia.org/wiki/Disjoint-set_data_structure

Comments

Post a Comment

Popular posts from this blog

USACO Training "subset": Subset Sums

-
USACO Training "subset": Subset Sums Problem Statement Subset Sums JRM For many sets of consecutive integers from 1 through N (1 <= N <= 39), one can partition the set into two sets whose sums are identical. For example, if N=3, one can partition the set {1, 2, 3} in one way so that the sums of both subsets are identical: {3} and {1,2} This counts as a single partitioning (i.e., reversing the order counts as the same partitioning and thus does not increase the count of partitions). If N=7, there are four ways to partition the set {1, 2, 3, ... 7} so that each partition has the same sum: {1,6,7} and {2,3,4,5} {2,5,7} and {1,3,4,6} {3,4,7} and {1,2,5,6} {1,2,4,7} and {3,5,6} Given N, your program should print the number of ways a set containing the integers from 1 through N can be partitioned into two sets whose sums are identical. Print 0 if there are no such ways. Your program must calculate the answer, not look it up from a table. PROGRAM NAME: s
Read more

USACO 2018 Open: Talent Show

-
Image
USACO 2018 Open Talent Show In Short Given N objects with value Vi and weight Wi, a collection of elements is said to have total value-to-weight ratio as (the sum of their value) divided by (the sum of their weight). Find the best possible value-to-weight ratio of these X objects, given the restraint that the collection must have total weight at least W. Return that ratio multiplied by 1000 and floored. Analysis It would be very difficult to calculate this optimal ratio - we'd have to either try all possible collections - O(2^n), where n is at most 250, about 10 to the power of 75 calculations, OR use a greedy heuristic - get the objects with the best ratio until it satisfies the weight limit. Neither of those are too to our liking, so how about searching for it? The search space is linear and not infinite - it asks for the ratio to the closest thousandths. The search space is sorted as well - if ratio X is achievable, then ratio Y < X is also achievable, if
Read more

OpenJudge 1768: Kadane's Algorithm on 2D Arrays

-
OpenJudge 1768: Kadane's Algorithm on 2-D Arrays Simple Version Given a 2-D matrix of integers, find the sub-matrix of this whose sum is maximized, and find that sum. The size of the matrix is no larger than 100 by 100. Analysis O(N^4) - Works, but naive     That's true, an naive O(N^4) version would work. We simply need to calculate (two dimensional!) prefix sums first. A quick review to what 2-D prefix sums are:     The 2-D prefix sum of two coordinates, X and Y, is the sum of all elements that have X-coordinate less than or equal to X, and Y coordinate less than or equal to Y.     It can be calculated through tabulation by removing overlapping areas.     Let P be the prefix sum array and V be the array of values, so the formula is as follows:     P[x, y] = V[x, y] - P[x-1, y] - P[x, y-1] + P[x-1, y-1].     We need to add the P[x-1, y-1] at the end since subtracting P[x-1, y] and P[x, y-1] we had overlapped the P[x-1, y-1]. Then, all we need to
Read more