数据结构--图的广度优先搜索

广度优先搜索是依次遍历未被访问的结点依次入队，再出队，每出队一个元素，判断后面的结点是否有未被访问的结点，如果有，给其入队

void BFS(AdjGraph* G, int v)  //广度优先搜索
{
	ArcNode* p;
	int queue[MAXV], front = 0, rear = 0;
	int visited[MAXV];
	int w, i;
	for (i = 0; i < G->n; i++)
	{
		visited[i] = 0;
	}
	printf("%3d", v);
	visited[v] = 1;
	rear = (rear + 1) % MAXV;
	queue[rear] = v;
	while (front != rear)
	{
		front = (front + 1) % MAXV;
		w = queue[front];
		p = G->adjlist[w].firstarc;
		while (p != NULL)
		{
			if (visited[p->adjvex] == 0)
			{
				printf("%3d", p->adjvex);
				visited[p->adjvex] = 1;
				rear = (rear + 1) % MAXV;
				queue[rear] = p->adjvex;
			}
			p = p->nextarc; 
		}
	}
	printf("\n");
}