UNION-FIND ALGORITHMS

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.

Union(x, y): fuses sets x and y into a single set.

For more specific and deeper approach on design techniques and analysis on UNION-FIND ALGORITHM, please click on the helpful links below:

http://books.google.com.ph/books?id=SPx4iHZEOugC&pg=PA132&lpg=PA132&dq=define+UNION-FIND+ALGORITHMS&source=bl&ots=kcf4WgcF45&sig=twhtmVGUOfsC0Zcj7157IX7hp0U&hl=tl&ei=kg8vTa_-B4KzrAeSncTZCg&sa=X&oi=book_result&ct=result&resnum=10&ved=0CHQQ6AEwCQ#v=onepage&q&f=false

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

http://www.gateguru.org/algorithms/union_find.pdf

--------------------------------------------------------------------------------------------------------

sherwin bantilan