Borůvka's algorithm: Difference between revisions

Content deleted Content added
Tags: Reverted Mobile edit Mobile web edit
m RCP reverted edits by 186.185.247.155 (Talk); changed back to last revision by JJMC89 bot III: Unconstructive edit
 
Line 48:
== Pseudocode ==
 
The following pseudocode illustrates PROFE DE LAS NOTAS PORFAaa basic implementation of Borůvka's algorithm.
In the conditional clauses, every edge ''uv'' is considered cheaper than "None". The purpose of the ''completed'' variable is to determine whether the forest ''F'' is yet a spanning forest.
 
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'''