typedef struct{
		int begin;
		int end;
		int weight;
	}Edge;
	
	void MiniSpanTree_Kruskal(MGraph G){
		int i,n,m;
		Edge edges[MAXEDGE];
		int parent[MAXEDGE];
		for(i = 0;i<G.numEdges;i++){
			n = Find(parent,edges[i].begin);
			m = Find(parent,edges[i].end);
			if(n!=m){
				parent[n] = m;
				printf("(%d,%d) %d",edges[i].begin,edges[i].end,edges[i].weight);
			}
		}
	}
	
	int Find(int *parent,int f){
		while(parent[f]>0){
			f = parent[f];	
		}
		return f;
	}