编写程序输出该无向网络的最小生成树以及该最小生成树的所有边。
#include<stdio.h>
#define MaxInt 1000 //定义无穷大,这里设置一个比所有边的权值都大的数9
#define MVNum 100
typedef char VerTexType; //顶点类型
typedef int ArcType; //边权值类型
//邻接矩阵的存储结构
typedef struct Graph
{
VerTexType vexs[MVNum]; //顶点表
ArcType arcs[MVNum][MVNum]; //邻接矩阵
int vexnum, arcnum; //图的当前点数和边数
}AMGraph;
//最小生成树普里姆算法定义
//辅助数组
typedef struct closeg
{
VerTexType adjvex;
ArcType lowcost;
}closedge[MVNum];
//函数声明
void printGraph(AMGraph G);
int LocateVex(AMGraph G, char v);
int Min(closedge C, AMGraph G);
//创建无向网
void CreateUDN(AMGraph &G)
{
G.vexnum = 7; //输入总顶点数和边数
G.arcnum = 9;
G.vexs[0] = 'v0'; //输入顶点信息
G.vexs[1] = 'v1';
G.vexs[2] = 'v2';
G.vexs[3] = 'v3';
G.vexs[4] = 'v4';
G.vexs[5] = 'v5';
G.vexs[6] = 'v6';
//初始化邻接矩阵为极大值
for (int i = 0; i < G.vexnum; i++)
{
for (int j = 0; j < G.vexnum; j++)
{
G