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
Press Enter · cited answer in seconds
0 sources
Borůvka's algorithm
Summary
Borůvka's algorithm is a graph algorithm[1]. It draws 77 Wikipedia views per month (graph_algorithm category, ranking #2 of 12).[2]
Key Facts
- Borůvka's algorithm is credited with the discovery of Otakar Borůvka[3].
- Borůvka's algorithm's image is recorded as Boruvka's algorithm (Sollin's algorithm) Anim.gif[4].
- Borůvka's algorithm's instance of is recorded as graph algorithm[5].
- Borůvka's algorithm's instance of is recorded as mathematical concept[6].
- Otakar Borůvka is named after Borůvka's algorithm[7].
- Borůvka's algorithm's Commons category is recorded as Borůvka's algorithm[8].
- Borůvka's algorithm's publication date is recorded as +1926-00-00T00:00:00Z[9].
- Borůvka's algorithm's Freebase ID is recorded as /m/01c0p6[10].
- Borůvka's algorithm's computes solution to is recorded as minimum spanning tree[11].
- Borůvka's algorithm's Dictionary of Algorithms and Data Structures ID is recorded as boruvkasAlgorithm[12].
Body
Designation and Status
Recorded instance of include graph algorithm[5] and mathematical concept[6].
History and Context
Otakar Borůvka is named after Borůvka's algorithm[7].
Why It Matters
Borůvka's algorithm draws 77 Wikipedia views per month (graph_algorithm category, ranking #2 of 12).[2] It has Wikipedia articles in 16 language editions, a strong signal of global cultural recognition.[13] It is known by 13 alternative names across languages and contexts.[14]