Q1468211

From Wikidata
Jump to: navigation, search

Borůvka's algorithm (Q1468211) [edit]

Algorithm for finding minimum spanning trees by repeatedly finding the shortest edge out of each subtree in a forest and adding all such edges to the forest [edit]

Also known as:
  • Sollin's algorithm
[edit]

Statements

/m/01c0p6
1 reference