Advanced Algorithms Analysis and Design - Lecture 32: Minimal spanning tree problem. In this lecture we will cover the following: importance of minimal spanning trees (MST); MST problem (generic solution, proofs of correctness); Kruskal’s algorithm; Prim’s algorithm; . |