Use Kruskal’s Algorithm and Prim’s Algorithm to determine the minimal spanning tree of a weighted graph.