Output: The minimum spanning forest of G' and the contracted edges from the Borůvka steps Correctness is proved by induction on the number of vertices in the graph.
Output: The minimum spanning forest of G' and the contracted edges from the Borůvka steps درستی الگوریتم را با استقرا روی تعداد رئوس گراف ثابت می کنیم.