Borůvka's algorithm: Difference between revisions

Content deleted Content added

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		Latest revision as of 14:54, 27 March 2025 edit undo Patrick Welsh (talk \| contribs) Extended confirmed users, IP block exemptions, Pending changes reviewers, Rollbackers 7,910 edits m RCP reverted edits by 186.185.247.155 (Talk); changed back to last revision by JJMC89 bot III: Unconstructive edit Tag: Rollback
(One intermediate revision by one other user not shown)
Line 48: == Pseudocode == The following pseudocode illustrates ~~PROFE DE LAS NOTAS PORFAa~~a 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.