给定一个有N个顶点和E条边的无向图,请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N−1编号。进行搜索时,假设我们总是从编号最小的顶点出发,按编号递增的顺序访问邻接点。
输入格式:
输入第1行给出2个整数N(0<N≤10)和E,分别是图的顶点数和边数。随后E行,每行给出一条边的两个端点。每行中的数字之间用1空格分隔。
输出格式:
按照"{ v1 v2 ... vk }"的格式,每行输出一个连通集。先输出DFS的结果,再输出BFS的结果。
输入样例:
8 6
0 7
0 1
2 0
4 1
2 4
3 5
结尾无空行
输出样例:
{ 0 1 4 2 7 }
{ 3 5 }
{ 6 }
{ 0 1 2 7 4 }
{ 3 5 }
{ 6 }
vector邻接表:
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
int n;
vector<int>v[16];
int vis[16] = {0};
void dfs(int x)
{
if(vis[x])
{
return;
}
vis[x] = 1;
cout << x << " ";
vector<int>t = v[x];
sort(t.begin(), t.end());
for(int i = 0; i < t.size(); i++)
{
dfs(t[i]);
}
}
void bfs(int x)
{
queue<int>q;
vis[x] = 1;
q.push(x);
while(!q.empty())
{
int x = q.front();
q.pop();
cout << x << " ";
vector<int>t = v[x];
sort(t.begin(), t.end());
for(int i = 0; i < t.size(); i++)
{
if(!vis[ t[i] ])
{
vis[ t[i] ] = 1;
q.push(t[i]);
}
}
}
}
int main()
{
// system("chcp 65001");
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("C:/Users/zhaochen/Desktop/input.txt", "r", stdin);
cin >> n;
int E;
cin >> E;
for(int i = 0; i < E; i++)
{
int a, b;
cin >> a >> b;
v[a].push_back(b);
v[b].push_back(a);
}
for(int i = 0; i < n; i++)
{
if(!vis[i])
{
cout << "{ ";
dfs(i);
cout << "}" << endl;
}
}
memset(vis, 0, sizeof(vis));
for(int i = 0; i < n; i++)
{
if(!vis[i])
{
cout << "{ ";
bfs(i);
cout << "}" << endl;
}
}
return 0;
}
邻接矩阵:
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
int n;
int g[16][16] = {0};
int vis[16] = {0};
void dfs(int x)
{
if(vis[x])
{
return;
}
vis[x] = 1;
cout << x << " ";
for(int i = 0; i < n; i++)
{
if(g[x][i] == 1)
{
dfs(i);
}
}
}
void bfs(int x)
{
queue<int>q;
vis[x] = 1;
q.push(x);
while(!q.empty())
{
int x = q.front();
q.pop();
cout << x << " ";
for(int i = 0; i < n; i++)
{
if(!vis[i] && g[x][i] == 1)
{
vis[i] = 1;
q.push(i);
}
}
}
}
int main()
{
// system("chcp 65001");
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("C:/Users/zhaochen/Desktop/input.txt", "r", stdin);
cin >> n;
int E;
cin >> E;
for(int i = 0; i < E; i++)
{
int a, b;
cin >> a >> b;
g[a][b] = 1;
g[b][a] = 1;
}
for(int i = 0; i < n; i++)
{
if(!vis[i])
{
cout << "{ ";
dfs(i);
cout << "}" << endl;
}
}
memset(vis, 0, sizeof(vis));
for(int i = 0; i < n; i++)
{
if(!vis[i])
{
cout << "{ ";
bfs(i);
cout << "}" << endl;
}
}
return 0;
}