数据结构实验用邻接表实现图的遍历..docxVIP

数据结构实验报 告副标题：用邻接表实现图的遍历班级：信安1002班学号：0705100227姓名：叶鑫实验题目 编写一个程序algo8-2.cpp，实现实现图的遍历运算，并在此基础上设计一个主程序完成如下功能:输出如图所示的有向图G从顶点0开始的深度优先遍历序列（递归算法）；输出如图所示的有向图G从顶点0开始的深度优先遍历序列（非递归算法）；输出如图所示的有向图G从顶点0开始的广度优先遍历序列;实验目的 通过实验巩固图的遍历算法。实验过程#includestdio.h#includemalloc.h#includestring.h#includestdlib.h#define NULL0#define MAXV 100typedef struct ANode{ int adjvex; struct ANode *nextarc; int info;}ArcNode;typedef struct Vnode{int data; ArcNode *firstarc;}VNode;typedef VNode AdjList[MAXV];typedef struct{AdjList adjlist; int n,e;}ALGraph;int visited[100]={0};void Creat(ALGraph *G,FILE *outFile,FILE *fp)//创建邻接表{int i;char a ,b; ArcNode *p,*r; G=(ALGraph *)malloc(sizeof(ALGraph));printf(顶点个数:);fprintf(fp,顶点个数:);fscanf(outFile,%d,G-n);printf(%d\n,G-n);fprintf(fp,%d\n,G-n);for(i=0;iG-n;i++)G-adjlist[i].firstarc=NULL;for(i=0;iG-n;i++){ fscanf(outFile,\n);fscanf(outFile,%c,a);fscanf(outFile,:);printf(%c :,a);fprintf(fp,%c :,a);fscanf(outFile,%c,b);while(b!=\n){if(b==\0)fscanf(outFile,%c,b);else{if(G-adjlist[a-0].firstarc==NULL){ p=(ArcNode *)malloc(sizeof(ArcNode));p-adjvex=b;p-nextarc=G-adjlist[a-0].firstarc;G-adjlist[a-0].firstarc=p;r=G-adjlist[a-0].firstarc;printf(%c,G-adjlist[a-0].firstarc-adjvex);fprintf(fp,%c,G-adjlist[a-0].firstarc-adjvex);}else{p=(ArcNode *)malloc(sizeof(ArcNode)); p-adjvex=b;r-nextarc=p; printf(%c,r-nextarc-adjvex);fprintf(fp,%c,r-nextarc-adjvex);r=p;}r-nextarc=NULL;fscanf(outFile,%c,b);}}printf(\n);fprintf(fp,\n);}}void DFS(ALGraph *G,char v)//深度优先遍历递归处理{ArcNode *p; visited[v-0]=1;printf(%c ,v);p=G-adjlist[v-0].firstarc;while(p!=NULL){if(visited[p-adjvex-0]==0)DFS(G,p-adjvex);p=p-nextarc;}}void DFS1(ALGraph *G,char v)//深度优先遍历非递归处理{ArcNode *p;ArcNode *s[MAXV];int visited[MAXV]={0};char i;int top=0;printf( %c ,v);s[top++]=G-adjlist[v-0].firstarc;visited[v-0]=1;while(top!=0){p=s[--top];if(p!=NULL){s[top++]=p-nextarc;i=p-adjvex;if(visited[i-0]==0){visited[i-0]=1;printf( %c ,i);s[top++]=G-adjlist[i-0].firstarc;}}}}void BFS(ALGraph *G,char v)//广度优先遍历的非递归处理{ ArcNode *p; in