Prim’s algorithm is a greedy method for building a Minimum Spanning Tree (MST)
Add Nodes to see how Prim's Algorithm uses a greedy method to select only the smallest edge values, so that all nodes are connected, but not connected in a way that would create an infinite loop. How does it do this?