Glossary term
What is Kruskal's algorithm? Meaning for developers
Builds a minimum spanning tree by taking edges from the cheapest up. Skip any edge that joins two vertices that are already connected.
Learn it properly · DSALesson 53: Union-FindGroup things fast: connected groups, finding cycles and minimum spanning trees.