Prim's algorithm
Grow one tree from a start vertex, always adding the cheapest edge to a vertex not yet in it.
This lesson is part of Pro.
Free covers the C and Python courses, the first three DSA topics, the opening system design lessons and the beginner AI lessons, all with the full coach. Pro opens the rest of the library in the FollowtheDamnCode app.