这是广度优先遍历

#include<stdio.h>
int main(void)
{
	int i = 0, j = 0, n = 0, m = 0, a = 0, b = 0, cur = 0, book[101] = { 0 }, e[101][101] = { 0 };
	int que[10001] = { 0 }, d[101] = { 0 },head = 0, tail = 0;
	scanf("%d%d", &n, &m);
	for (i = 1; i <= n; i++)
	{
		for (j = 1; j <= n; j++)
		{
			if (j == i)
			{
				e[i][j] = 0;
			}
			else
			{
				e[i][j] = 99999999;
			}
		}
	}
	//读入顶点之间的边
	for (i = 1; i <= m; i++)
	{
		scanf("%d%d", &a, &b);
		e[a][b] = 1;
		e[b][a] = 1;
	}
	//队列初始化
	head = 1;
	tail = 1;
	//从一号顶点出发，将一号顶点加入队列
	que[tail] = 1;
	tail++;
	book[1] = 1;//标记1号顶点已访问
	//当队列不为0时循环
	while (head<tail&&tail<=n)
	{
		cur = que[head];//当前正在访问的顶点的编号
		for (i = 1; i <= n; i++)//从1-n依次尝试
		{
			if (e[cur][i] == 1 && book[i] == 0)
			{
				//如果从顶点cur到顶点i有边，并且顶点i没有被访问过，则顶点i入队
				d[cur]++;
				que[tail] = i;
				tail++;
				book[i] = 1;
			}
			//如果tail大于n，则表明所有顶点都已经被访问过
			if (tail > n)
			{
				break;
			}
		}
		head++;//注意这个地方，千万不要忘记当一个顶点扩展结束后，head++，然后才能继续往下扩展
	}
	for (i = 1; i <tail; i++)
	{
		printf("%d ", que[i]);
	}
	printf("\n");
	for (i = 1; i < tail; i++)
	{
		printf("%d ", d[i]);
	}
	return 0;
}