-------------精选文档-----------------可编辑1.实验目的通过上机实验进一步掌握图的存储结构及基本操作的实现。2.实验内容与要求要求：⑴能根据输入的顶点、边/弧的信息建立图；⑵实现图中顶点、边/弧的插入、删除；⑶实现对该图的深度优先遍历；⑷实现对该图的广度优先遍历。备注：单号基于邻接矩阵，双号基于邻接表存储结构实现上述操作。3.数据结构设计逻辑结构：图状结构存储结构：顺序存储结构、链式存储结构4.算法设计#include#include#include#defineMAX_VERTEX_NUM20typedefstructArcNode{intadjvex;structArcNode*nextarc;}ArcNode;typedefstructVNode{chardata[2];//顶点就设置和书上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("请输入要进行的操作\n");scanf("%d",&i);if(i<1||i>6)printf("错误数字，请重新输入\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;iadjvex=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;}-------------精选文档-----------------可编辑PrintUDG(G);return1;}intDeleteUDG(ALGraph&G){inti,j;ArcNode*p,*q;charnode[2];intLocateVex(ALGraphG,charnode[2]);voidPrintUDG(ALGraphG);if(G.arcnum==0){printf("请先生成图\n");return0;}printf("请输入要删除的节点\n");scanf("%s",&node);i=LocateVex(G,node);if(i==-1){printf("无此节点\n");return0;}else{G.vexnum--;if((p=q=G.vertices[i].firstarc)!=NULL){G.arcnum--;p=p->nextarc;G.vertices[i].firstarc=p;free(q);q=p;while(p!=NULL){G.arcnum--;p=p->nextarc;G.vertices[i].firstarc=p;free(q);q=p;-------------精选文档-----------------可编辑}}for(j=0;j=i){strcpy(G.vertice...
