Download

1 / 16

Disjoint-Set Operation

Aug 08, 2012

160 likes | 534 Vues

. Disjoint Set Operations:MAKE-SET(x):Create new set {x} with representative x.UNION(x,y):x and y are elements of two sets. Remove these sets and add their union. Choose a representative for it.FIND-SET(x):return the representative of the set containing x.. We have a collection of disjoin

Share Presentation

Embed Code

Link

ellery

Télécharger la présentation

Disjoint-Set Operation

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

Disjoint Sets

Disjoint Sets. Andreas Klappenecker [Based on slides by Prof. Welch]. Dynamic Sets. In mathematics, a set is understood as a collection of clearly distinguishable entities (called elements). Once defined, the set does not change.

649 views • 44 slides

Disjoint Sets

Disjoint Sets. Given a set {1, 2, …, n} of n elements. Initially each element is in a different set. {1}, {2}, …, {n} An intermixed sequence of union and find operations is performed. A union operation combines two sets into one.

439 views • 28 slides

Checkpoint Set-Up and Operation

Checkpoint Set-Up and Operation. Vehicle Checkpoints. Identify vehicles with infected or susceptible animals Restrict entry into disease areas Redirect vehicles Restrict vehicles with exposed or infected animals. Checkpoint Set-Up. Location Equipment and Supplies Personnel. Location.

335 views • 20 slides

Set Operation

Set Operation. Janice Sipin. Set Operation. A  B U A B. Set Operation. A  B U

403 views • 18 slides

Disjoint sets

Disjoint sets. Outline. In this topic, we will cover disjoint sets, including: A review of equivalence relations The definition of a Disjoint Set An efficient data structure A general tree An optimization which results in Worst case O (ln( n )) height

1.05k views • 80 slides

Chapter 8: The Disjoint Set Class

Chapter 8: The Disjoint Set Class. Equivalence Classes. Disjoint Set ADT. Kruskal’s Algorithm. Disjoint Set Implementation. CS 340. Page 132. The Disjoint Set Class. Background: Equivalence Relations. A relation R on a set S maps every pair of elements in S to either TRUE or FALSE.

296 views • 11 slides

Disjoint Events

Disjoint Events. Points to remember…. (1.) The probability of an event happening must be between 0 and 1. (2.) If an event is guaranteed to happen, the probability of that event is 1. Example : When you flip a coin, what is the probability that you get heads or tails?.

248 views • 9 slides

8 THE DISJOINT SET ADT

8 THE DISJOINT SET ADT. 8 THE DISJOINT SET ADT. This chapter describe an efficient data structure to solve the equivalence problem. The data structure is simple to implement, a simple array can be used, is also extremely fast, requiring constant average time per operation. We will

565 views • 30 slides

The Disjoint Set ADT

The Disjoint Set ADT. CS146 Chapter 8 Yan Qing Lei. Issues:. The equivalence problem The first algorithm Smart union algorithms Union and Find. Equivalence Relations.

559 views • 29 slides

WEEK 6 The Disjoint Set Class II

WEEK 6 The Disjoint Set Class II. CE222 – Data Structures &amp; Algorithms II Chapter 8.6, 8.7 (based on the book by M. A. Weiss, Data Structures and Algorithm Analysis in C++, 3rd edition, 2006). OUTLINE. Worst Case Analysis An Application : MAZE GENERATION.

450 views • 23 slides

Disjoint set structures --for Operations over set (Reference: textbook, pp175-180)

Disjoint set structures --for Operations over set (Reference: textbook, pp175-180). CS2223 Recitation 3 March 30, 2005 Song Wang. Problem Description. Given: A set S with N objects, identified using number 1 to N. Disjoint partitions (subsets) of the set S.

403 views • 21 slides

CHAPTER 8 THE DISJOINT SET ADT

CHAPTER 8 THE DISJOINT SET ADT. §1 Equivalence Relations. 【Definition】 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.

249 views • 12 slides

Chapter 8 The Disjoint Set ADT

Chapter 8 The Disjoint Set ADT. Concerns with equivalence problems Find and Union. 8.1 Equivalence Relations. A relation R is defined on a set S if for every pair of elements ( a , b ), a , b  S , aRb ( a ~ b ) is either true or false.

457 views • 21 slides

Disjoint Sets

Disjoint Sets. Want to maintain a collection S = {S 1 , …, S k } of disjoint dynamic sets . Each set has a representative member . Operations: Make-Set(x): Make new singleton set containing object x (x is representative).

554 views • 39 slides

Disjoint Set Neil Tang 02/26/2008

Disjoint Set Neil Tang 02/26/2008. Class Overview. Disjoint Set and An Application Basic Operations Linked-list Implementation Array Implementation Union-by-Size and Union-by-Height(Rank) Find with Path Compression Worst-Case Time Complexity. Disjoint Set.

385 views • 20 slides

Disjoint-Set Operation

Disjoint-Set Operation. Disjoint Set Operations： MAKE-SET(x)：Create new set {x} with representative x. UNION(x,y)：x and y are elements of two sets. Remove these sets and add their union. Choose a representative for it. FIND-SET(x)：return the representative of the set containing x.

704 views • 16 slides

Disjoint-Set Operation

Disjoint-Set Operation. Disjoint Set Operations MAKE-SET(x): Create new set {x} with representative x. UNION(x,y): x and y are elements of two sets. Remove these sets and add their union. Choose a representative for it. FIND-SET(x): return the representative of the set containing x.

354 views • 16 slides

Operation: Ready, Set, Go

EBOLA CONTACT TRACING FOR LOCAL HEALTH DEPARTMENTS. An Overview of North Carolina’s Procedure for Ebola Contact Tracing : Guidance, Tools, and Exercises for Public Health. Operation: Ready, Set, Go. Presented by the N.C. Communicable Disease Branch October 2014. Objectives.

477 views • 30 slides

WEEK 5 The Disjoint Set Class I

WEEK 5 The Disjoint Set Class I. CE222 – Data Structures &amp; Algorithms II Chapter 8.1, 8.2, 8.3, 8.4, 8.5 (based on the book by M. A. Weiss, Data Structures and Algorithm Analysis in C++, 3rd edition, 2006). OUTLINE. Definitions Dynamic Equivalence Problem Operations on Disjoint Sets

607 views • 34 slides

Disjoint Sets

Disjoint Sets. CS2 -- 9/8/2010. Disjoint Sets. A disjoint set contains a set of sets such that in each set, an element is designated as a marker for the set. A simple Disjoint Set: {1}, {2}, {3}, {4}, {5} There is only one marker for each of these sets. The element itself.

326 views • 10 slides

Disjoint set structures --for Operations over set (Reference: textbook, pp175-180)

233 views • 21 slides

Disjoint Set Data Structures

Disjoint Set Data Structures. CSC 252a: Algorithms Pallavi Moorthy 252a-av Smith College December 14, 2000. Outline. What are disjoint sets? What are disjoint set data structures? Explanation of data structure An application – determining connected components

281 views • 11 slides

More Related