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
Deutsch dewiki
English enwiki
español eswiki
فارسی fawiki
français frwiki
italiano itwiki
polski plwiki
português ptwiki
русский ruwiki
српски / srpski srwiki
ไทย thwiki
українська ukwiki
Tiếng Việt viwiki
[add]
[add]
[add]
[add]
[add]
[add]