Starting this assignment is contingent on you having a working Graph implementation. For this assignment, you must only implement a single function MinimumSpanningTree in the mst.go file. Make sure to merge/copy your graph.go file into the mst branch of the graph repository.
Your implementation of MinimumSpanningTree can use either Prim's or Kruskal's algorithm (documentation must clearly identify which you've used). Note that the function should also return false if it is not possible to create a MST e.g. graph is directed.