有关于图的遍历

最新推荐文章于 2022-12-04 12:02:41 发布

xiaoling_315

最新推荐文章于 2022-12-04 12:02:41 发布

阅读量419

点赞数

本文链接：https://blog.csdn.net/xiaoling_315/article/details/4186423

版权

#include "stdlib.h"
#include "stdio.h"
#include "malloc.h"
#define MAXSIZE 20
#define NULL 0
#define ERROR 0
#define OK 1
#define MAX_VERTEX_NUM 20
boolean visited[MAX_VERTEX_NUM];

typrdef struct ArcNode
{
int adjvex;
struct ArcNode *nextarc;

}
typedef struct VNode
{
char data ;
ArcNode * firststarc;
}VNode ,AdjList[MAX_VERTEX_NUM ];
typedef struct
{
AdjList vertice;
int vexnum,arcnum;
int kind;
}Graph;
typedef struct
{
int s[MAXSIZE];
int front;
int rear;
}SqQueue;
void initQueue(SqQueue *qu)
{
qu->rear=qu->front=0;
}
int EnQueue(SqQueue *qu,int e)
{
if((qu->rear+1)%MAXSIZE==qu->front)
    return ERROR;
else
{
    qu->s[qu->rear+1]=e;
    qu->rear=(qu->rear++)%MAXSIZE;
    return OK;
}
}
int DeQueue(SqQueue *qu,int *e)
{
   if(qu->rear==qu->front)
       return ERROR;
else
{
    *e=qu->s[qu->front];
       qu->front++;
        return OK;
}
}
int QueueEmpty(SqQueue qu)
{
if(qu.rear==qu.front)
    return OK;
else
return ERROR;
}

void DFS (AdjList ad, int v)
{
visited[v]=true;
printf("%c",ad[v].data);
/*for(int v=0;v<G.vexnum;++v)
visited[vertice[v]]=false;
for(w =FirstAdjVex(G, ad[v]);w ; w =NextAdjVex(G, ad[v], w))
if(!visited[w])
DFS(G，w); */
ArcNode *p=ad[v].firststarc;

while(p!=NULL)
{
if(visited[p->adjvex]==false)
DFS(ad,p->adjvex);
p=p->nextstarc;
}
}
void BFS(AdjList ad,int v)
{
int e;
ArcNode *p
initQueue(&q);
visited[v]=true;
printf("%c",ad[v].data);
EnQueue(&q,v);
while(!QueueEmpty(q))
{
DeQueue(&q,&e);

p=ad[e].firststarc;

while(p!=NULL)
{
if(visited[p->adjvex]==false)
{
visited[p->adjvex]=true;
printf("%c",ad[p->adjvex].data);
EnQueue(&q,p->adjvex);
}
p=p->nextstarc;

}
}

void trave_DFS(Graph g)
{
int i;
for(i=0;i<g.vexnum;i++)
visited[i]=false;
for(i=0;i<g.vexnum;i++)
if(visited[i]==false)
DFS(g.vertice,i);

}
void trave_BFS(Graph g)
{
int i;
for(i=0;i<g.vexnum;i++)
visited[i]=false;
for(i=0;i<g.vexnum;i++)
if(visited[i]==false)
BFS(g.vertice,i);

}

void CreateGraph(Graph *g)
{
ArcNode *q;

int i,j,k;
scanf("%d ,%d ,%d "&g->vexnum,&g->arcnum);
for(i=1;i<=g->vexnum;i++)
{
scanf("%c ",g->vertice[i].data);
ad[i].firstarc=NULL;

}

for(k=1;k<=g->arcnum;k++)
{
scanf("%d %d ",&i,&j);

q=(ArcNode *)malloc(sizeof(ArcNode));
q->adjvex=j;
q->nextstarc=g->vertice[i].firststarc;
g->vertice[i].firststarc=q;
}
}
main()
{
Graph g;
clrscr();
CreateGraph(&g);
getch();
printf("trave_DFS:"/n);
trave_DFS(g);
getch();
printf("trave_BFS:"/n);
trave_BFS(g);
getch();
}