Disjoint Set Union animated: union by rank merges trees, find compresses paths — parent and rank arrays shown live with every operation narrated.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Union-Find (DSU) Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. Disjoint Set Union animated: union by rank merges trees, find compresses paths — parent and rank arrays shown live with every operation narrated. It's built for speed and privacy: Everything runs locally in your browser — your data is never uploaded to a server. No sign-up, no installs, and no daily limits.
Visualize the dataset after it has been cleaned enough for reliable labels and numeric values.
Review the preview, copy or download the result, and keep everything local in your browser.
Kruskal's Algorithm Visualizer: Kruskal's MST animated: edges taken cheapest-first unless Union-Find detects a cycle — accepted edges green, rejected cycles red.
Open toolData Structure Playground: Hands-on stack, queue, linked list, and hash table — every push, pop, pointer rewire, and collision narrated with its O(1)/O(n) cost, plus an interactive Big-O growth explorer.
Open toolAlgorithm Academy: 35+ classic algorithms animated step by step — searching, counting/radix/bucket sort, dynamic programming tables, greedy, backtracking, KMP, graph algorithms, max flow, and convex hull — with auto-play, next/prev stepping, adjustable interval, and pseudocode that highlights the running line.
Open tool1Union-Find (Disjoint Set Union): 8 elements, each its own set (parent = itself). union() merges sets; find() returns a set's root representative.
parent[i] = i for all iunion(a, b):attach lower-rank root under higherfind(x):walk to root, compress the pathsame root ⇒ same set (cycle!)α(n) ≤ 4 for any real n
Tracks which elements belong to the same set. union() merges by rank, find() compresses paths — together they make Kruskal, connectivity, and cycle detection nearly free.
