邻接表存储图深度优先广度优先遍历

《邻接表存储图深度优先广度优先遍历》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。

1、ÁÚ½Ó±í´æ´¢Í¼Éî¶ÈÓÅÏȹã¶ÈÓÅÏȱéÀú.txt18ÓµÓгÏʵ£¬¾ÍÉáÆúÁËÐéα£»ÓµÓгÏʵ£¬¾ÍÉáÆúÁËÎÞÁÄ£»ÓµÓÐ̤ʵ£¬¾ÍÉáÆúÁ˸¡Ô꣬²»ÂÛÊÇÓÐÒâµÄ¶ªÆú£¬»¹ÊÇÒâÍâµÄʧȥ£¬Ö»ÒªÔø¾ÕæʵӵÓУ¬ÔÚһЩʱºò£¬´ó¶ÈÉáÆúÒ²ÊÇÒ»ÖÖ¾³½ç¡£//ÓÃÁÚ½Ó±í´æ´¢µÄͼ£¬È»ºóÓÃÉî¶ÈÓÅÏȺ͹ã¶ÈÓÅÏÈ·Ö±ð±éÀúÕû¸öͼ#include#definemax20#include

2、typedefstructarcnode{intnum;structarcnode*nextarc;}arcnode;typedefstructvexnode{chardata;arcnode*firstarc;}vexnode;typedefstruct{vexnodevertex[max];intvexnum;intarcnum;}ALG;typedefstruct{intdata[max+10];intfront;intrear;}queue;intvisited[max];queueq;intlocate(ALG*g,charv){inti;for(i=0;ivexnum;i+

3、+)if(g->vertex[i].data==v)break;return(i);}voidcreatgraph(ALG*g){inti;charc;arcnode*rear,*temp;printf("ÊäÈëͼµÄ¶¥µãÊýºÍ±ßÊý");scanf("%d%d",&g->vexnum,&g->arcnum);getchar();printf("ÊäÈëËùÓж¥µã");for(i=0;ivexnum;i++){scanf("%c",&(g->vertex[i].data));g->vertex[i].firstarc=NULL;}getchar();for(i

4、=0;ivexnum;i++){printf("ÊäÈëËùÓкÍ%cÏàÁ¬µÄ¶¥µã£¬ÒÔ*½áÊø",g->vertex[i].data);if((c=getchar())!='*'){rear=(arcnode*)malloc(sizeof(arcnode));g->vertex[i].firstarc=rear;rear->num=locate(g,c);while((c=getchar())!='*'){temp=(arcnode*)malloc(sizeof(arcnode));temp->num=locate(g,c);rear->nextarc=temp;r

5、ear=temp;}}rear->nextarc=NULL;getchar();}}voiddepthfirstsearch(ALG*g,intvi){arcnode*rear;putchar(g->vertex[vi].data);visited[vi]=1;rear=g->vertex[vi].firstarc;while((rear!=NULL)&&(!visited[rear->num])){depthfirstsearch(g,rear->num);rear=rear->nextarc;}}voidtravel(ALG*g){intv;for(v=0;vvexnum;v++)

6、if(!visited[v])depthfirstsearch(g,v);}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;}voidbreadfirstsearch(ALG*g){intv,t;arcnode*rear;for(v=0;vvexnum;v++){if(!visited[v]){putchar(g->vertex

7、[v].data);visited[v]=1;enterqueue(v);}while(!empty()){t=deletequeue();rear=g->vertex[t].firstarc;while((rear!=NULL)&&(!visited[rear->num])){putchar(g->vertex[rear->num].data);visited[rear->num]=1;ente