数据结构（C语言版）程海英-上机6.docVIP

上机 图的遍历 1.问题描述 2.数据结构设计 typedef struct{ char vexs[GRAPHMAX]; int edges [GRAPHMAX] [GRAPHMAX]; int n,e; }MGraph; typedef struct{ int front; int rear; int count; int data[QueueSize]; }cirQueue; 3.函数说明 的基本操作 void CreateMGraph(MGraph*G) //建立邻接矩阵 void DFSTraverse(MGraph *G) //实现深度优先搜索遍历 void BFSTraverse(MGraph *G) //实现广度优先搜索遍历 4.编码实现 #include stdio.h #define GRAPHMAX #define FALSE 0 #define TRUE 1 #define Error printf #define QueueSize 30 typedef struct{ char vexs[GRAPHMAX]; int edges [GRAPHMAX] [GRAPHMAX]; int n,e; }MGraph; typedef struct{ int front; int rear; int count; int data[QueueSize]; }cirQueue; int visited[10]; void CreateMGraph(MGraph*G) { //建立邻接矩阵 int i, j,k; char chl,ch2; printf(“\n\t\t请输入顶点数，边数并按回车(格式如:3,4):”); scanf (“%d,%d”, G- n，G-e); //输入顶点数、边数 for (i=0; iG- n; i++) { getchar(); printf(“\n\t\t请输入第% d个顶点并按回车:”,i+1); scanf (“% c”, G- vexs[i]); //输入顶点 } for (i=0; iG-n: i++) for (j=0; jG-n; j++) G-edges[i][j]=0; for (k=0; kG-e; k++) { getchar(); printf(“\n\t\t请输入第%d条边的顶点序号(格式如:i,j):”,k+1); scanf(“%c,% c”,ch1,ch2); //输入边 for(i=0;chl!=G- vexs [i] ; i++); for(j=0;ch2!=G- vexs [j];j++); G-edges[i] [j]=1; } } void DFSM (MGraph *G, int i) { //实现深度优先搜索遍历 int j; printf(“\n\t\t深度优先遍历序列:% c\n”,G-vexs [i] ); visited[i]=FALSE; for (j=0; jG-n;j++) if (G-edges[i][j]==1!visited[j]) DFSM (G, j); } void DFSTraverse(MGraph *G) { int i; for (i=0;iG-n;i++) visited[i]= FALSE; for(i=0;iG-n;i++) if(!visited[i]) DFSM(G, i ); } void BFSM(MGraph*G, int k) { //实现广度优先搜索遍历 int i, j; cirQueue Q; InitQueue(Q); printf(“\n1t\t广度优先迫历遍历序列:%c\n”,G-vexs[k]); visited[k]=TRUE; EnQueue(Q, k); while(!QueueEmpty(Q)) { i=DeQueue(Q); for (j=0; jG- n; j++) if (G-edges[i] [j]==1!visited[j]) { visited[j]=TRUE; EnQueue(Q,j); } } } void BFSTraverse(MGraph *G) { int i; for (i=0;iG-n;i++)