[백준/1260] DFS와 BFS

https://www.acmicpc.net/problem/1260

1260번: DFS와 BFS

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cstring>
using namespace std;

vector<int> a[1001];
bool check[1001];


void dfs(int start) {
	check[start] = true;
	cout << start << ' ';
	for (int i = 0; i < a[start].size(); i++) {
		if (!check[a[start][i]]) {
			dfs(a[start][i]);
		}
	}
}

void bfs(int start) {
	memset(check, false, sizeof(check));
	queue<int> q;
	q.push(start);
	check[start] = true;
	while (!q.empty()) {
		int node = q.front();
		cout << node << ' ';
		q.pop();
		for (int i = 0; i < a[node].size(); i++) {
			if (!check[a[node][i]]) {
				q.push(a[node][i]);
				check[a[node][i]] = true;
			}
		}
	}
}

int main() {
	int n, m, start;
	cin >> n >> m >> start;

	for (int i = 0; i < m; i++) {
		int u, v;
		cin >> u >> v;
		a[u].push_back(v);
		a[v].push_back(u);
	}
	for (int i = 1; i <= n; i++) {
		sort(a[i].begin(), a[i].end());
	}
	dfs(start);
	cout << '\n';
	bfs(start);

	return 0;
}