图的建立和深度遍历与广度遍历.docx

图的创建，图的深度遍历和图的广度遍历#include iostream.h#include malloc.h#define Max 20int visited[Max];typedef struct {int adj;}ArcCell,AdjMatrix[Max][Max];typedef struct { int arcnum,vexnum;int vexs[Max]; int arc[Max][Max];}MGraph;typedef struct QNode{int data;struct QNode *next;}QNode,*QueuePtr;typedef struct{QueuePtr front;QueuePtr rear;}LinkQueue;void InitQueue(LinkQueue Q){Q.front=Q.rear=(QueuePtr)malloc(sizeof(QNode));if(!Q.front)return;Q.front-next=0;}void Enqueue(LinkQueue Q,int e){QueuePtr p;p=(QueuePtr)malloc(sizeof(QNode));if(!p)return ;p-data=e;p-next=0;Q.rear-next=p;Q.rear=p;}void Dequeue(LinkQueue Q,int e){if(Q.rear==Q.front)return;QueuePtr p;p=Q.front-next;e=p-data;Q.front-next=p-next;if(Q.rear==p)Q.rear=Q.front;free(p);}int Queueempty(LinkQueue Q){if(Q.front=Q.rear)return 1;else return 0;}int Locate(MGraph G,int u){int m;//cout***;for(int i=0;iG.vexnum;i++){if(G.vexs[i]==u){m=i;break;}}if(iG.vexnum)return m;else return -1;}void CreateUDN(MGraph G){int a,b;int v1,v2;cout输入顶点数与边数：endl;cinG.vexnumG.arcnum;cout输入顶点：endl;for(int i=0;iG.vexnum;i++)cinG.vexs[i];for(int l=0;lG.vexnum;l++){for(int j=0;jG.vexnum;j++)G.arc[l][j]=0;}cout输入边：endl;for(int k=0;kG.arcnum;k++){cinv1;cinv2;//cout***; a=Locate(G,v1); b=Locate(G,v2);G.arc[a][b]=1; G.arc[b][a]=G.arc[a][b];}}void Show(int e){coute ;}int FirstAdjVex(MGraph G,int v){int n;for(int i=0;iG.vexnum;i++){if(G.arc[v][i]!=0){n=i; break;}}if(iG.vexnum)return n;else return -1;}int NextAdjVex(MGraph G,int v,int w){int n;for(int i=w+1;iG.vexnum;i++){if(G.arc[v][i]!=0){n=i; break;}}if(iG.vexnum)return n;else return -1;}void DFS(MGraph G,int v){visited[v]=1;Show(G.vexs[v]);for(int w=FirstAdjVex(G,v);w=0;w=NextAdjVex(G,v,w)){if(!visited[w])DFS(G,w);}}void BFS(MGraph G){LinkQueue Q;for(int i=0;iG.vexnum;i++)visited[i]=0;InitQueue(Q);for(int v=0;vG.vexnum;v++){if(!visited[v]){visited[v]=1;Show(G.vexs[v]);Enqueue(Q,v);while(!Queueempty(Q)){int u;Dequeue(Q,u);for(int w=FirstAdjVex(G,u);w=0;w=NextAdjVex(G,u,w)){if(!visited[w]){visited[w]=1;S