Graph #2

Given your Graph data structure from part #1, implement an algorithm to return a Minimum Spanning Tree – you may use Prim or Kruskal!