Revision as of 18:58, 22 July 2005 edit 216.234.56.130 (talk) No edit summary ← Previous edit		Revision as of 07:56, 11 September 2005 edit undo 213.220.206.92 (talk) No edit summary Next edit →
Line 1: '''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 constructing an efficient electricity network for [[~~Bohemia~~Moravia]]. Borůvka's algorithm, in pseudocode, given a graph ''G'', is:

Borůvka's algorithm: Difference between revisions