Why it matters
Dynamic connectivity is fundamental dynamic problem. Understanding shapes dynamic graphs.
Advertisement
The architecture
Spanning forest maintained.
Edge insert: add to forest if reduces components.
Edge delete: search replacement.
Advertisement
How it works end to end
Holm + Lichtenberg + Thorup 1998.
Euler tour trees or link-cut.
Levels for amortization.