# 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

**Wikidata**: [Q1468211](https://www.wikidata.org/wiki/Q1468211)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Borůvka's_algorithm)  
**Source**: https://4ort.xyz/entity/bor-vka-s-algorithm


## References

1. Freebase Data Dumps. 2013