實驗?zāi)康耐ㄟ^上機實驗進(jìn)一步掌握圖的存儲結(jié)構(gòu)及基本操作的實現(xiàn)。實驗內(nèi)容與要求要求：⑴能根據(jù)輸入的頂點、邊/弧的信息建立圖；⑵實現(xiàn)圖中頂點、邊/弧的插入、刪除；⑶實現(xiàn)對該圖的深度優(yōu)先遍歷；⑷實現(xiàn)對該圖的廣度優(yōu)先遍歷。備注：單號基于鄰接矩陣，雙號基于鄰接表存儲結(jié)構(gòu)實現(xiàn)上述操作。數(shù)據(jù)結(jié)構(gòu)設(shè)計邏輯結(jié)構(gòu)：圖狀結(jié)構(gòu)存儲結(jié)構(gòu)：順序存儲結(jié)構(gòu)、鏈?zhǔn)酱鎯Y(jié)構(gòu)算法設(shè)計#include<stdio.h>#include<string.h>#include<stdlib.h>#defineMAX_VERTEX_NUM20typedefstructArcNode{ intadjvex; structArcNode*nextarc;}ArcNode;typedefstructVNode{ chardata[2]; //頂點就設(shè)置和書上V1等等一樣吧 ArcNode*firstarc;}VNode,AdjList[MAX_VERTEX_NUM];typedefstruct{ AdjListvertices; intvexnum,arcnum;}ALGraph;typedefstruct{intdata[MAX_VERTEX_NUM+10];intfront;intrear;}queue;intvisited[MAX_VERTEX_NUM];queueq;intmain(){ ALGraphG; intCreateUDG(ALGraph&G); intDeleteUDG(ALGraph&G); intInsertUDG(ALGraph&G); voidBFSTraverse(ALGraphG,int(*Visit)(ALGraphG,ArcNodev)); intPrintElement(ALGraphG,ArcNodev); voidmenu(); voiddepthfirstsearch(ALGraph*g,intvi); voidtravel(ALGraph*g); voidbreadfirstsearch(ALGraph*g); inti; G.arcnum=G.vexnum=0; while(1) { menu(); do { printf("請輸入要進(jìn)行的操作\n"); scanf("%d",&i); if(i<1||i>6) printf("錯誤數(shù)字，請重新輸入\n"); }while(i<1||i>6); switch(i) { case1:CreateUDG(G);system("pause");system("cls");break; case2:DeleteUDG(G);system("pause");system("cls");break; case3:InsertUDG(G);system("pause");system("cls");break; case4:travel(&G);system("pause");system("cls");break; case5:breadfirstsearch(&G);system("pause");system("cls");break; case6:exit(0);break; } } return1;}voidenterqueue(intv){q.data[q.rear]=v;q.rear++;}intdeletequeue(){intt;t=q.data[q.front];q.front++;return(t);}intempty(){if(q.front==q.rear)return1;return0;}intLocateVex(ALGraphG,charnode[2]){ inti; for(i=0;i<G.vexnum;i++) { if(strcmp(G.vertices[i].data,node)==0) returni; } return-1;}intCreateUDG(ALGraph&G){ intLocateVex(ALGraphG,charnode[2]); voidPrintUDG(ALGraphG); inti,j,k; charnode1[2],node2[2]; ArcNode*p,*q; printf("請輸入頂點數(shù)和弧數(shù)\n"); printf("例如:5,6\n"); scanf("%d,%d",&G.vexnum,&G.arcnum); printf("請輸入各頂點\n"); for(i=0;i<G.vexnum;i++) { printf("第%d個\n",i+1); scanf("%s",&G.vertices[i]); G.vertices[i].firstarc=NULL; } //這里開始構(gòu)造邊 printf("請輸入邊的信息\n"); printf("例如:v1v2\n"); for(i=0;i<G.arcnum;i++) { printf("第%d條邊\n",i+1); scanf("%s%s",&node1,&node2); j=LocateVex(G,node1); k=LocateVex(G,node2); p=(ArcNode*)malloc(sizeof(ArcNode)); q=(ArcNode*)malloc(sizeof(ArcNode)); p->adjvex=k; q->adjvex=j; p->nextarc=G.vertices[j].firstarc; G.vertices[j].firstarc=p; q->nextarc=G.vertices[k].firstarc; G.vertices[k].firstarc=q;intv,t,i;ArcNode*rear; for(i=0;i<g->vexnum;i++) visited[i]=0;for(v=0;v<g->vexnum;v++){if(!visited[v]){printf("%s",g->vertices[v].data);visited[v]=1;enterqueue(v);}while(!empty()){t=deletequeue();rear=g->vertices[t].firstarc;while((rear!=NULL)&&(!visited[rear->adjvex])){printf("%s\t",g->vertices[rear->adjvex].data);visited[rear->adjvex]=1;enterqueue(rear->adjvex);rear=rear->nextarc;}}}}voidmenu(){printf("*********************************************\n"); printf("*作者：Dick*\n"); printf("*信計1001xxxxxxxxxx*\n");printf("*********************MENU********************\n");printf("1建立無向圖\n");printf("2刪除圖中節(jié)點\n");printf("3插入節(jié)點\n"); printf("4深度優(yōu)先遍歷圖\n"); printf("5廣度優(yōu)先遍歷圖\n"); printf("6退出程序\n");}voidPrintUDG(ALGraphG){ inti; ArcNode*p; for(i=0;i<G.vexnum;i++) { if(G.vertices[i].firstarc!=NULL) { printf("與節(jié)點%s相鄰的節(jié)點為:\n",G.vertices[i].data); p=G.vertices[i].firstarc; while(p!=NULL) { printf("%s\t",G.vertices[p->adjvex].data); p=p-