[백준] 1260 - DFS와 BFS(설명X)

#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
 
void dfs(bool** arr, bool* visited, int size, int start) {
    printf("%d ", start);
    visited[start] = true;
    for (int i = 1; i <= size; i++) {
        if (arr[start][i] == true && !visited[i])
            dfs(arr, visited, size, i);
    }
}
 
void bfs(bool** arr, bool* visited, int size, int start) {
    visited[start] = true;
    queue<int> order;
    order.push(start);
    while (order.size() > 0) {
        int pos = order.front();
        order.pop();
        printf("%d ", pos);
        
        for (int i = 1; i <= size; i++) {
            if (arr[pos][i] == true && !visited[i]) {
                order.push(i);
                visited[i] = true;
            }
        }
    }
}
 
int main() {
    int N, M, V;
    scanf("%d %d %d", &N, &M, &V);
    bool** arr = new bool* [N + 1];
    for (int i = 1; i <= N; i++)
        arr[i] = new bool[N + 1]{ false, };
    bool* isTrue = new bool[N + 1]{ false, };
    for (int i = 0; i < M; i++) {
        int edge1, edge2;
        scanf("%d %d", &edge1, &edge2);
        arr[edge1][edge2] = true;
        arr[edge2][edge1] = true;
    }
    dfs(arr, isTrue, N, V);
    printf("\n");
    memset(isTrue, false, sizeof(bool) * (N + 1));
    bfs(arr, isTrue, N, V);
}