CSCI2100 · Definition · Chapter 1 · Disjoint sets
Disjoint-set operations
1 steps of prerequisites below it
A disjoint-set structure maintains a partition of {0,…,n−1}, starting from singletons, with find returning a representative of an element’s set and unite merging two different sets.
Taught in
Builds on
Used by
Lenses
- Unions as joins of partitions · Structural
Everything this builds on, earliest first · 1 steps
Each step comes after its own prerequisites, so reading in this order never needs something you have not met. It is a reading order for these notes, not a diagnosis of what you know.
- Partition · 1.1
Possible roots and a review route need your own answers on these points. None are recorded yet, so none are suggested.
Longest chain down to a starting point
Each step is used by the one above it, across courses where the notes link them. It ends at a point the notes define without another point.