Prim's MST algorithm growing a tree from one seed node.

Weighted graph · Prim greedy + heap tree frontier (in heap) current
Priority queue (cut-edges by weight)
empty
Step 0 / 0

Press Play. Seed the tree with one node, then keep pulling the cheapest cut-edge from the heap.

Start Speed
tree nodes
0
total weight
0
heap size
0
progress
0%
timeline0 / 0
←→space walk steps