最小生成树和迷宫求解问题

#include <iostream>#include <fstream>using namespace std;ifstream fin("prim.txt");#define MAX_VERTEX

#include<iostream> #include<fstream> std; usingnamespace ifstreamfin(); "prim.txt" MAX_VERTEX_NUM20 #define ERROR-1 #define INFINITY0x7fff #define //图的邻接矩阵存储结构 typedef{ struct *vexs; char arcs[MAX_VERTEX_NUM][MAX_VERTEX_NUM]; int vexnum,arcnum; int }Graph; //记录从顶点集U到V-U的代价最小的边的辅助数组定义： typedef{ struct adjvex; char lowcost; int }closedge; //图G中查找顶点c的位置 LocateVex(GraphG,c){ intchar (i=;i<G.vexnum;++i){ forint 0 (G.vexs[i]==c)i; ifreturn } ERROR; return } minimum(closedgecs[MAX_VERTEX_NUM]); int //创建无向网 CreateUDN(Graph&G){ void //采用数组（邻接矩阵）表示法，构造无向网G fin>>G.vexnum>>G.arcnum; G.vexs=(*)malloc((G.vexnum+)*()); charsizeofchar //需要开 1 辟多一个空间存储'\0' //构造顶点向量 (i=;i<G.vexnum;i++) forint 0 fin>>G.vexs[i]; G.vexs[G.vexnum]=; '\0'