2. Issues:. The equivalence problemThe first algorithmSmart union algorithmsUnion and Find. 3. Equivalence Relations. A relation R is defined on a set S if for every pair of elements (a,b), a,b?S, a R b is either true or false. If a R b is true, then we say that a is related to b.An equivalence relation is a relation R that satisfy three properties:(reflexive) a R a, for all a ? S.(symmetric) a R b if and only if b R a.(transitive) a R b and b R c implies that a R c..

Related searches for The Disjoint Set ADT

Download Presentation
## PowerPoint Slideshow about 'The Disjoint Set ADT' - elina

**An Image/Link below is provided (as is) to download presentation**

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -