[BOJ] 1260번 BFS와 DFS

#include < iostream >
#include < vector >
#include < stack >
#include < queue >

using namespace std;

int n,m,v;

bool check[1001];
vector a[1001];

void dfs(int v){
    check[v] = true;
    cout<<v<<" ";

    for(int i=0;i<a[v].size();i++){
        int node = a[v][i];
        if(check[node] == false){
            check[node] = true;
            dfs(node);
        }
    }
}

void bfs(int v){
    memset(check,false,sizeof(check));
    queue q;
    q.push(v);
    check[v] = true;

    while(!q.empty()){
        int node = q.front();
        cout<<node<<" ";
        q.pop();

        for(int i=0;i<a[node].size();i++){
            int node2 = a[node][i];
            if(check[node2] == false){
                q.push(node2);
                check[node2] = true;
            }
        }

    }
}

int main()
{
    cin>>n>>m>>v;

    for(int i=0;i<m;i++){
        int x,y;
        cin>>x>>y;
        a[x].push_back(y);
        a[y].push_back(x);
    }
    for(int i=0;i<a[i].size();i++){
        sort(a[i].begin(),a[i].end());
    }

    dfs(v);
    cout<<'\n';
    bfs(v);


    return 0;
}

 

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

1260번: DFS와 BFS