1 / 39

Chapter 21: Disjoint Sets

Comp 750, Fall 2009. Disjoint Sets - 2. Using Linked Lists. Store set {a, b, c} as:. . a. . . b. . . c. . Make-Set and Find-Set are O(1).. Union(x, y): Append x's list onto the end of y's list. Update representative pointers in x's list.Time is linear in |x|.Running time for a sequence of m o

brasen
Télécharger la présentation

Chapter 21: Disjoint Sets

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

    More Related