图的遍历——广度优先搜索

按照图的广度优先搜索算法，那么可以很直观的看出上一篇文章中图的遍历顺序如下

程序实现如下：

#include "pch.h"
#include<stdio.h>
#include<stdlib.h>
using namespace std;

const int P_Num = 5;
#define N 10000
const int iTreeMap[P_Num][P_Num] = {
	0,1,1,N,1,
	1,0,N,1,N,
	1,N,0,N,1,
	N,1,N,0,N,
	1,N,1,N,0
};
bool book[P_Num] = {false};

int Queue[128] = { 0 };
int head = 0;
int tail = 0;

void bfs()
{
	while (head < tail)
	{
		for (int i = 0; i < P_Num; i++)
		{
			if (!book[i] && iTreeMap[Queue[head]][i] == 1)
			{
				book[i] = true;
				Queue[tail++] = i;
			}
		}
		if (tail >= P_Num)
		{
			break;
		}
		head++;
	}
	for (int j=0; j<P_Num; j++)
	{
		printf("%d ", Queue[j] + 1);
	}

}
int main()
{
	head = 0;
	tail = 0;
	Queue[tail++] = 0;
	book[0] = true;
	bfs();
	return 0;
}