啊哈！图的广度优先遍历

#include <stdio.h>
int main()
{
	
	int book[101] = {0},e[101][101];
	int i, j, n, m, a, b, cur;
	int queue[10001], head, tail;

	printf("**************图的广度优先遍历**************\n");
	printf("输入顶点的数目: ");
	scanf("%d", &n);
	printf("输入边的数目: ");
	scanf("%d", &m);
	for (i = 1; i<= n; i++)
		for (j = 1; j <= n; j++)
		{
			if (i == j) 
				e[i][j] = 0;
			else
				e[i][j] = 99999999;//假设99999999为无穷大
		}
	//读入边
	for (i = 1; i<= m; i++)
	{
		printf("输入两个相邻的顶点(空格隔开):");
		scanf("%d %d", &a, &b);
		e[a][b] = 1;
		e[b][a] = 1;//这里为无向图
	}

	head = 1;
	tail = 1;
	//从1号顶点出发
	queue[tail] = 1;
	tail++;
	book[1] = 1;

	while (head < tail)
	{
		cur = queue[head];
		for (i = 1; i <= n; i++)
		{
			if (e[cur][i] == 1 && book[i] == 0)
			{
				queue[tail] = i;
				tail++;
				book[i] = 1;
			}
			if (tail > n)
				break;
		}
		head++;
	}

	for (i = 1; i < tail; i++)
		printf("%d ", queue[i]);

	getchar();
	getchar();
	return 0;
}

广度优先遍历的主要思想就是：首先以一个未访问过的顶点作为起始顶点，访问其所有相邻的顶点，然后对每个相邻的顶点，再访问它们相邻的未被访问过的顶点，直到所有顶点都被访问过，遍历结束。