Original: The first algorithm for finding a minimum spanning tree was developed by Czech scientist Otakar BorÅ vka in 1926 ( see BorÅ vka 's algorithm ) .
Simplified: Czech scientist Otakar BorÅ vka developed the first known algorithm for finding a minimum spanning tree , in 1926 .