BFS-图的广度优先搜索--邻接矩阵

# include <stdio.h>
# include <malloc.h>
# include <memory.h>


# define MAX 20		//最大顶点数 


typedef struct
{
	char vexs[MAX];		//顶点向量 
	bool visited[MAX];		//访问标志数组 
	int arcs[MAX][MAX];		//邻接矩阵 
	int arcnum,vexnum;		//图的当前顶点数和弧数 
}MGRAPH, *mgraph;


void init_mgraph(mgraph &g)		//初始化图 
{
	g = (mgraph)malloc(sizeof(MGRAPH));
	g->vexnum = 0;
	g->arcnum = 0;
	memset(g->vexs,0,sizeof(char)*MAX);
	memset(g->visited,false,sizeof(bool)*MAX);		//访问标志数组为false时，未访问 
	for (int i=0;i<MAX;++i)
	{
		for (int j=0;j<MAX;++j)
		{
			g->arcs[i][j] = 0;
		}
	}
}


void add_vexs(mgraph &g)		//增加顶点 
{
	printf ("请输入顶点的个数\n");
	scanf ("%d",&g->vexnum);
	printf ("请输入顶点的信息\n");
	for (int i=0;i<g->vexnum;++i)
	{
		scanf (" %c",&g->vexs[i]);
	}
}


void add_arcs(mgraph &g)		//增加边 
{
	printf ("请输入边的个数\n");
	scanf ("%d",&g->arcnum);
	char ch1,ch2;
	int row,col;
	printf ("请输入边的信息\n");
	for (int i=0;i<g->arcnum;++i)
	{
		scanf (" %c %c",&ch1,&ch2);
		for (int j=0;j<g->vexnum;++j)
		{
			if (g->vexs[j] == ch1)
			{
				row = j;
			}
			if (g->vexs[j] == ch2)
			{
				col = j;
			}
		}
		g->arcs[row][col] = 1;
		g->arcs[col][row] = 1;			//无向图加上此行 
	}
}


void creat_mgraph(mgraph &g)	//	创建图 
{
	add_vexs(g);
	add_arcs(g);
}


void print_mgraph(mgraph &g)		//输出图 
{
	int i,j;
	printf ("   ");
	for (i=0; i<g->vexnum; ++i)
	{
		printf ("%3c",g->vexs[i]);
	}
	printf ("\n");
	for (i=0; i<g->vexnum; ++i)
	{
		printf ("%3c",g->vexs[i]);
		for (j=0; j<g->vexnum; ++j)
		{
			printf ("%3d",g->arcs[i][j]);
		}
		printf ("\n");
	}
	printf ("\n");
}


void visit(mgraph &g,int i)
{
	printf ("%c ",g->vexs[i]);
	g->visited[i] = true;
}


void BFStraverse(mgraph &g,int i)		//广度优先搜索 
{										//从第i个结点可是搜索 
	int quene[MAX];			//辅助 队列 
	memset(quene;0;sizeof(int)*MAX);
	int front = 0;		//头指针 
	int rear = 0;		//尾指针 
	int gettop;		//取队头，节点编号	 
	
	visit(g,i);
	quene[rear++] = i;		//入对 
	
	while(front != rear)		//队列非空 
	{
		gettop = quene[front++];		//出队 
		for (int j=0; j<g->vexnum; ++j)
		{
			if (g->arcs[gettop][j] && !g->visited[j])
			{
				visit(g,j);
				quene[rear++] = j;		//入队 
			}
		}
	}
}


int main (void)
{
	mgraph g;
	init_mgraph(g);
	creat_mgraph(g);
	print_mgraph(g);
	BFStraverse(g,0);
	
	return 0;
}