Lecturn on minimum spanning trees
June 29, 2026
I gave this lecture to finalists of the Luxembourgish olympiad in informatics.
We introduce minimum spanning trees and explain the two main algorithms to produce them, Prim’s and Kruskal’s.
On the way we discuss union-find data structures.
We finish the training by looking at the IOI 2022 problem Toy design.
You can find the slides here: Minimum spanning trees
Supporting material: Material