Data structureresearch
Persistent union-find
Also called Conchon-Filliatre persistent union-find, persistent disjoint sets.
A disjoint-set structure with versioned unions and finds, built with rerooting and path compression.
A disjoint-set structure with versioned unions and finds, built with rerooting and path compression.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag ZTTVD6 Edit this page History Report an error