1260 DFS와 BFS

#include <stdio.h>
#include <queue>
 
using namespace std;
 
int adj[1005][1005] = { 0 };
int chk1[1005] = { 0 };
int chk2[1005] = { 0 };
int n, m, v;
 
void DFS(int v);
void BFS(int v);
 
int main() {    
    scanf("%d %d %d", &n, &m, &v);
 
    for (int i = 1; i <= m; i++) {
        int a, b;
        scanf("%d %d", &a, &b);
 
        adj[a][b] = 1;
        adj[b][a] = 1;
    }
 
    chk1[v] = 1;
    DFS(v);
 
    printf("\n");
    
    chk2[v] = 1;
    BFS(v);
}
 
void DFS(int v) {
    printf("%d ", v);
 
    for (int i = 1; i <= n; i++) {
        if (adj[v][i] == 1 && chk1[i]==0) {
            chk1[i] = 1;
            DFS(i);
        }
    }
}
 
void BFS(int v) {
    printf("%d ", v);
    queue<int> q;
    q.push(v);
    
    while (q.empty() == false) {
        int node = q.front();
        q.pop();
        
        for (int i = 1; i <= n; i++) {
            if (adj[node][i] == 1 && chk2[i] == 0) {
                chk2[i] = 1;
                q.push(i);
        
                printf("%d ", i);
            }
        }
    }
}