基于邻接矩阵的广度优先遍历算法实现

#include<stdio.h>
#include<string.h>
#include<stdlib.h>

struct Mgraph {
	int visit[100];
	int matrix[100][100];
	char vertex[100];
	int n, e;
};

void Create(Mgraph& g,char a[], int n,int e)
{
	g.visit[100] = { 0 };
	g.e = e;
	g.n = n;
	int vernum = n;
	int arcnum = e;
	int vi, vj;
	for (int i = 0; i < vernum; i++)
		g.vertex[i] = a[i];
	for (int i = 0; i < vernum; i++)
		for (int j = 0; j < vernum; j++)
			g.matrix[i][j] = 0;
	for (int i = 0; i < arcnum; i++)
	{
		printf("请输入边的两个端点序号：");
		scanf_s("%d,%d", &vi,&vj);
		g.matrix[vi][vj] = 1;
		g.matrix[vj][vi] = 1;

	}
}
//递归邻矩阵深度遍历
void MDFS(Mgraph g, int v)
{
	g.visit[100] = { 0 };
	g.visit[v] = 1;
	for (int i = 0; i < g.n; i++)
	{
		if(g.matrix[v][i]==1&&g.visit[i]==0)
		{
			MDFS(g, i);
		}
	}

}
//动态进出队列邻接矩阵广度优先遍历算法（标记输出进队）
void MBFS(Mgraph g, int v)				//基于邻接矩阵的广度优先遍历算法
{
	memset(g.visit, 0, sizeof(g.visit));
	int Qu[100], front = 0, rear = 0;		//定义循环队列并初始化
	int i, j;
	g.visit[v] = 1;		//置已访问标记
	printf("%c ", g.vertex[v]);
	rear = (rear + 1) % 100;
	Qu[rear] = v;							//v进队
	while (front != rear)					//若队列不空时循环
	{
		front = (front + 1);
		i = Qu[front];					//出队顶点i
		for (j = 0; j < g.n; j++)
			if (g.matrix[i][j] != 0) //找邻接点
			{
				if (g.visit[j] == 0)		//若当前邻接点未被访问
				{
					g.visit[j] = 1;		//置该顶点已被访问的标志
					printf("%c ", g.vertex[j]);
					rear = (rear + 1) % 100;	//该顶点进队
					Qu[rear] = j;
				}
			}
	}
	//测试
	/*for (int i = 1; i <= rear; i++)
	{
		printf("%d", Qu[i]);
			printf("%c", g.vertex[Qu[i]]);
	}*/
}
//静态队列（以队列中储存最大元素数目为n为终点）的邻接矩阵广度优先遍历算法
void MBFS1(Mgraph g, int v)
{
	int i, j, m, cur;
	int book[60], que[60], e[60][60];
	int head, tail;
	m = g.n;
	for (int i=0; i < g.n; i++)
		for (int j=0; j < g.n; j++)
			e[i][j] = g.matrix[i][j];
	memset(book, 0, sizeof(book));
	memset(que, 0, sizeof(que))                                                                                                                                                                                                                                                ;
	head = 0;
	tail = 0;
	que[tail] = 0;
	tail++;
	book[0] = 1;
	while (head < tail&&tail < m)
	{
		cur = que[head];
		for (i = 0; i < m; i++)
		{
			if (e[cur][i] == 1 && book[i] == 0)
			{
				que[tail] = i;
				tail++;
				book[i] = 1;
			}
			if (tail > m)
			{
				break;
			}
		}
		head++;

	}
	for (i = 0; i < tail; i++)
		printf("%c ", g.vertex[que[i]]);
	printf("\n");
}






int main()
{
	Mgraph g;
	char ver[] = "ABCDEFGH";
	Create(g, ver, 8, 9);
	//测试邻接矩阵
	/*for (int i = 0; i < g.n; i++)
	{
		for (int j = 0; j < g.n; j++)
			printf("%d ", g.matrix[i][j]);
		printf("\n");
	}*/
	MBFS(g,0);
	printf("\n");
	MBFS1(g,0);
}

运行截图如下：