数据结构C语言实现图的建立,图的广度,深度遍历

《数据结构C语言实现图的建立,图的广度,深度遍历》由会员上传分享，免费在线阅读，更多相关内容在行业资料-天天文库。

1、图的建立，图的广度，深度遍历#include"stdio.h"#definemaxsize1000#definen100typedefstruct{charvexs[n];intarcs[n][n];intnum;}G;typedefstruct{intdata[maxsize];intfront,rear;}V;voidGInit(G*L){L->num=0;}intGVexs(G*L){return(L->num);}voidGCreate(G*L){inti,j;GInit(L);print

2、f("请输入顶点数目：");scanf("%d",&L->num);printf("请输入各顶点：");for(i=0;inum;i++){fflush(stdin);scanf("%c",&L->vexs[i]);}printf("请输入各顶点边的关系（1是有关0是无关）：");for(i=0;inum;i++){for(j=0;jnum;j++){scanf("%d",&L->arcs[i][j]);}}}voidGOut(GL){inti,j;printf

3、("图的顶点数目为：%d",L.num);printf("图的各顶点的信息为：");for(i=0;i

4、%c",g.vexs[qidian]);for(v1=0;v1

5、dian;vfront=0;sq->rear=0;}intQueueIsEmpty(Vsq){if(sq.rear==sq.front)return(1);elsereturn(0);}intQueueFront(Vsq,int*e){if(QueueIsEmpty(sq)){printf("queueisempty!");

6、return0;}else{*e=sq.data[(sq.front)];return1;}}intQueueIn(V*sq,intx)//{if(sq->front==(sq->rear+1)%maxsize){printf("queueisfull!");return0;}else{sq->data[sq->rear]=x;sq->rear=(sq->rear+1)%maxsize;return(1);}}intQueueOut(V*sq){if(QueueIsEmpty(*sq)){pr

7、intf("queueisempty!");return0;}else{sq->front=(sq->front+1)%maxsize;return1;}}voidBFS(Gg,intv,intmark[]){intv1,v2;Vq;QueueInit(&q);QueueIn(&q,v);mark[v]=1;printf("%c",g.vexs[v]);while(QueueIsEmpty(q)==0){QueueFront(q,&v1);QueueOut(&q);for(v2=0;v2

8、num;v2++){if(g.arcs[v1][v2]!=0&&mark[v2]==0){QueueIn(&q,v2);mark[v2]=1;printf("%c",g.vexs[v2]);}}}}voidGBFS(Gg){intqidian,v,v1,mark[maxsize];printf("广度遍历：");printf("");scanf("%d",&qidian);for(v=0;v