分別采用鄰接矩陣鄰接表存儲結(jié)構(gòu)實現(xiàn)圖的遍歷

1、#define INFINITY 0#define INF32767#define MAX_NUM 20#define MAXV 100#include<stdio.h>typedef char VRType;typedef enumDG=1,DN,UDG,UDNGraphKind;typedef struct ArcCell VRType adj;ArcCell *info;AdjMatrixMAX_NUMMAX_NUM;typedef struct VRType vexsMAX_NUM;AdjMatrix arcs;int vexnum,arcnum;GraphKind kin

2、d;MGraph;void PRIN(MGraph &G);int LocateVex(MGraph &G,VRType v1);int FirstAdjVex(MGraph &G,int v);int NextAdjVex(MGraph &G,int v,int w);void CreateUDN(MGraph &G)int i,j,k,w; VRType v1,v2; G.kind =UDN; printf("構(gòu)造無向網(wǎng)n");printf("G.vexnum:"); scanf("%d",

3、&G.vexnum );printf("G.arcnum:"); scanf("%d",&G.arcnum );getchar();for(i=0;i<G.vexnum ;i+)printf("G.vexs%d:",i);sscanf("%c",&G.vexs i);getchar();for(i=0;i<G.vexnum ;+i)for(j=0;j<G.vexnum ;+j)G.arcs ij.adj =INFINITY;G.arcs =NULL; for

4、(k=0;k<G.vexnum ;+k) printf("v1(char):"); scanf("%c",&v1);getchar();printf("v2(char):"); scanf("%c",&v2);getchar();printf("w(int):"); scanf("%d",&w);getchar();i=LocateVex(G,v1); j=LocateVex(G,v2); G.arcs ij.adj=w; G.arcs ji.a

5、dj=G.arcs ij.adj; int LocateVex(MGraph &G,VRType v1)int i;for(i=0;i<G.vexnum ;i+) if(v1=G.vexs i)return i;return -i;void CreateDN(MGraph &G)int i,j,k,w; VRType v1,v2;G.kind =DN;printf("構(gòu)造有向網(wǎng)n");printf("G.vexnum:"); scanf("%d",&G.vexnum );printf("G.ar

6、cnum:"); scanf("%d",&G.arcnum );getchar();for(i=0;i<G.vexnum ;i+)printf("G.vexs%d:",i);scanf("%c",&G.vexs i);getchar();for(i=0;i<G.vexnum ;+i)for(j=0;j<G.vexnum ;+j)G.arcs ij.adj =INFINITY;G.arcs =NULL; for(k=0;k<G.vexnum ;+k) printf(&qu

7、ot;v1(char):"); scanf("%c",&v1);getchar();printf("v2(char):"); scanf("%c",&v2);getchar();printf("w(int):"); scanf("%d",&w);getchar();i=LocateVex(G,v1); j=LocateVex(G,v2); G.arcs ij.adj=w; void CreateDG(MGraph &G)int i,j,k; VRType

8、 v1,v2;G.kind=DG;printf("構(gòu)造有向網(wǎng)n");printf("G.vexnum:"); scanf("%d",&G.vexnum );printf("G.arcnum:"); scanf("%d",&G.arcnum );getchar();for(i=0;i<G.vexnum ;i+)printf("G.vexs%d:",i); scanf("%c"),&G.vexs i; getchar();for(

9、i=0;i<G.vexnum ;+i)for(j=0;j<G.vexnum ;+j)G.arcs ij.adj =INFINITY;G.arcs =NULL;for(k=0;k<G.arcnum ;+k)printf("v1(char):"); scanf("%c",&v1);getchar();printf("v2(char):"); scanf("%c",&v2);getchar();i=LocateVex(G,v1);j=LocateVex(G,v2);G.ar

10、csij.adj=1;void CreateUDG(MGraph&G)int i,j,k;VRType v1,v2;G.kind=UDG;printf("構(gòu)造無向圖n");printf("G.vexnum:");scanf("%d",&G.vexnum);printf("G.arcnum:");scanf("%d",&G.arcnum);getchar();for(i=0;i<G.vexnum;i+)printf("G.vexs%d:",i);s

11、canf("%c",&G.vexsi);getchar();for(i=0;i<G.vexnum;+i) for(j=0;i<G.vexnum;+j)G.arcsij.adj=INFINITY;G.=NULL; for(k=0;i<G.vexnum;+k)printf("v1(char:)");scanf("%c",&v1);getchar(); printf("v2(char:)");scanf("%c",&v2);getchar

12、(); i=LocateVex(G,v1);j=LocateVex(G,v2); G.arcsij.adj=1; G.arcsji.adj=G.arcsij.adj;void CreateGraph(MGraph &G)printf("1:有向圖 2:有向網(wǎng) 3:無向圖 4:無向網(wǎng)n"); scanf("%d",&G.kind); switch(G.kind) case DG:CreateDG(G);PRIN(G);break; case DN:CreateDN(G);PRIN(G);break; case UDG:CreateUDG(G

13、);PRIN(G);break; case UDN:CreateUDN(G);PRIN(G);break; default:printf("ERROR");break; bool visitedMAX_NUM;void DFS(MGraph &G,int v)int w;true;for (w=FirstAdjVex(G,v);w>=0;w=NextAdjVex(G,v,w)if(!visitedw)DFS(G,w);void DFSTraverse(MGraph &G,int v)int i;for(i=0;i<G.vexnum;+i)visi

14、tedi=false;for(i=0;i<G.vexnum;+i)DFS(G,v);int FirstAdjVex(MGraph&G,int v)int i,w; for(i=0;i<G.vexnum;+i)if(G.arcsvi.adj!=0)w=i;break;return w;void PRIN(MGraph&G)int i,j;for(i=0;i<G.vexnum;+i) for(j=0;i<G.vexnum;+j) printf("%5d",G.arcsii.adj);printf("n");void B

15、FSTraverse(MGraph &G,int v)int queueMAX_NUM,front=0,rear=0;int i,w,u;for(i=0;i<G.vexnum;+i)visitedi=false;for(i=0;i<G.vexnum;+i) if(!visitedi)visitedi=true;printf("%4c",G.vexsv);rear=(rear+1)%MAX_NUM;queuerear=i;while(front!=rear)front=(front+1)%MAX_NUM;u=queuefront;for (w=FirstAdjVex(G,u);w>=0;w=NextAdjVex(G,u,w)if(!visitedw)visitedw=true;printf("%4c",G.vexsw);rear=