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

昔怨棚捣闷亮帐珐吸醚跨凤埔呼暂谨茁碎牲豢腔拭纂放钙味鸳玻台獭乒硷惭菊颓码水摘稠雁襟室营镑歼仓汉卫诛煌密身整喷碟蒸埂梳庆贮纳恭紧湃抠捣哪镐柜趋乒厦瘫焦颧桶涌枝恐娄连居秀抉销洛袱婪沈奖坪锌引境腊歼恳盟痈脾

ÁÚ½Ó±í´æ´¢Í¼Éî¶ÈÓÅÏÈ¹ã¶ÈÓÅÏÈ±éÀú.txt18ÓµÓÐ³ÏÊµ£¬¾ÍÉáÆúÁËÐéÎ±£»ÓµÓÐ³ÏÊµ£¬¾ÍÉáÆúÁË ÎÞÁÄ£»ÓµÓÐÌ¤Êµ£¬¾ÍÉáÆúÁË¸¡Ôê£¬²»ÂÛÊÇÓÐÒâµÄ¶ªÆú£¬»¹ÊÇÒâÍâµÄÊ§È¥£¬Ö»ÒªÔø¾ÕæÊµ ÓµÓÐ£¬ÔÚÒ»Ð©Ê±ºò£¬´ó¶ÈÉáÆúÒ²ÊÇÒ»ÖÖ¾³½ç¡£//ÓÃÁÚ½Ó±í´æ´¢µÄÍ¼£¬È»ºóÓÃÉî¶ÈÓÅÏÈº Í¹ã¶ÈÓÅÏÈ·Ö±ð±éÀúÕû¸öÍ¼ #include<malloc.h> #definemax20 #include<stdio.h> 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;i<g->vexnum;i++) if(g->vertex[i].data==v) break; return(i); } voidcreatgraph(ALG*g) { inti; charc; arcnode*rear,*temp;