[프로그래머스 3] 네트워크 (C/C++)

#include <string>
#include <vector>
using namespace std;
 
int visited[210] = {0};
 
void DFS(int start, vector<vector<int>> computers)
{
    visited[start] = 1;
    
    for(int i = 0; i < computers.size(); i++)
    {
        if(start == i)
        {
            continue;
        }
        
        if(visited[i] == 0 && computers[start][i] == 1)
        {
            visited[i] = 1;
            DFS(i, computers);
        }
    }  
}
 
int solution(int n, vector<vector<int>> computers) 
{
    int answer = 0;
    
    for(int i = 0; i < n; i++)
    {
        if(visited[i] == 1)
        {
            continue;
        }
        else
        {
            DFS(i, computers);
            answer++;
        }
    }
    
    return answer;
}