백준 1260 Bfs, Dfs

 

#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <string>

using namespace std;

int N;
int M;

int V;

void Bfs(vector<vector<bool>>& ad)
{
	queue<int> q;
	vector<bool> visited(ad.size() + 1, false);

	q.push(V);
	cout << V << " ";
	visited[V] = true;

	while (!q.empty())
	{
		int node = q.front();
		q.pop();

		for (int i = 1; i < ad.size(); ++i)
		{
			if (visited[i] == true)
			{
				continue;
			}

			if (ad[node][i] == true)
			{
				q.push(i);
				visited[i] = true;
				cout << i << " ";
			}
		}
	}
}

void Dfs(vector<vector<bool>>& ad, vector<bool>& visited,int start)
{
	vector<int> vec;

	vec.push_back(start);
	cout << start << " ";
	visited[start] = true;

	for (int i = 1; i < ad.size(); ++i)
	{
		if (visited[i] == true)
		{
			continue;
		}
		if (ad[start][i] == true && start != i)
		{
			visited[i] = true;

			Dfs(ad, visited,i);
		}
	}

}


int main(void)
{
	cin >> N >> M >> V;

	vector<vector<bool>> ad(N+1, vector<bool>(N+1, false));

	for (int i = 0; i < M; ++i)
	{
		int a;
		int b;
		cin >> a >> b;

		ad[a][b] = true;
		ad[b][a] = true;
	}
	vector<bool> visited(ad.size() + 1, false);

	Dfs(ad, visited, V);

	cout << "\n";

	Bfs(ad);
	
	

	return 0;
}