DM.GT.4.c: Use Prim’s algorithm to determine the shortest spanning tree of a connected graph.