Union-Find (Disjoint Set)
Category: Computer Science · Added: 2026-03-23
About This Module
Visualize how the Union-Find data structure efficiently tracks and merges disjoint sets.
This interactive visualization module on Riano lets you adjust parameters in real time
and observe how union-find (disjoint set) works. Each module includes an
interactive component with adjustable controls and a companion theory article explaining
the underlying mathematical or scientific concepts.
Learn computer science algorithms and data structures including sorting, searching, graph algorithms, and tree operations through step-by-step animations.
⚡ This module requires JavaScript for the interactive visualization.
Please enable JavaScript in your browser to use the interactive controls,
adjust parameters, and explore the visualization.
Related Computer Science Modules
- A* Pathfinding — Finds the shortest path on a grid using heuristics.
- AVL Tree Rotations — Visualize self-balancing binary search trees through balance factors and rotations.
- B-Tree Visualization — Visualize B-Tree node splitting, key insertion, and tree balancing with customizable degree parameters.
- Bellman-Ford Algorithm — Visualize the shortest path algorithm that handles negative edge weights by relaxing all edges in V-1 iterations.
- Binary Search — Finding elements in sorted data by halving the search space.
- Bloom Filter — Visualize Bloom Filter element insertion, hash function mapping, and false positive probability.
- Consistent Hashing — Visualize consistent hashing with virtual nodes for distributed caching and load balancing.
- Convex Hull — Convex Hull
Browse all modules on Riano →