Revision as of 04:45, 12 April 2018 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,645 edits or actually I think Georges ← Previous edit		Revision as of 09:56, 18 October 2018 edit undo 178.197.225.246 (talk) No mention of greedyness anywhere, while Kruskal article has it. Editing to make it more obvious. Next edit →
Line 2: {{graph search algorithm}} '''Borůvka's algorithm''' is ana [[greedy algorithm]] for finding a [[minimum spanning tree]] in a graph for which all edge weights are distinct, or a minimum spanning forest in the case of a graph that is not connected.

Borůvka's algorithm: Difference between revisions