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