DFS와 BFS (1260)

문제

입력

출력

예제 입력 1

4 5 1
1 2
1 3
1 4
2 4
3 4

예제 출력 1

1 2 4 3
1 2 3 4

예제 입력 2

5 5 3
5 4
5 2
1 2
3 4
3 1

예제 출력 2

3 1 2 5 4
3 1 4 2 5

예제 입력 3

1000 1 1000
999 1000

예제 출력 3

1000 999
1000 999

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>

using namespace std;

vector<vector<int>> adjancent;
vector<bool> discorverd;
void dfs(int here);
void bfs(int here);
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

	adjancent = vector<vector<int>>(10001);
	discorverd = vector<bool>(1001, false);
	int n, m, v;
	cin >> n >> m >> v;
	for (int i = 1; i <= m; i++)
	{
		int a, b;
		cin >> a >> b;
		adjancent[a].push_back(b);
		adjancent[b].push_back(a);
	}
	for (int i = 1; i <= n; i++)
	{
		sort(adjancent[i].begin(),adjancent[i].end());
	}
	dfs(v);
	discorverd = vector<bool>(1001, false);
	cout << '\n';
	bfs(v);
}

void dfs(int here) 
{
	//재귀
	if (discorverd[here] == true) return;
	discorverd[here] = true;
	cout << here << " ";
	for (int i = 0; i < adjancent[here].size(); i++)
	{
		dfs(adjancent[here][i]);
	}
}
void bfs(int here) {
	//큐
	queue<int> q;
	q.push(here);
	discorverd[here] = true;
	while (q.empty() == false)
	{
		 here = q.front();
		q.pop();
		cout << here << " ";
		for (int there : adjancent[here])
		{
			if (discorverd[there] == true) continue;
			discorverd[there] = true;
			q.push(there);
		}

	}
}