[백준] 2606번: 바이러스(DFS) - C++

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

2606번: 바이러스

---

 

#include <iostream>
#include <string>
using namespace std;
int N,T;
int map[101][101];
int visited[101];
int result = 0;

void reset()
{
    for(int i = 1; i<=N;i++)
    {
        visited[i]=0;
        for(int j = 1; j<=N;j++)
            map[i][j]=0;
    }
}

void DFS(int a)
{
    visited[a] = true;
    for(int i = 1;i<=N;i++)
    {
        if(map[a][i] == 1 && !visited[i])
        {
            visited[i] = true;
            DFS(i);
            result++;
        }
    }
}

int main()
{
    cin>>N;
    cin>>T;
    reset();
    
    for(int i = 0;i<T;i++)
    {
        int n1,n2;
        cin>>n1>>n2;
        
        map[n1][n2] = 1;
        map[n2][n1] = 1;
    }
    DFS(1);
    cout<<result;
}