Borůvka's algorithm (Q1468211)

From Wikidata
Jump to: navigation, search
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
  • Sollin's algorithm
edit
Language Label Description Also known as
English
Borůvka's algorithm
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
  • Sollin's algorithm

Statements

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit