[백준] 1260번 DFS와 BFS C++

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

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

int N, M, V;

int adjacent[1001][1001] = { 0, };
bool visited[1001] = { false, };

void DFS(int idx)
{
	cout << idx << " ";
	for (int i = 1; i <= N; i++)
	{
		if (adjacent[idx][i] == 1 && !visited[i])
		{
			visited[i] = 1;
			DFS(i);
		}
	}
}

void BFS(int idx)
{
	queue<int> q;
	q.push(idx);
	visited[idx] = 1;
	while (!q.empty())
	{
		idx = q.front();
		cout << idx << " ";
		q.pop();
		for (int i = 1; i <= N; i++)
		{
			if (adjacent[idx][i] == 1 && !visited[i])
			{
				visited[i] = 1;
				q.push(i);
			}
		}
	}
}

int main(void)
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int tmp1, tmp2;
	cin >> N >> M >> V;
	for (int i = 0; i < M; i++)
	{
		cin >> tmp1 >> tmp2;
		adjacent[tmp1][tmp2] = 1;
		adjacent[tmp2][tmp1] = 1;
	}
	visited[V] = 1;
	DFS(V);
	cout << "\n";
	memset(visited, false, sizeof(visited));
	BFS(V);
	return 0;
}