백준 1260번 C++ 배열 사용

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

1260번: DFS와 BFS

 

#include <iostream>
#include <queue>
#include <string.h>
using namespace std;

int N,M,V;
int arr[1001][1001];
int visit[1001] = {0};

void DFS(int v)
{
    visit[v] = 1;
    cout<<v<<' ';
    for(int i = 0; i<N+1 ; i++)
    if(arr[v][i] && visit[i]==0)
        DFS(i);
}

void BFS(int v)
{
    queue<int> q;
    q.push(v);
    visit[v] = 1;
    while(!q.empty()){
        v = q.front();
        q.pop();
        cout<<v<<' ';
        for(int i = 0; i<N+1 ; i++){
        if(arr[v][i]==1 && visit[i]==0){
            visit[i] = 1;
            q.push(i);
        }
        }
    }
}
int main()
{   
    int j,k;
    cin>>N>>M>>V;
    for(int i = 0; i<M ; i++){
        cin>>j>>k;
        arr[j][k]=1;
        arr[k][j]=1;
    }
    DFS(V);
    cout<<endl;
    memset(visit,0,sizeof(visit));
    BFS(V);
    cout << endl;
}

설명 나중에 올려야징