Prim's

Grow the tree from a start node, always adding the cheapest edge to an unvisited node via a min-heap — good for dense graphs.