Content deleted Content added
→Pseudocode: removing the "orignal research" (a.k.a common sense), as well as the previously-present instance thereof |
→Pseudocode: unambiguous wikilink |
||
Line 49:
''completed'' = '''false'''
'''while''' not ''completed'' '''do'''
Find the [[Component_(graph_theory)|connected component]]s of ''F'' and assign to each vertex its component
Initialize the cheapest edge for each component to "None"
'''for each''' edge ''uv'' where ''u'' and ''v'' are in different components:
| |||