그래프_백준_DFS와 BFS_1260

구현

#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include<cstring>
using namespace std;
 
vector <int> a[1001];
bool check[1001];
 
void dfs(int x) {
    check[x] = true;
    printf("%d ", x);
    for (int i = 0; i < a[x].size(); i++) {
        int next = a[x][i];
        if (check[next] == false) {
            check[next] = true;
            dfs(next);
        }
    }
}
 
void bfs(int start) {
    memset(check, false, sizeof(check));
    queue <int> q;
    check[start] = true;
    q.push(start);
 
    while (!q.empty()) {
        int top = q.front();
        q.pop();
        printf("%d ", top);
 
        for (int i = 0; i < a[top].size(); i++) {
            int tmp = a[top][i];
            if (check[tmp] == false) {
                q.push(tmp);
                check[tmp] = true;
            }
        }
    }
}
 
int main() {
    int n, e, start;
    int u, v;
    scanf("%d %d %d", &n, &e, &start);
 
    for (int i = 1; i <= e; i++) {
        scanf("%d %d", &u, &v);
 
        a[u].push_back(v);
        a[v].push_back(u);
    }
 
    for (int i = 1; i <= n; i++) {
        sort(a[i].begin(), a[i].end());
    }
 
    dfs(start);
    printf("\n");
    bfs(start);
    printf("\n");
}