Revision as of 12:19, 27 March 2025 edit 186.185.247.155 (talk) →Pseudocode: Fails Tags: Reverted Mobile edit Mobile web edit ← Previous edit		Revision as of 12:20, 27 March 2025 edit undo 186.185.247.155 (talk) →Pseudocode: Fails Tags: Reverted Mobile edit Mobile web edit Next edit →
Line 60: '''output:''' ''F'', a minimum spanning forest of ''G''. Initialize a forest ''F'' to (''V'', ''{{prime\|E}}'') where ''{{prime\|E}}'' = {}. PROFE DE LAS NOTAS DE ELEMENTO PORFA ''completed'' := '''false'''

Borůvka's algorithm: Difference between revisions