1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36

#include <iostream>
#include <queue>
#include <string.h>
using namespace std;
int n, m, v, q, w, a[1002][1002] = {};
bool b[1002];
void dfs(int x) {
	b[x] = true;
	cout << x << " ";
	for (int i = 1; i <= n; i++)
		if (a[x][i] && !b[i])	dfs(i);
}
int main() {
	cin >> n >> m >> v;
	for (int i = 0; i < m; i++) {
		cin >> q >> w;
		a[q][w] = 1;
		a[w][q] = 1;
	}
	dfs(v);
	cout << endl;
	memset(b, 0, n + 1);
	queue<int> c;
	c.push(v);
	b[v] = true;
	while (!c.empty()) {
		cout << c.front() << " ";
		for (int i = 1; i <= n; i++)
			if (a[c.front()][i] && !b[i]) {
				c.push(i);
				b[i] = true;
			}
		c.pop();
	}
	cout << endl;
}