A minimum spanning tree algorithm that finds the minimum spanning tree of a graph by repeatedly adding the next cheapest edge that does not create a cycle.
A minimum spanning tree algorithm that finds the minimum spanning tree of a graph by repeatedly adding the next cheapest edge that does not create a cycle.