Home▸Algorithms & AI▸3D Union-Find: Disjoint-Set Forest, Union by Rank and Path Compression

🌳 3D Union-Find: Disjoint-Set Forest, Union by Rank and Path Compression

A forest of floating islands shows a disjoint-set forest: click to find, union two sets, watch parent pointers and path compression rewrite the trees, compare linking and compression rules, and run Kruskal MST; mean hops are checked against the inverse-Ackermann bound.

Algorithms & AI3DModerate60 FPS📱 Mobile-adapted🟠 Blender⇄ 2D version
3D Union-Find: Disjoint-Set Forest, Union by Rank and Path Compression ↗ Open standalone
⚙ Under the hood

A forest of floating islands shows a disjoint-set forest: click to find, union two sets, watch parent pointers and path compression rewrite the trees, compare linking and compression rules, and run Kruskal MST; mean hops are checked against the inverse-Ackermann bound.

Union-FindDisjoint Set UnionPath CompressionUnion by RankInverse AckermannKruskal MSTData Structures

3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install

What did you find?

Add reproduction steps (optional)