Kruskal's MST animated: edges taken cheapest-first unless Union-Find detects a cycle — accepted edges green, rejected cycles red.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Kruskal's Algorithm Visualizer is a free, browser-based tool that helps you understand a dataset at a glance. Kruskal's MST animated: edges taken cheapest-first unless Union-Find detects a cycle — accepted edges green, rejected cycles red. 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.
Profile the data first so missing values, types, duplicates, and outliers are visible before you edit it.
Review the preview, copy or download the result, and keep everything local in your browser.
Prim's Algorithm Visualizer: Prim's minimum spanning tree animated: the tree grows by always taking the cheapest crossing edge — cut property in action with live narration.
Open toolUnion-Find (DSU) Visualizer: Disjoint Set Union animated: union by rank merges trees, find compresses paths — parent and rank arrays shown live with every operation narrated.
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 tool1Kruskal's MST: sort ALL edges by weight, take each unless it closes a cycle. Cycle detection = Union-Find (disjoint sets).
sort edges by weightfor each edge (a, b):if find(a) != find(b):union(a, b); take edgeelse: reject (cycle)stop at V-1 edges
Sort all edges; take each unless Union-Find says it closes a cycle. Doubles as the standard Union-Find demo.
