Content deleted Content added
Line 5:
Other algorithms for this problem include [[Prim's algorithm]] and [[Kruskal's algorithm]]. Faster algorithms can be obtained by combining Prim's algorithm with Borůvka's. A faster randomized algorithm due to Karger, Klein and Tarjan runs in expected O(m) time, where m is the number of edges in the graph.
[[Category:
|