Prim's minimum spanning tree animated: the tree grows by always taking the cheapest crossing edge — cut property in action with live narration.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Prim's Algorithm Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. Prim's minimum spanning tree animated: the tree grows by always taking the cheapest crossing edge — cut property in action with live narration. 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 toolDijkstra's Algorithm Visualizer: Dijkstra's shortest path animated: settle the closest node, relax its edges, watch distances improve — with a live distance table and pseudocode.
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 tool1Prim's MST from A: repeatedly add the CHEAPEST edge that connects the tree to a new node (the greedy "cut property" guarantees it belongs to some MST).
tree = {start}while tree misses nodes:e = cheapest edge leaving treeadd e and its new endpointMST complete
Grow one tree by always taking the cheapest edge leaving it. The cut property makes the greedy choice safe.
