Borůvka's algorithm (Q1468211)
Jump to navigation
Jump to 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
| 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 |
|
Statements
Boruvka's algorithm (Sollin's algorithm) Anim.gif
1,198 × 673; 479 KB
1,198 × 673; 479 KB
Animation of Boruvka's algorithm (English)
Animation représentant l'algorithme de Borůvka, dans la version sans contraction. (French)
1 reference
1926
0 references
Borůvka's algorithm
0 references
Identifiers
Sitelinks
Wikipedia(16 entries)
- cswiki Borůvkův algoritmus
- dewiki Algorithmus von Borůvka
- enwiki Borůvka's algorithm
- eswiki Algoritmo de Boruvka
- fawiki الگوریتم بروکا
- frwiki Algorithme de Borůvka
- huwiki Borůvka-algoritmus
- itwiki Algoritmo di Borůvka
- jawiki ブルーフカ法
- plwiki Algorytm Borůvki
- ptwiki Algoritmo de Borůvka
- ruwiki Алгоритм Борувки
- srwiki Boruvka algoritam
- thwiki ขั้นตอนวิธีของโบรุฟกา
- ukwiki Алгоритм Борувки
- viwiki Thuật toán Borůvka
Wikibooks(0 entries)
Wikinews(0 entries)
Wikiquote(0 entries)
Wikisource(0 entries)
Wikiversity(0 entries)
Wikivoyage(0 entries)
Wiktionary(0 entries)
Multilingual sites(1 entry)
- commonswiki Category:Borůvka's algorithm