1,186 views
This video discusses the optimality of Prim's algorithm for the minimum spanning tree problem. It assumes that you have watched the video on the algorithm itself: • Minimum spanning tree: Algo... The video provides a proof by induction of Prim's optimality. We therefore seek to show that the spanning tree produced is indeed minimal. Note/typo: the inequality written at 7:35 (the oral speech is correct) is indeed a left equality: w(Z') = w(Z) + w(uv) - w(e) The key point here is to note that w(Z') is less than or equal to w(Z)