Glossary term
What is Prim's algorithm? Meaning for developers
Builds a minimum spanning tree by growing one tree outwards. It always adds the cheapest edge to a new vertex.
Learn it properly · DSALesson 53: Union-FindGroup things fast: connected groups, finding cycles and minimum spanning trees.