【数据结构】Kruskal算法最小生成树

#include<iostream>
#define dataType int
using namespace std;
const int MaxVertex = 10;
const int MaxEdge = 100;
struct EdgeType {
   
	int from, to;
	int weight;
};

class EdgeGraph {
   
	private:
		dataType vertex[MaxVertex];
		EdgeType edge[MaxVertex];
		int vertexNum, edgeNum;
		int parent[MaxVertex];
	public:
		EdgeGraph(int n, int e, dataType v[]);
		int findRoot(int v);
		void Kruskal();
		void outputMST(EdgeType edge)