Borůvka's algorithm
Sign in to saveAlso known as Sollin'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
Wikidata facts
- Image
- Boruvka's algorithm (Sollin's algorithm) Anim.gif
Show 2 more facts
- publication date
- 1926-00-00
- Commons category
- Borůvka's algorithm
Sources (1)
via Wikidata · CC0
Connections
Bellman–Ford algorithm
Entity
digital object identifier
Entity
Moravia
Entity
parallel computing
Entity
electrical grid
Entity
Dijkstra's algorithm
Entity
Jan Łukasiewicz
Entity
depth-first search
Entity
breadth-first search
Entity
Hugo Steinhaus
Entity
big O notation
Entity
memory address
Entity
Q22908627
Entity
planar graph
Entity
greedy algorithm
Entity
Prim's algorithm
Entity
A* search algorithm
Entity
minimum spanning tree
Entity
Kruskal's algorithm
Entity
time complexity
Entity