CSCI2100 · Method · Chapter 1 · Disjoint sets
Path compression
2 steps of prerequisites below it
Path compression lets find redirect every element visited on the way to the root so that it points directly to that root.
Taught in
Builds on
- Parent forest · used in an argument or worked solution, passage 1.1
Used by
Everything this builds on, earliest first · 2 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
- Parent forest · 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.