Revision as of 20:21, 17 June 2021 edit 84.245.120.107 (talk) →Pseudocode: unambiguous wikilink ← Previous edit		Revision as of 20:29, 17 June 2021 edit undo 84.245.120.107 (talk) →Pseudocode: specify that E' is initially empty Next edit →
Line 45: '''output:''' ''F'', the minimum spanning forest of ''G''. Initialize a forest ''F'' to (''V'', ''E'''') where ''E''' = {}. ''completed'' = '''false'''

Borůvka's algorithm: Difference between revisions