Алгоритмы и структуры данных 8. Алгоритмы Прима, Крускала, Борувки

The lecture begins at 0:00 with an introduction, then at 0:30 the instructor discusses bidirectional BFS. At 4:20 the correctness of the algorithm is examined, followed by a discussion of minimal spanning trees at 9:00. The safe edge lemma is covered at 13:30, and Prim’s algorithm is presented at 21:50. Kruskal’s algorithm follows at 29:25, after which the concept of disjoint set systems is explained at 33:20. The lecture concludes with Boruvka’s algorithm at 57:25.