Revision as of 07:55, 9 October 2004 edit Dcoetzee (talk \| contribs) 37,529 edits m Link Bernard Chazelle ← Previous edit		Revision as of 10:40, 16 January 2005 edit undo Dcoetzee (talk \| contribs) 37,529 edits No edit summary Next edit →
Line 1: [[Category:Trees (structure)]] '''Borůvka's algorithm''' is an [[algorithm]] for finding [[minimum spanning tree]]s. It was first published in [[1926]] by [[Otakar Borůvka]] as a method of ~~efficiently~~constructing ~~electrifying~~an efficient electricity network for [[Bohemia]]. Borůvka's algorithm, in pseudocode, given a graph ''G'', is:

Borůvka's algorithm: Difference between revisions