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
Facts
5 properties- Instance of
- graph algorithm, mathematical concept[3]
- Publication date
- 1926[5]
- Computes solution to
- minimum spanning tree[6]
- Discoverer or inventor
- Otakar Borůvka[2]
- Named after
- Otakar Borůvka[4]
🏷️ Also known as
en Sollin's algorithm
en Borůvka's algorithm
cs Borůvkův hladový algoritmus
cs Borůvkův algoritmus
de Algorithmus von Borůvka
de Algorithmus von Boruvka
el Αλγόριθμος του Μπορούφκα
es algoritmo de Boruvka
fa الگوریتم بروکا
fr algorithme de Boruvka
fr algorithme de Borůvka
hu Borůvka-algoritmus
it algoritmo di Boruvka
it algoritmo di Borůvka
ja ブルーフカ法
pl Algorytm Boruvki
pl Algorytm Borůvki
pl Algorytm Sollina
ru алгоритм Борувки
sv Borůvkas algoritm
🔖 Identifiers · 3
- Image (Wikimedia Commons)
- Boruvka's algorithm (Sollin's algorithm) Anim.gif ↗
- Dictionary of Algorithms and Data Structures ID
- boruvkasAlgorithm
- Freebase ID
- /m/01c0p6
🔗 Connections
Computes solution to 1
Created notable works 1
Discoverer or inventor 1
Named after 1
Press Enter · cited answer in seconds
0 sources
Summary
Borůvka's algorithm is a graph algorithm[1].