MinSpan Tree(G) uses Kruskal's Algorithm to find and return the edges of the minimum spanning tree of graph G. typedef struct { Vertex v; Vertex w; int weight; } Edge; Edge *Min SpanTree( Graph G) { Edge e, *GraphEdges, *Tree Edges; DisjSet S; PriorityQueue H; SetType w_set, v_set; N = NumOfVex(G); S = CreateDisjSet(N); /* create disjoint set s */ GraphEdges = GetEdges(G); /* get all edges of graph G */ Tree Edges = malloc( sizeof(Edge) * N); H = Build Heap( GraphEdges, N); /* build min heap H from the edges of graph G */ edges_accepted = 0; while (edges_accepted