图解最小生成树算法与应用

#include<iostream>
#include<stdlib.h>
//#include<fstream>
using namespace std;
#define Max 50
#define MM  10000
typedef int Elemtype;

typedef struct ArcCell{
  Elemtype adj;
 struct ArcCell *Infor;
}ArcCell;//邻接单元

typedef struct Mgraph{
   ArcCell AdjMatrix[Max][Max];
     int Vnode;
  int Edge;
}Mgraph;//邻接矩阵
typedef struct Closedge{
   Elemtype adjvex;
     Elemtype lowcost;
}Closedge;

void CreateMgraph(Mgraph * MG)//创建图的邻接矩阵
{
    int V,E,i,j,vertex1,vertex2;
Elemtype weight;
cout<<"请输入图的顶点数目，边的数目:V,E:"<<endl;

 cin>>V>>E;