Prim's Algorithm

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

$O(E\log V)$