Algorithms Prim:Grow an MST From a Seed Vertex Grow a min-heap of crossing edges from a seed until every vertex is in the tree — a Dijkstra-shaped frontier for an MST, not distances from a source. Read More →