Lecture 34

Union-Find Data Structure

Learning Outcomes

At the end of this lecture, you’ll be able to:

Lecture Plan

In this lecture, we'll cover the following lessons:

  1. Dynamic Connectivity: A Data Structure for Graphs
  2. Union-Find Data Structure: Introduction
  3. Union-Find Data Structure: Operations
  4. Implementation: Quick Find
  5. Implementation: Quick Union
  6. Quick Union: Improvement 1: Weighting
  7. Quick Union: Improvement 2: Path Compression
  8. Quick Union: Exercise
  9. Quick Union: Runtime after improvements!
  10. Kruskal's Runtime: Using Union-Find

Lessons marked with ⚡ contain exercise/activity.