Basically, UNION-FIND ALGORITHM is a process or a system of linking two entities by understanding the connections of the entities through the help of a few sets of rules.
Sets in this particular data structure are represented as linked lists; an element for example is pointing to the next element in its list thus joining the root to the child.
Find(x): returns the name of the set containing element x.
For more specific and deeper approach on design techniques and analysis on UNION-FIND ALGORITHM, please click on the helpful links below:
http://www.cs.cmu.edu/~avrim/451/lectures/lect1016.pdf
http://www.cs.princeton.edu/courses/archive/spr09/cos226/lectures/01UnionFind.pdf
http://digitalebookden.com/parallelizing-union-find-in-constraint-handling-rules.html
http://digitalebookden.com/union-find-algorithms-sample-code.html
sherwin bantilan