UnionFind - Course Outline s s s s s s s s Abstract data...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Course Outline Course Outline Abstract data types and algorithm analysis (Ch. 2, 3) C++ review (Ch. 1) Sets in general: Balanced search trees (Ch. 4 and 12.2) Sets with insert/delete/member: Hashing (Ch. 5) Sets with priority: Heaps, priority queues (Ch. 6) Graphs: Shortest-path algorithms (Ch. 9.1 – 9.3.2) Sets with disjoint union: Union/find trees (Ch. 8.1 – 8.5) Graphs: Minimum spanning trees (Ch. 9.5)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 Disjoint set ADT (also Disjoint set ADT (also Dynamic Equivalence Dynamic Equivalence ) ) The universe consists of n elements , named 1, 2, …, n The ADT is a collection of sets of elements Each element is in exactly one set sets are disjoint to start, each set contains one element Each set has a name , which is the name of one of its elements (any one will do)
Background image of page 2
3 Disjoint set ADT, continued Disjoint set ADT, continued Setname = find ( elementname ) returns the name of the unique set that contains the given element not the same as “find” in search trees
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/21/2011 for the course CMPSC 130a taught by Professor Suri during the Winter '11 term at UCSB.

Page1 / 9

UnionFind - Course Outline s s s s s s s s Abstract data...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online