Upon initialization, this algorithm creates a (*) forest of size V and then utilizes the cut property by sorting alledges of the graph and then checking for cycles with the lowest-weight, unused edge.
For this algorithm to be implemented efficiently, a fast union-find data structure is required, because itallows for the determination of connectivity. The complexity of the standard form of this algorithm can bereduced from O(E logE) to the mathematically equivalent O(E logV) by using properties of the logarithm.Upon initialization, this algorithm creates a (*) forest of size V and then utilizes the cut property by sorting alledges of the graph and then checking for cycles with the lowest-weight, unused edge. This algorithm differs fromanother that accomplishes a similar task because this algorithm works for disconnected graphs. For 10 points, namethis greedy algorithm for finding the minimum spanning tree of a graph, which is more generalized than Prim'salgorithm.
For this algorithm to be implemented efficiently, a fast union-find data structure is required, because itallows for the determination of connectivity.
Kruskal's algorithm [prompt on "minimum spanning tree finding algorithm" until "minimum spanning tree" is mentioned]