LECTURE 19 OF 25
Union-Find (Disjoint Set Union)
Maintain connected groups while new links arrive, without searching the whole graph after every update.
Builds on
Best read after 2. Arrays, 18. Graphs — you can still read ahead, but some of this may lean on ideas covered there.