[BOJ] 24479번, 24480번 알고리즘 수업 - 깊이 우선 탐색 1, 2 (C++)

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

24479번: 알고리즘 수업 - 깊이 우선 탐색 1

 

 

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

vector<vector<int>> e(100001);
int visited[100001] = {0, };
int cnt = 1;

void dfs(int w){
	visited[w] = cnt++;
	for(int i = 0; i < e[w].size(); i++){
		if(!visited[e[w][i]]) dfs(e[w][i]);
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n, m, r, u, v;
	cin >> n >> m >> r;

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

 

 

 

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

24480번: 알고리즘 수업 - 깊이 우선 탐색 2

 

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

vector<vector<int>> e(100001);
int visited[100001] = {0, };
int cnt = 1;

void dfs(int w){
	visited[w] = cnt++;
	for(int i = 0; i < e[w].size(); i++){
		if(!visited[e[w][i]]) dfs(e[w][i]);
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n, m, r, u, v;
	cin >> n >> m >> r;

	for(int i = 0; i < m; i++){
		cin >> u >> v;
		e[u].push_back(v);
		e[v].push_back(u);
	}
	
	for(int i = 1; i <= n; i++){
		sort(e[i].begin(), e[i].end(), greater<>());
	}
	
	dfs(r);
	
	for(int i = 1; i <= n; i++){
		cout << visited[i] << '\n';
	}
	return 0;
}