Borůvka's algorithm (Undirected, General MST Minimum Spanning Tree (MST)): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 11:3711:37, 15 February 2023‎ Admin talk contribs‎ 276 bytes +276‎ Created page with "== Time Complexity == $O(ElogV)$ == Space Complexity == $O(V)$ auxiliary words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1926 == Reference == -"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Borůvka%27s_algorithm_(Undirected,_General_MST_Minimum_Spanning_Tree_(MST))"