基于邻接矩阵的广度优先遍历（数组模拟队列和STL队列）

本文使用SDUT OJ基于邻接表的广度优先搜索遍历

基于邻接表的广度优先搜索遍历https://acm.sdut.edu.cn/onlinejudge3/contests/3987/problems/E

数组模拟队列BFS

void BFS(int n,int k)
{
	in = 0, out = 0;
	que[in++] = n;
	while (in > out)
	{
		int now = que[out++];
		for (int i = 0; i < k; i++)
		{
			if (vis[i] == 0 && mp[now][i] == 1)
			{
				vis[i] = 1;
				que[in++] = i;
			}
		}
	}
}

ac 代码

#include<bits/stdc++.h>
using namespace std;
const int	N = 1e3 + 10;
int mp[N][N];
int vis[N];
int que[N];
int in, out;
#define TLE std::ios::sync_with_stdio(false);//关闭同步流，本题不加不会TLE
void BFS(int n,int k)
{
	in = 0, out = 0;
	que[in++] = n;
	while (in > out)
	{
		int now = que[out++];
		for (int i = 0; i < k; i++)
		{
			if (vis[i] == 0 && mp[now][i] == 1)
			{
				vis[i] = 1;
				que[in++] = i;
			}
		}
	}
}
int main()
{
	TLE;
	int t, n, m, u, v, k;
	cin >> n;
	while (n--)
	{
		memset(mp, 0, sizeof(mp));
		memset(vis, 0, sizeof(vis));
		cin >> k >> m>>t;
		while (m--)
		{
			cin >> u >> v;
			mp[u][v] = mp[v][u] = 1;
		}
		vis[t] = 1;
		BFS(t, k);
		for (int i = 0; i < in; i++)
		{
			cout << que[i] << " ";
		}
		cout << endl;
	}
	return 0;
}

STL实现

void BFS(int n,int k)
{
	que.push(n);
	while (!que.empty())
	{
		int now = que.front();
		for (int i = 0; i < k; i++)
		{
			if (!vis[i] && mp[now][i] == 1)
			{
				vis[i] = 1;
				que.push(i);
			}
		}
		cout << que.front() << " ";
		que.pop();
	}
}

ac代码

#include<bits/stdc++.h>
using namespace std;
const int	N = 1e3 + 10;
int mp[N][N];
int vis[N];
queue<int>que;
int in, out;
#define TLE std::ios::sync_with_stdio(false);
void BFS(int n,int k)
{
	que.push(n);
	while (!que.empty())
	{
		int now = que.front();
		for (int i = 0; i < k; i++)
		{
			if (!vis[i] && mp[now][i] == 1)
			{
				vis[i] = 1;
				que.push(i);
			}
		}
		cout << que.front() << " ";
		que.pop();
	}
}
int main()
{
	TLE;
	int t, n, m, u, v, k;
	cin >> n;
	while (n--)
	{
		memset(mp, 0, sizeof(mp));
		memset(vis, 0, sizeof(vis));
		cin >> k >> m>>t;
		while (m--)
		{
			cin >> u >> v;
			mp[u][v] = mp[v][u] = 1;
		}
		vis[t] = 1;
		BFS(t, k);
	}
	return 0;
}