tailieunhanh - Lecture Design and Analysis of Algorithms: Lecture 37 - Dr. Sohail Aslam

Kruskal’s algorithm worked by ordering the edges, and inserting them one by one into the spanning tree, taking care never to introduce a cycle. Intuitively Kruskal’s works by merging or splicing two trees together, until all the vertices are in the same tree. In contrast, Prim’s algorithm builds the MST by adding leaves one at a time to the current tree. In this lecture, you find clear explanations of Prim’s Algorithm. |