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