(c++)백준 1260번: DFS와 BFS

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

1260번: DFS와 BFS

dfs알고리즘, bfs알고리즘

 

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

int N, M, V;
int Graph[1001][1001];//이어진 정점들 1 표시
bool check[1001];

void dfs(int curV) {
	check[curV] = true;
	cout << curV << ' ';
	for (int i = 1; i <= N; i++) {
		if (Graph[curV][i] == true && check[i] == false) {
			dfs(i);
		}
	}
}

void bfs() {
	queue<int>q;
	check[V] = true;
	q.push(V);
	while (!q.empty()) {
		int curV = q.front();
		q.pop();
		cout << curV << ' ';
		for (int i = 1; i <= N; i++) {
			if (Graph[curV][i] == true && check[i] == false) {
				check[i] = true;
				q.push(i);
			}
		}
	}
}

void input() {
	cin >> N >> M >> V;
	for (int i = 0; i < M; i++) {
		int a, b;
		cin >> a >> b;
		Graph[a][b] = 1;
		Graph[b][a] = 1;
	}
}

void solution() {
	input();
	dfs(V);
	cout << '\n';
	memset(check, false, sizeof(check));
	bfs();
}

int main() {
	solution();
	return 0;
}