Lecture Synopsis

26. Disjoint Set

• 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