Concepts2
🗂️Data StructureAdvanced
Persistent DSU (Fully Persistent Union-Find)
A persistent DSU (Union-Find) keeps all historical versions so you can query connectivity at any past version and even branch new futures from old states.
#persistent dsu#fully persistent union-find#union by rank+12
🗂️Data StructureAdvanced
Euler Tour Tree
An Euler Tour Tree represents each rooted tree as a DFS open/close sequence so that every subtree is a single contiguous interval.
#euler tour tree#implicit treap#dynamic forest+11