/*邻接表和队列实现广度优先遍历*/
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAX_VERTEX_NUM 20
/*无向邻接表的结构*/
typedef struct ArcNode{ /*表节点*/
int adjvex; /*邻接点*/
struct ArcNode *nextarc; /*指向下一条弧的指针*/
}ArcNode;
typedef struct VNode{ /*头结点*/
int data; /*定点信息*/
ArcNode * firstarc; /*指向第一个依附该顶点的弧的指针*/
}VNode,AdjList[MAX_VERTEX_NUM];
typedef struct{ /*图*/
AdjList vertices; /*顶*/
int vexnum,arcnum; /*图的顶点数和弧数*/
}ALGraph;
/*队列的结构*/
#define QUEUE_INIT_SIZE 100 /*队列元素个数*/
int Visited[MAX_VERTEX_NUM]; /*顶点访问标志*/
typedef struct queue{
int * base; /*队列基指针*/
int first; /*队列头指针*/
int tail; /*队列尾指针*/
}Queue;
void Init_Queue(Queue * Q) /*循环队列的初始化*/
{
Q->base=(int *)malloc(QUEUE_INIT_SIZE * sizeof(int));
if(!Q->base)exit(0);
Q->first=Q->tail=0;
}
void Push_Queue(Queue * Q,int e) /*循环队列的入列*/
{
if(((Q->tail+1) % QUEUE_INIT_SIZE)==Q->first)exit(0);
Q->base[Q->tail]=e;
Q->tail=(Q->tail+1) % QUEUE_INIT_SIZE;
}
void Pop_Queue(Queue * Q,int * e) /*循环队列的出列*/
{
if(Q->first==Q->tail)exit(0);
*e=Q->base[Q->first];
Q->first=(Q->first+1) % QUEUE_INIT_SIZE;
}
int LocateVex(ALGraph * G,int v) /*寻找节点V的位置*/
{
int k,n;
for(k=0;k<G->vexnum;k++){
if(G->vertices[k].data==v){
n=k;
break;
}
}
return n;
}
void Print_ALGraph(ALGraph *G) /*打印邻接表*/
{
int i;
ArcNode *a3;
printf("打印广度优先遍历图:\n");
for(i=0;i<G->vexnum;i++){
printf(" %d V%d |",i,G->vertices[i].data);
if(G->vertices[i].firstarc!=NULL){
a3=G->vertices[i].firstarc;
while(a3)
{
printf(" --> %d ",a3->adjvex);
a3=a3->nextarc;
}
}
printf("\n");
}
}
void Insertadj(ALGraph * G,int i,int j) /*插入邻接点的下标*/
{
ArcNode *a1,*a2;
a1=(ArcNode *)malloc(sizeof(ArcNode));
a1->adjvex=j;a1->nextarc=NULL;
if(G->vertices[i].firstarc==NULL){
G->vertices[i].firstarc=a1;
}
else{
a2=G->vertices[i].firstarc;
while(a2->nextarc)
{
a2=a2->nextarc;
}
a2->nextarc=a1;
}
}
void Init_ALGraph(ALGraph * G) /*初始化图并建图*/
{
int v,v1,v2,i,j;
printf("输入(点,边): ");scanf("%d,%d",&G->vexnum,&G->arcnum);
for(v=0;v<G->vexnum;v++){
printf("输入点 V%d:",(v+1));
scanf("%d",&(G->vertices[v].data));
G->vertices[v].firstarc=NULL;
}
for(v=0;v<G->arcnum;v++)
{
printf("输入<点,点>: ");
scanf("%d,%d",&v1,&v2);
i=LocateVex(G,v1); /*v1的位置*/
j=LocateVex(G,v2); /*v2的位置*/
Insertadj(G,i,j);
Insertadj(G,j,i);
}
Print_ALGraph(G);
}
void BFS(ALGraph * G,Queue * Q,int v) /*广度优先遍历子函数*/
{
ArcNode * a1;
int *V,h,k;
V=&k;
Visited[v]=1;
Push_Queue(Q,G->vertices[v].data);
while(Q->first!=Q->tail){
Pop_Queue(Q,V);
printf(" V%d ",*V);
if(G->vertices[LocateVex(G,*V)].firstarc!=NULL){
a1=G->vertices[LocateVex(G,*V)].firstarc;
while(a1){
if(!Visited[a1->adjvex]){
Push_Queue(Q,G->vertices[a1->adjvex].data);
Visited[a1->adjvex]=1;
}
a1=a1->nextarc;
}
}
}
}
void BFSVisited(ALGraph * G,Queue * Q) /*广度优先遍历访问*/
{
int v;
for(v=0;v<G->vexnum;v++)Visited[v]=0; /*访问标志初始化*/
printf("打印广度优先遍历顺序: \n");
for(v=0;v<G->vexnum;v++){
if(!Visited[v]){ /*如果当前下标未访问过*/
BFS(G,Q,v); /*则访问当前节点*/
}
}
printf("\n");
}
int main(int argc,char **argv)
{
ALGraph G;
Queue Q;
Init_Queue(&Q);
Init_ALGraph(&G);
BFSVisited(&G,&Q);
return 0;
}