数据结构判断无向图是否连通..docVIP

数据结构实验题目：实现教材 P215例8.3的完整算法（判断无向图是否联通） 源码： #include malloc.h #include stdio.h #include iostream.h #define MAXV 6 #define InfoType int #define Vertex int typedef struct { int no; InfoType info; } VertexType; typedef struct { int edge[MAXV][MAXV]; int n,e; VertexType vexs[MAXV]; }MGraph; typedef struct ANode { int adjvex; struct ANode *nextarc; InfoType info; }ArcNode; typedef struct VNode { Vertex data; ANode *firstarc; }VNode; typedef VNode AdjList[MAXV]; typedef struct { AdjList adjlist; int n,e; }ALGraph; int visited[MAXV]={0,0,0,0,0,0}; void ListToMat(MGraph g,ALGraph * G){ int i,j; ArcNode *p; for(i=0;iG-n;i++){ for(j=0;jG-n;j++){ g.edge[i][j]=0; } } for(i=0;ig.n;i++){ p=G-adjlist[i].firstarc; while(p!=NULL){ g.edge[i][p-adjvex]=1; p=p-nextarc; } } g.n=G-n;g.e=G-e;} void BFS(ALGraph *G,int v) { ArcNode *p; int i,j; visited[v]=1; printf(%d,v); p=G-adjlist[v].firstarc; while(p!=NULL) { printf(%d,p-adjvex); if(visited[p-adjvex]!=1) { BFS(G,p-adjvex); } p=p-nextarc; } } void BFSbook(ALGraph *G,int v){ ArcNode *p; int queue[MAXV],front=0,rear=0; int w ,i; printf(%2d,v); visited[v]=1; rear=(rear+1)%MAXV; queue[rear]=v; while(front!=rear) { front=(front+1)%MAXV; w=queue[front]; p=G-adjlist[w].firstarc; while(p!=NULL) { if(visited[p-adjvex]==0) { printf(%2d,p-adjvex); visited[p-adjvex]=1; rear=(rear+1)%MAXV; queue[rear]=p-adjvex; } p=p-nextarc; } } printf(\n); } void DFS(ALGraph *G,int v){ coutDFS\nendl; ArcNode *p; p=(ArcNode *)malloc(sizeof(ArcNode)); p=G-adjlist[v].firstarc; visited[v]=1; printf(=%d= \n,v); while(p!=NULL) { printf(||%d|| \n,p-adjvex); if(visited[p-adjvex]==0) DFS(G,p-adjvex); p=p-nextarc; } } bool connect(ALGraph * G) { int i; bool flag=true; for(i=0;iG-n;i++){ visited[i]=0; } BFSbook(G,3); coutDispVisitedendl; for(i=0;iG-n;i++) coutvisited[i]endl; for(i=0;iG-n;i++){ coutG