Prim’s Algorithm for minimum spanning tree
Download as PDF
Chao Yuan and Haofei Zhang
Prim's algorithm is an algorithm that can search for the minimum spanning tree (MST) in a weighted connectivity diagram. It has been widely used in many fields such as communication, internet and programming. Based on these studies, here we further elaborated the details of Prim's algorithm such as the basic steps of the Prim's algorithm, pseudo-code, theoretical and practical examples, and codes in Java representing the Prim's algorithm to help others understand it. We are also studied the ways of improvements and optimizations to the Prim's algorithm and he deeper understanding and development of Prim's algorithms can optimize technology in many areas.
Spanning tree, Minimum spanning tree, MST, Prim’s Algorithm