列出连通集

#include <iostream>
#include <queue>
using namespace std;
const int MAX_N = 10;
int g[MAX_N][MAX_N];
int visited[MAX_N];//用来标记节点是否已经输出
void BFS(int x,int N)
{
	queue<int>q;
	q.push(x);
	visited[x] = 1;
	while (!q.empty())
	{
		int tmp = q.front();
		q.pop();
		cout << tmp << " ";
		for (int i = 0; i < N; i++)
		{
			if (visited[i] == 0 && g[tmp][i] == 1)
			{
				q.push(i);
				visited[i] = 1;
			}
		}
	}
}
void DFS(int start, int N)
{
	visited[start] = 1;
	cout << start << " ";
	int i;
	for (i = 0; i < N; i++)
	{
		if (g[start][i] == 1 && visited[i] == 0)
		{
			DFS(i, N);
		}
	}
}
int main()
{
	int N, E;
	cin >> N >> E;
	for (int i = 0; i < E; i++)
	{
		int x, y;
		cin >> x >> y;
		g[x][y] = 1;
		g[y][x] = 1;
	}
	memset(visited, 0, sizeof(visited));
	for (int i = 0; i < N; i++)
	{
		if (visited[i] == 0)
		{
			cout << "{ ";
			DFS(i, N);
			cout << " }" << endl;;
		}
	}
	memset(visited, 0, sizeof(visited));
	for (int i = 0; i < N; i++)
	{
		if (visited[i] == 0)
		{
			cout << "{ ";
			BFS(i,N);
			cout << " }" << endl;
		}
	}
	return 0;
}