Fpg实验五 最小生成树一、需求分析1、本程序の目の是要建设一个最经济の网，，输出相应の最小生成树。在这里都用整型数来代替。2、测试数据见下程序。二、概要设计主程序：int main(){初始化；while (条件){接受命令;处理命令;}return 0;}三、详细设计#include//头文件using namespace std;#define MAX_VERTEX_NUM 20//最大结点数#define MAX 200typedef struct Close//结构体FpgFpg{char adjvex;int lowcost;}Close,close[MAX_VERTEX_NUM];typedef struct ArcNode{int adjvex;ArcNode *nextarc;int info;}ArcNode;typedef struct VNode{char data;ArcNode *firstarc;}VNode,AdjList[MAX_VERTEX_NUM];typedef struct{AdjList verties;int vexnum,arcnum;}ALGraph;ALGraph G;//对象 Gint LocateVek(ALGraph ,char );//返回结点位置int minimum(close);//返回最小数void MinSpanTree_PRIM(ALGraph,char);//最小生成树void Create(ALGraph &);//创建邻接表int main(){char a;int i=1;Create(G);/*for(int i=1;i<=G.vexnum;i++){}*/while(i){cout<<"输入起点 : ";cin>>a;MinSpanTree_PRIM(G,a);cout<<"如果结束输入'0',否则输入'1':";cin>>i;}return 0;}for(s=G.verties[i].firstarc;s!=NULL;s=s->nextarc)cout<adjvex].data<<"===="<info<nextarc)if(j==s->adjvex){closedge[j].lowcost=s->info;break;}if(m[i].lowcost
