无向图的深度优先遍历

《无向图的深度优先遍历》由会员上传分享，免费在线阅读，更多相关内容在行业资料-天天文库。

1、/*#include#include#defineMAX_VERTEX_NUM20typedefintInfoType;typedefintVertexType;typedefstructArcNode{intadjvex;structArcNode*nextarc;InfoType*info;}ArcNode;typedefstructVNode{VertexTypedata;ArcNode*firstarc;}VNode,AdjList[MAX_VERTEX_NUM];typedefstruct{AdjListvertices

2、;intvexnum,arcnum;intkind;}ALGraph;intvisited[20];voidCreateDG(ALGraph&G){intk,i;cout<<"请输入结点的个数"<>G.vexnum;cout<<"请输入边的个数："<>G.arcnum;for(i=1;i<=G.vexnum;i++){G.vertices[i].data=i;G.vertices[i].firstarc=NULL;}for(k=1;k<=G.vexnum;k++){intv1,v2;cout<<"请输入与结点"<

3、";cin>>v2;cout<<"请输入与第"<>v1;ArcNode*p;p=(ArcNode*)malloc(sizeof(ArcNode));if(!p)exit(-2);p->adjvex=v1;p->nextarc=NULL;G.vertices[k].firstarc=p;for(i=1;i>m;ArcNode*q;q=(ArcNode*)malloc(sizeof(ArcNode));if(!p)exit(-2);q-

4、>adjvex=m;q->nextarc=NULL;p->nextarc=q;p=q;}}}voidDFS(ALGraphG,intv){visited[v]=1;cout<nextarc){w=x->adjvex;if(visited[w]==0)DFS(G,w);}}voidmain(){ALGraphG;CreateD

5、G(G);//charch;inti;cout<<"请输入开始遍历的顶点:";//cin>>ch;cin>>i;DFS(G,i);//DFStraversal(G,ch);//BFStraversal(G,ch);}*/