[BOJ 1206] DFS와 BFS

문제출처

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

소스코드

#include <iostream>
#include <queue>
#include <cstring>
#define MAX 1000
using namespace std;
int n, m, v;
int map[MAX][MAX];
bool visit[MAX];
 
void init() {
    cin>>n>>m>>v;
    int s,e;
    for (int i=0; i<m; i++) {
        cin>>s>>e;
        map[s][e]=1;
        map[e][s]=1;
    }
}
 
void dfs(int s) {
    visit[s]=1;
    cout<<s<<" ";
    for (int i=0; i<=n; i++) {
        if (!visit[i] && map[s][i] == 1) {
            dfs(i);
        }
    }
}
 
void bfs(int s) {
    queue<int> q;
    q.push(s);
    visit[s]=1;
    
    while (!q.empty()) {
        int cur = q.front();
        q.pop();
        cout<<cur<<" ";
        for (int i=0; i<=n; i++) {
            if (!visit[i] && map[cur][i] == 1) {
                q.push(i);
                visit[i]=1;
            }
        }
    }
}
 
int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    init();
    dfs(v);
    memset(visit, 0, sizeof(visit));
    cout<<"\n";
    bfs(v);
    return 0;
}