A minimum spanning tree algorithm that finds the minimum spanning tree of a graph by starting from an arbitrary node and repeatedly adding the next cheapest edge that connects a previously visited node to an unvisited node.
A minimum spanning tree algorithm that finds the minimum spanning tree of a graph by starting from an arbitrary node and repeatedly adding the next cheapest edge that connects a previously visited node to an unvisited node.