백준 1260 DFS와 BFS

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

1260번: DFS와 BFS

#include<stdio.h>
#include<iostream>
#include<queue>
#include<vector>
#include<string.h>
#include<algorithm>
#define NSIZE 1001
#define MSIZE 10001
using namespace std;
int N;
int M;
int S;
int chk[MSIZE];
vector<int>G[NSIZE];
 
void init() {
    scanf("%d %d %d", &N, &M, &S);
    for (int i = 0; i < N; i++) {
        G[i].clear();
    }
    for (int i = 0; i < M; i++) {
        int a, b;
        scanf("%d %d",&a,&b);
        G[a].push_back(b);
        G[b].push_back(a);
 
    }
}
void dfs(int c) {
    printf("%d ", c);
    for (int i = 0; i < G[c].size(); i++) {
        if (chk[G[c][i]] == 0) {
            chk[G[c][i]] = 1;
            dfs(G[c][i]);
        }
    }
}
void bfs() {
    queue<int> q;
    q.push(S);
    chk[S] = 1;
    while (!q.empty()) {
        int c = q.front(); q.pop();
        printf("%d ",c);
 
        for (int i = 0; i < G[c].size(); i++) {
            if (chk[G[c][i]] == 0) {
                chk[G[c][i]] = 1;
                q.push(G[c][i]);
            }
        }
    }
}
int main(void) {
    init();
    for (int i = 0; i < N; i++) {
        sort(G[i].begin(), G[i].end());
    }
    chk[S] = 1;
    dfs(S);
    memset(chk, 0, sizeof(chk));
    cout << endl;
    bfs();
    return 0;
}