Premium Content

Union-Find (Disjoint Set)

Efficient set operations with near-constant time

This chapter requires a subscription to access.

What you'll unlock:

  • 1. Dynamic Connectivity Problem
  • 2. Quick-Find and Quick-Union
  • 3. Union by Rank/Size
  • 4. Path Compression
  • 5. Inverse Ackermann Analysis
  • 6. Applications
Subscribe to Unlock

Already have an account? Sign in