(C++) - 백준(BOJ) 1260번 : DFS와 BFS 답

#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;
vector <int> graph[10001];
int ck[1001];
int n,m,s;
 
void bfs(int i){
    ck[i] = 1;
    queue <int> q;
    q.push(i);
    while(!q.empty()){
        int x = q.front();
        q.pop();
        cout << x << ' ';
        for(int j = 0; j < graph[x].size(); j++){
            int next = graph[x][j];
            if(!ck[next]){
                q.push(next);
                ck[next] = 1;
            }
        }
    }
}
void dfs(int i){
    ck[i] = 1;
    cout << i << ' ';
    for(int j = 0; j<graph[i].size(); j++){
        int next = graph[i][j];
        if(!ck[next]) dfs(next);
    }
}
 
int main(){
    cin >> n >> m >> s;
    for(int i = 0; i<m; i++){
        int u,v;
        cin >> u >> v;
        graph[u].push_back(v);
        graph[v].push_back(u);
    }
    for(int i = 1; i<=n; i++){
        sort(graph[i].begin(),graph[i].end());
    }
    dfs(s);
    cout << '\n';
    memset(ck,0,sizeof(ck));
    bfs(s);
}