采用邻接表存储结构实现图的广度优先遍历。

课程设计题目九：图的广度优先遍历

基本要求：

采用邻接表存储结构实现图的广度优先遍历。

（2）对任意给定的图（顶点数和边数自定），建立它的邻接表并输出；（3）实现图的广度优先遍历*/

#include

#include

#include

#define MAX_NUM 20

int visited[MAX_NUM]={0};

typedef int VertexType;

typedef enum {DG=1,UDG}GraphKind;

typedef struct ArcNode

{

int adjvex;

int weight;

struct ArcNode *nextarc;

ArcNode *info;

}ArcNode;

typedef struct VNode

{

VertexType data;

ArcNode *firstarc;

}VNode,AdjList[MAX_NUM];

typedef struct

{

AdjList vertices;

int vexnum,arcnum;

GraphKind kind;

}ALGraph;

void PRIN(ALGraph &G);

void Creat_adjgraph(ALGraph &G);

void bfs(ALGraph &G,int v);

void Creat_adjgraphDG(ALGraph &G);

void Creat_adjgraphUDG(ALGraph &G);

void Creat_adjgraph(ALGraph &G);

void Creat_adjgraphDG(ALGraph &G)

{

int i,s,d;

ArcNode *p=NULL,*q=NULL;G.kind=DG;

printf("请输入顶点数和边数：");

scanf("%d %d",&G.vexnum,&G.arcnum);

for(i=0;i

{

printf("第%d个顶点信息：",i+1);

scanf("%d",&G.vertices[i].data);

G.vertices[i].firstarc=NULL;}

for(i=0;i

{

printf("第%d条边的起始顶点编号和终止顶点编号：",i+1);

scanf("%d %d",&s,&d);

while(s<1||s>G.vexnum||d<1||d>G.vexnum)

{

printf("编号超出范围，重新输入");

scanf("%d%d",&s,&d);}

s--;

d--;

p=new(ArcNode);

p->adjvex=d;

p->nextarc=G.vertices[s].firstarc;

G.vertices[s].firstarc=p;

}

}

void Creat_adjgraphUDG(ALGraph &G)

{

int i,s,d;

ArcNode *p,*q;

G.kind=UDG;

printf("请输入顶点数和边数：");

scanf("%d %d",&G.vexnum,&G.arcnum);

for(i=0;i

{

printf("第%d个顶点信息：",i+1);

scanf("%d",&G.vertices[i].data);

G.vertices[i].firstarc=NULL;}

for(i=0;i

{

printf("第%d条边的起始顶点编号和终止顶点编号：",i+1);

scanf("%d %d",&s,&d);

while(s<1||s>G.vexnum||d<1||d>G.vexnum)

{

printf("编号超出范围，重新输入");

scanf("%d %d",&s,&d);}

s--;

d--;

p=new(ArcNode);

p->adjvex=d;

p->nextarc=G.vertices[s].firstarc;

G.vertices[s].firstarc=p;

q=new(ArcNode);

q->adjvex=s;

q->nextarc=G.vertices[d].firstarc;

G.vertices[d].firstarc=q;

}

}

void PRIN(ALGraph &G)

{

int i;

ArcNode *p;

if(G.kind==DG||G.kind==UDG)

{

for(i=0;i

{

printf("V%d:",G.vertices[i].data);

p=G.vertices[i].firstarc;

while(p!=NULL)

{

printf("%d\t",p->adjvex+1);

p=p->nextarc;}

printf("\n");}

}

}

void bfs(ALGraph &G,int v)

{

v--;

ArcNode *p;

int queue[MAX_NUM],front=0,rear=0;

int w,i;

for(i=0;i

printf("%4d",v+1);

visited[v]=1;

rear=(rear+1)%MAX_NUM;

queue[rear]=v;

while(front!=rear)

{