Borůvka's algorithm: Difference between revisions

Content deleted Content added
m typos
m typo
Line 14:
***Add the cheapest edge in ''S'' to ''E''
**Add the resulting set of edges ''E'' to ''T''.
*The resulting set of edges ''T'' is the minimum spanning tree of ''G''