基于邻接矩阵的图的深度优先遍历BFS（STL+数组模拟队列）

最新推荐文章于 2023-03-02 23:16:37 发布

布克波波

最新推荐文章于 2023-03-02 23:16:37 发布

阅读量417

点赞数

文章标签：深度优先算法 c++ 递归算法

本文链接：https://blog.csdn.net/Bookerbobo/article/details/122832126

版权

借助SDUT OJ 图的深度遍历来验证代码

图的深度遍历https://acm.sdut.edu.cn/onlinejudge3/contests/3987/problems/A

vector数组实现

#include<bits/stdc++.h>
using namespace std;
const int	N = 1e3 + 10;
int mp[N][N];
int vis[N];
vector<int> ans;
#define TLE std::ios::sync_with_stdio(false);
void DFS(int t, int k)
{
	for (int i = 1; i < k; i++)
	{
		if (vis[i] == 0 && mp[t][i] == 1)
		{
			ans.push_back(i);
			vis[i] = 1;
			DFS(i, k);
		}
	}
}
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;
		while (m--)
		{
			cin >> u >> v;
			mp[u][v] = mp[v][u] = 1;
		}
		t = 0;
		vis[t] = 1;
		ans.push_back(t);
		DFS(t, k);
		while (!ans.empty())
		{
			cout << ans.front() << " ";
			ans.erase(ans.begin());
		}
		cout << endl;
	}
	return 0;
}

数组模拟队列实现

#include<bits/stdc++.h>
using namespace std;
const int	N = 1e2 + 10;
int mp[N][N];
int vis[N];
int ans[N];
#define TLE std::ios::sync_with_stdio(false);
int p;
void DFS(int t, int k)
{
	int i;
	for (i = 0; i < k; i++)
	{
		if (vis[i]==0&&mp[t][i]==1)
		{
			vis[i] = 1;
			ans[p++] = i;
			DFS(i, k);
		}
	}
}
int main()
{
	TLE;
	int t, n, m, u, v,k;
	cin >> n;
	while (n--)
	{
		p = 0;
		memset(mp, 0, sizeof(mp));
		memset(vis, 0, sizeof(vis));
		memset(ans, 0, sizeof(ans));
		cin >> k >> m;
		while (m--)
		{
			cin >> u >> v;
			mp[u][v] = mp[v][u] = 1;
		}
		t = 0;
		vis[t] = 1;
		ans[p++] = 0;
		DFS(t, k);
		for (int i = 0; i < p; i++)
		{
			cout << ans[i] << " ";
		}
		cout << endl;
	}
	return 0;
}