CMSC-341, Spring 1999, Sections 101 and 201

Lecture Synopsis

Implementation of Disjoint Sets as Up-Trees
Representation of Up-Trees in an Array
Heuristics that improve performance of Union-Find
- Path Compression on Find
- Union by Weight (or Size)
Iterated Logarithms

Last modified on Friday May 7, 1999 (11:09:24 EDT) by Alan Baumgarten
email: abaumg1@cs.umbc.edu

Back up to Spring 1999 CMSC-341 Section 1 and 2 Homepage