图的遍历

#define INFINITY 10000 /*无穷大*/#define MAX_VERTEX_NUM 40#define MAX 40#include<stdlib.h>#include<stdio.h>#include<conio.h>#include<string.h>typedef struct ArCell{int adj;}ArCell,AdjMatrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM]; typedef struct{char name[20];}infotype;typedef struct{infotype vexs[MAX_VERTEX_NUM];AdjMatrix arcs;int vexnum,arcnum;}MGraph;int LocateVex(MGraph *G,char* v){ int c=-1,i;for(i=0;i<G->vexnum;i++)if(strcmp(v,G->vexs[i].name)==0){c=i;break;}return c;}MGraph * CreatUDN(MGraph *G)//初始化图，接受用户输入{int i,j,k,w;char v1[20],v2[20];printf("请输入图的顶点数,弧数:");scanf("%d%d",&G->vexnum,&G->arcnum);printf("结点名字:\n");for(i=0;i<G->vexnum;i++){printf("No.%d:",i+1);scanf("%s",G->vexs[i].name);}for(i=0;i<G->vexnum;i++)for(j=0;j<G->vexnum;j++)G->arcs[i][j].adj=INFINITY;printf("请输入一条边依附的两个顶点和权值:\n");for(k=0;k<G->arcnum;k++){printf("第%d条边:\n",k+1);printf("起始结点:");scanf("%s",v1);printf("结束结点:");scanf("%s",v2);printf("边的权值:");scanf("%d",&w);i=LocateVex(G,v1);j=LocateVex(G,v2);if(i>=0&&j>=0){G->arcs[i][j].adj=w;G->arcs[j][i]=G->arcs[i][j];}}return G;}int FirstAdjVex(MGraph *G,int v){int i;if(v<=0 &&v<G->vexnum){ //v合理for(i=0;i<G->vexnum;i++)if(G->arcs[v][i].adj!=INFINITY)return i;}return -1;}void VisitFunc(MGraph *G,int v){printf("%s ",G->vexs[v].name);}int NextAdjVex(MGraph *G,int v,int w){int k;if(v>=0 && v<G->vexnum && w>=0 && w<G->vexnum)//v,w合理{for( k=w+1;k<G->vexnum;k++)if(G->arcs[v][k].adj!=INFINITY)return k;}return -1;}int visited[MAX];void DFS(MGraph *G,int v)//从第v个顶点出发递归地深度优先遍历图Gint w;visited[v]=1;VisitFunc(G,v);//访问第v个结点for(w=FirstAdjVex(G,v);w>=0;w=NextAdjVex(G,v,w)) if(!visited[w]){DFS(G,w);printf("%d ",G->arcs[v][w].adj);}}void DFSTraverse(MGraph *G,char *s)//深度优先遍历{int v,k;for(v=0;v<G->vexnum;v++)visited[v]=0;k=LocateVex(G,s);if(k>=0&&k<G->vexnum){for(v=k;v>=0;v--){if(!visited[v])DFS(G,v);}for(v=k+1;v<G->vexnum;v++)if(!visited[v])DFS(G,v);}}typedef struct Qnode{int vexnum;struct Qnode *next;}QNode,*QueuePtr;typedef struct{QueuePtr front;QueuePtr rear;}LinkQueue;int InitQueue(LinkQueue *Q){Q->front=Q->rear=(QueuePtr)malloc(sizeof(QNode)); if(!Q->front)exit(0);Q->front->next=NULL;return 1;}void EnQueue(LinkQueue *Q,int a )QueuePtr p;p=(QueuePtr)malloc(sizeof(QNode));if(!p)exit(0);p->vexnum=a;p->next=NULL;Q->rear->next=p;Q->rear=p;}int DeQueue(LinkQueue *Q,int *v){ QueuePtr p;if(Q->front==Q->rear){printf("结点不存在!\n");exit(0);}p=Q->front->next;*v=p->vexnum;Q->front->next=p->next;if(Q->rear==p)Q->front=Q->rear;return *v;}int QueueEmpty(LinkQueue *Q){if(Q->rear==Q->front)return 0;return 1;}int Visited[MAX];void BFSTraverse(MGraph *G,char *str)//广度优先遍历{int w,u,v,k;LinkQueue Q,q;for(v=0;v<G->vexnum;v++) Visited[v]=0;InitQueue(&Q);InitQueue(&q);k=LocateVex(G,str);for(v=k;v>=0;v--)if(!Visited[v]){Visited[v]=1;VisitFunc(G,v);EnQueue(&Q,v);//v入队while(!QueueEmpty(&Q)){DeQueue(&Q,&u);//出队for(w=FirstAdjVex(G,u);w>=0;w=NextAdjVex(G,u,w))if(!Visited[w]){Visited[w]=1;VisitFunc(G,v);EnQueue(&Q,w);}}}for(v=k+1;v<G->vexnum;v++)if(!Visited[v]){Visited[v]=1;VisitFunc(G,v);EnQueue(&Q,v);//v入队while(!QueueEmpty(&Q)){DeQueue(&Q,&u);//出队for(w=FirstAdjVex(G,u);w>=0;w=NextAdjVex(G,u,w))if(!Visited[w]){Visited[w]=1;VisitFunc(G,v);EnQueue(&Q,w);}}}}void main(){MGraph *G,b;char v[10];G=CreatUDN(&b);printf("请输入起始结点名称:");scanf("%s",v);printf("\n深度优先遍历:\n");DFSTraverse(G,v);printf("\n广度优先遍历:\n");BFSTraverse(G,v);getch();}/****************** queue.h ***********************/ /**//***************描述队列*******************************/#ifndef QUEUE_H#define QUEUE_H#include <stdio.h>#include <iostream>using namespace std ;typedef struct QNode...{int data ;struct QNode * next ;}QNode ;typedef struct Queue...{QNode * front ;QNode * rear ;}Queue ;void InitQueue(Queue & q)//初始化队列...{q.front = q.rear = new QNode ;q.front->next = q.rear->next = NULL ;}void DestroyQueue(Queue & q)//销毁队列...{while(q.front != NULL)...{q.rear = q.front->next ;delete q.front ;q.front = q.rear ;}}void EnQueue(Queue & q , int data)//队尾插入元素...{QNode * p = new QNode ;p->data = data ;p->next = NULL ;q.rear->next = p ;q.rear = p ;}void DeQueue(Queue & q) //队首删除元素...{if (q.rear == q.front) return ; //队列为空,返回QNode * p = q.front->next ;q.front->next = p->next ;if(p == q.rear)...{q.rear = q.front ;}delete p ;}int GetFront(Queue q) //返回队首元素...{return q.front->next->data ;}int QueueEmpty(Queue q) //如果队列为空,返回0 ; 否则返回1...{if(q.front->next == NULL)return 0 ;elsereturn 1 ;}#endif/**//************************main.cpp*******************************/#include "queue.h"#include <stdio.h>#include <iostream>using namespace std ;//建立存储边的结构typedef struct Edge...{int vertex1 ;int vertex2 ;struct Edge * next ;} Edge ;typedef struct Node...{int vertex ;struct Node * next ;}Node ;typedef Edge * ListEdge ;typedef Node * AdjList ;void CreateListEdge(ListEdge & LE ,int& N);//将边的信息用链表存储起来void CreateGraph(ListEdge LE , int N , int **&Graph);//根据边的信息，建立邻接矩阵void CreateAdjList(AdjList *& AL,int ** Graph,int N);//根据邻接矩阵，创建邻接表void DFS(int vertex,int N,AdjList * AL,int *& visit);//利用邻接表，深度优先遍历图,采用递归算法void BFS(int vertex,int n,AdjList * AL,int *& visit); //利用邻接表，广度优先遍历图int main()...{ListEdge LE = NULL;int ** Graph ;AdjList * AL = NULL ;int * visit ;int i = 0 ;int n = 0 ;CreateListEdge(LE,n);cout<<"邻接矩阵:"<<endl;CreateGraph(LE,n,Graph);cout<<"邻接表:"<<endl;CreateAdjList(AL,Graph,n);//对所有的节点开始先深遍历,并且打印出来cout<<"深度优先搜索: "<<endl ;visit = new int[n] ;for(i = 0 ; i < n ; i++)...{for(int j = 0 ; j < n ; j++)...{visit[j] = 0 ;}DFS(i , n , AL,visit);cout<<"end"<<endl ;}cout<<"广度优先搜索: "<<endl ;for(i = 0 ; i < n ; i++)...{for(int j = 0 ; j < n ; j++)...{visit[j] = 0 ;}BFS(i , n , AL,visit);}system("PAUSE");return 0 ;}void CreateListEdge(ListEdge & LE,int &N)//将边的信息用链表存储起来...{LE = new Edge ;ListEdge s ;ListEdge r = LE;N = 0 ;int i = 0 ;int j = 0 ;//处理输入while(cin>>i)...{if(i != 0)...{cin>>j ;int temp ;if(i >=j)...{temp = i ;}else...{temp = j ;}if(temp >= N)...{N = temp ;}s = new Edge ;s->vertex1 = i ;s->vertex2 = j ;s->next = NULL ;r->next = s ;r = s ;}else...{r->next = NULL ;break ;}}//输出链表的内容验证/**//*ListEdge l = LE->next ;putchar(' ');while(l != NULL){cout<<l->vertex1<<" "<<l->vertex2<<endl ;l = l ->next ;}*/}void CreateGraph(ListEdge LE , int N , int **&Graph)//根据边的信息，建立邻接矩阵...{int i = 0 ;int j = 0 ;//动态建立图Graph = new int *[N] ;for(i = 0 ; i < N ; i++)...{Graph = new int[N] ;}for(i = 0 ; i < N ; i++)...{for(j = 0 ; j < N ; j++)...{Graph[j] = 0 ;}}ListEdge l = LE->next ;while(l != NULL)...{Graph[l->vertex1-1][l->vertex2-1] = 1 ;Graph[l->vertex2-1][l->vertex1-1] = 1 ;l = l->next ;}//输出邻接矩阵的内容，对照图形进行验证printf(" ");for(i = 0 ; i < N ; i++)...{printf("%3d",i+1);}putchar(' ');for(i = 0 ; i < N ; i++)...{printf("%4d ",i+1);for(j = 0 ; j < N ; j++)...{printf("%3d",Graph[j]);//cout<<" "<<Graph[j]<<" ";}putchar(' ');}}void CreateAdjList(AdjList * &AL,int ** Graph,int N)//根据邻接矩阵，创建邻接表...{AL = new AdjList[N];int i = 0 ;int j = 0 ;for(i = 0 ; i < N ; i++)//初始化...{AL = new Node ;AL->next = NULL ;}for(i = 0 ; i < N ; i++)...{for(j = 0 ; j < N ; j++)...{if(Graph[j] != 0)//如果端点相连,建立邻接表...{AdjList p = new Node ;p->vertex = j ;p->next = AL->next ;AL->next = p ;}}}//打印邻接表for(i = 0 ; i < N ; i++)...{AdjList p = AL->next ;cout<<"节点"<<i+1<<": ";while(p != NULL)...{cout<<p->vertex + 1<<" ";p = p->next ;}putchar(' ');}}void DFS(int vertex,int N,AdjList * AL,int *& visit)//利用邻接表，深度优先遍历图...{visit[vertex] = 1 ;cout<<vertex + 1<<"-->";Node * p = AL[vertex]->next ;while(p != NULL)...{if(visit[p->vertex] == 0) //还没有被访问...{DFS(p->vertex,N,AL,visit);}p = p ->next ;}}void BFS(int vertex,int n,AdjList * AL,int *& visit)//利用邻接表，广度优先遍历图...{int temp = 0 ;Queue q ;InitQueue(q);EnQueue(q,vertex + 1);//存入选择的顶点标号visit[vertex] = 1 ;//设置已经访问while(QueueEmpty(q) != 0) //队列为空,先广搜索完毕...{temp = GetFront(q); //取出队列首节点cout<<temp<<"-->"; //打印DeQueue(q);//从队列首部删除AdjList p = AL[temp - 1]->next ;while(p != NULL)//把队首节点的邻接点(没有访问的)进队,并设置已经访问...{if(0 == visit[p->vertex])...{EnQueue(q,p->vertex + 1) ;visit[p->vertex] = 1 ;}p = p->next ;}}cout<<"end"<<endl ;DestroyQueue(q);}、#include <iostream>using namespace std;#define MAXNODE 64 // 图中顶点的最大个数typedef char vertype;struct ArcNode // 弧（边）结点：{int adjvex; // 邻接点在顶点向量中的下标ArcNode *next; // 指向下一邻接点的指针};struct VerNode // 顶点结点：{vertype vertex; // 顶点信息ArcNode *firstarc; // 指向第一个邻接点的指针};struct AlGraph// 邻接表：{VerNode vertices[MAXNODE];int vernum; //顶点的数目int arcnum; // 边的数目};struct Queue//队列{int elem;Queue *next;};void QueueInit(Queue &Q){Q.next=NULL;}void QueueIn(Queue &Q,int &v){Queue *p=&Q;while(p->next){p=p->next;}Queue *temp=new Queue;temp->elem=v;temp->next=p->next;p->next=temp;}bool QueueEmpty(Queue &Q){if(Q.next)return true;elsereturn false;}void QueueOut(Queue &Q,int &v){Queue *temp;temp=Q.next;v=temp->elem;Q.next=temp->next;delete temp;}int GraphLocateVertex(AlGraph &G,int v){return v-1;}void CreateAdjList(AlGraph &G)//此图为有向图{int n;cout<<"请输入顶点数目"<<endl;cin>>n;G.vernum=n;//顶点初始化为nG.arcnum=0;//边数初始化为0cout<<"请输入各个顶点的数据"<<endl;for(int i=0;i<n;i++){cin>>G.vertices[i].vertex;//输入顶点信息G.vertices[i].firstarc=NULL;}cout<<"请输入有联系的两顶点:输入方式如：第一个点和第二个点输入成：1 2"<<endl; int v1,v2;cin>>v1>>v2;int i,j;ArcNode *p=NULL;while(v1&&v2)//两顶点同时为0时结束{i=GraphLocateVertex(G,v1);j=GraphLocateVertex(G,v2);p=new ArcNode();p->adjvex=j;p->next=G.vertices[i].firstarc;G.vertices[i].firstarc=p;G.arcnum++;//边数加1cin>>v1>>v2;}}int visited[MAXNODE];//访问标志数组void visit(AlGraph &G,int v){cout<<G.vertices[v].vertex<<" ";}//以下为深度优先遍历DFSint GraphFirstAdj(AlGraph &G,int v){if(G.vertices[v].firstarc)return G.vertices[v].firstarc->adjvex;return -1;}int GraphNextAdj(AlGraph &G,int v,int w){ArcNode *p=G.vertices[v].firstarc;while(p->adjvex!=w){p=p->next;}p=p->next;if(p)return p->adjvex;elsereturn -1;}void DFS(AlGraph &G,int v){//从第v个顶点出发递归地深度优先遍历图Gvisited[v]=1; visit(G,v);//访问v顶点并将该顶点设为已访问for(int w=GraphFirstAdj(G,v);w!=-1;w=GraphNextAdj(G,v,w))//-1退出{if(!visited[w])DFS(G,w);//对v的上文访问的邻接顶点w递归调用}}void DFSTraverse(AlGraph &G){for(int v=0;v<G.vernum;v++)//访问数组初始化visited[v]=0;for(int v=0;v<G.vernum;v++){if(!visited[v])DFS(G,v);//对未访问的顶点调用DFS}//以下为广度优先遍历BFSvoid BFSTraverse(AlGraph &G){//广度优先遍历for(int v=0;v<G.vernum;v++)visited[v]=0;Queue Q;QueueInit(Q);//辅助队列Qfor(int v=0;v<G.vernum;v++)if(!visited[v]){QueueIn(Q,v);visited[v]=1;visit(G,v);int u;while(!QueueEmpty(Q)){QueueOut(Q,u);//对头元素出队列并置为ufor(int w=GraphFirstAdj(G,u);w!=-1;w=GraphNextAdj(G,u,w)) {if(!visited[w]){QueueIn(Q,w);//u的尚未访问的邻接顶点w入队列Qvisited[w]=1;visit(G,w);}}}}}int main(){AlGraph G;CreateAdjList(G);DFSTraverse(G);cout<<endl;BFSTraverse(G);cout<<endl;cout<<G.vernum<<" "<<G.arcnum<<endl;cout<<endl;return 0;#include<stdio.h>#include<stdlib.h>#include<limits.h>#define MaxVertexNum 100#define True 1#define False 0#define OVERFLOW -1#define OK 1#define ERROR 0typedef int Status;typedef int boolean;typedef char VertexType;typedef int EdgeType;//邻接矩阵的定义typedef struct MGraphNode{VertexType vexs[MaxVertexNum];EdgeType edges[MaxVertexNum][MaxVertexNum];int n,e;}*MGraph;//用邻接矩阵构造带权值有向图void CreateMGraph(MGraph &G){int i,j,k,w;char ch;G=(MGraph)malloc(sizeof(MGraphNode));printf("输入顶点数和边数，以空格隔开\n");scanf("%d%d",&(G->n),&(G->e));printf("请输入顶点信息，以空格分开:\n");i=0;while(i<G->n){ch=getchar();if(ch!=' '&&ch!='\n')G->vexs[i++]=ch;}printf("%c \n",G->vexs[0]);for(i=0;i<G->n;i++)for(j=0;j<G->n;j++)G->edges[i][j]=INT_MAX;printf("请输入弧的信息，格式为：弧尾弧头权值：\n"); for(k=0;k<G->e;k++){scanf("%d%d%d",&i,&j,&w);G->edges[i][j]=w;}}//邻接矩阵图的深度优先遍历boolean visited[MaxVertexNum];int FirstAdjVex(MGraph G,int v){int w;for(w=0;w<G->n;w++)if(G->edges[v][w]!=INT_MAX)return w;return -1;}int NextAdjVex(MGraph G,int v,int w){int w2;for(w2=w+1;w2<G->n;w2++)if(G->edges[v][w2]!=INT_MAX)return w2;return -1;}void DFSMG(MGraph G,int v){visited[v]=True;int w;printf("%c ",G->vexs[v]);for(w=FirstAdjVex(G,v);w>0;w=NextAdjVex(G,v,w)) if(!visited[w])DFSMG(G,w);}void DFSTraverseMG(MGraph G){printf("图的深度优先遍历：");int i;for(i=0;i<G->n;i++)visited[i]=False;for(i=0;i<G->n;i++)if(!visited[i])DFSMG(G,i);putchar('\n');}//邻接矩阵图的广度优先遍历，要借助于队列//首先定义和创建队列typedef struct SqQueue{int *base;int head,tail;}SqQueue;//构建队列Status InitQueue(SqQueue &Q){Q.base=(int*)malloc(sizeof(int)*MaxVertexNum); if(!Q.base)return OVERFLOW;Q.head=Q.tail=0;return OK;}//判断队列是否为空boolean QueueEmpty(SqQueue Q){return Q.tail==Q.head;}//入队操作Status EnQueue(SqQueue &Q,int e){if(Q.tail==Q.head)return ERROR;//队列满不能入Q.base[Q.tail]=e;Q.tail=(Q.tail+1)%MaxVertexNum;return OK;}//出队操作Status DeQueue(SqQueue &Q,int &e){if(QueueEmpty(Q))return ERROR;//队空不能出队e=Q.base[Q.head];Q.head=(Q.head+1)%MaxVertexNum;return OK;}//BFSMG()函数供BFSTraverseMG()函数调用void BFSMG(MGraph G,int v){int i,j;SqQueue Q;InitQueue(Q);visited[v]=True;printf("%c ",G->vexs[v]);EnQueue(Q,v);while(!QueueEmpty(Q)){DeQueue(Q,i);for(j=0;j<G->n;j++)if(G->edges[i][j]!=INT_MAX&&!visited[j]){ printf("%c ",G->vexs[j]);visited[j]=True;EnQueue(Q,j);}}}void BFSTraverseMG(MGraph G){printf("图的广度优先遍历：");int i;for(i=0;i<G->n;i++)visited[i]=False;for(i=0;i<G->n;i++)if(!visited[i])BFSMG(G,i); putchar('\n');}//主函数int main(){MGraph MG;CreateMGraph(MG);DFSTraverseMG(MG);BFSTraverseMG(MG);system("pause");return 0;}。