Prim's Algorithm
#Computers
A way of finding a MST by defining two groups st arting with one node in one of the groups, choosing the minimum edge $\displaystyle e_{\text{min}}$ between the two groups, and gradually adding the node connected by $\displaystyle e_{\text{min}}$