Math for Non-Math Majors
Kruskal’s algorithm is a method used to find the minimum spanning tree of a connected, undirected graph. It adds edges in increasing order of weight without forming any cycles until all vertices are connected.
congrats on reading the definition of Kruskal’s algorithm. now let's actually learn it.