06-图1 列出连通集 (25分)

给定一个有N个顶点和E条边的无向图，请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N−1编号。进行搜索时，假设我们总是从编号最小的顶点出发，按编号递增的顺序访问邻接点。

输入格式:

输入第1行给出2个整数N(0<N≤10)和E，分别是图的顶点数和边数。随后E行，每行给出一条边的两个端点。每行中的数字之间用1空格分隔。

输出格式:

按照"{ v​1​​ v​2​​ ... v​k​​ }"的格式，每行输出一个连通集。先输出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 }

---

注意：打印结果前后都有空格。 

#include<bits/stdc++.h>
using namespace std;

void dfs(vector<vector<int>>& graph, vector<int>& visDfs, int v) {
	int n = graph.size();
	visDfs[v] = 1;
	cout << v << " ";
	for (int w = 0; w < n; w++) {
		if (graph[v][w] && !visDfs[w]) {
			dfs(graph, visDfs, w);
		}
	}
}

void bfs(vector<vector<int>> graph, vector<int>& visBfs, int v) {
	int n = graph.size();
	queue<int> q;
	q.push(v);
	visBfs[v] = 1;
	cout << v << " ";
	while (!q.empty()) {
		v = q.front();
		q.pop();
		for (int w = 0; w < n; w++) {
			if (graph[v][w] && !visBfs[w]) {
				q.push(w);
				visBfs[w] = 1;
				cout << w << " ";
			}
		}
	}
}

int main() {
	int N, E;
	cin >> N >> E;
	vector<vector<int>> graph(N, vector<int>(N, 0));
	for (int i = 0; i < E; i++) {
		int v, w;
		cin >> v >> w;
		graph[v][w] = 1;
		graph[w][v] = 1;
	}
	//dfs结果
	vector<int> visDfs(N, 0);
	for (int v = 0; v < N; v++) {
		if (!visDfs[v]) {
			cout << "{ ";
			dfs(graph, visDfs, v);
			cout << "}" << endl;
		}
	}
	//bfs结果
	vector<int> visBfs(N, 0);
	for (int v = 0; v < N; v++) {
		if (!visBfs[v]) {
			cout << "{ ";
			bfs(graph, visBfs, v);
			cout << "}" << endl;
		}
	}
	return 0;
}