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

Statements

Language Code Linked page
čeština cswiki [edit]
Deutsch dewiki [edit]
English enwiki [edit]
español eswiki [edit]
فارسی fawiki [edit]
français frwiki [edit]
italiano itwiki [edit]
polski plwiki [edit]
português ptwiki [edit]
русский ruwiki [edit]
српски / srpski srwiki [edit]
ไทย thwiki [edit]
українська ukwiki [edit]
Tiếng Việt viwiki [edit]
[add]
[add]
[add]
[add]
[add]
[add]