[Programmers] (깊이/너비 우선 탐색(DFS/BFS)) Lv 3. 네트워크

https://school.programmers.co.kr/learn/courses/30/lessons/43162

프로그래머스

 

cpp

닫기 줄바꿈

#include <string>
#include <vector>

using namespace std;

vector<bool> visited;

void dfs(int here, const vector<vector<int>>& computers)
{
​​​​visited[here] = true;
​​​​
​​​​for (int i = 0; i < computers.size(); ++i)
​​​​{
​​​​​​​​if (!visited[i] && computers[here][i])
​​​​​​​​​​​​dfs(i, computers);
​​​​}
}

int solution(int n, vector<vector<int>> computers) {
​​​​//24.10.23
​​​​int answer = 0;
​​​​visited.resize(n);

​​​​for (int i = 0; i < n; ++i)
​​​​{
​​​​​​​​if (!visited[i])
​​​​​​​​{
​​​​​​​​​​​​dfs(i, computers);
​​​​​​​​​​​​++answer;
​​​​​​​​}
​​​​}
​​​​return answer;
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/commit/784cca56961173c48cd7ccafb6ebbd0553f2344a

[level 3] Title: 네트워크, Time: 0.07 ms, Memory: 4.2 MB -BaekjoonHub · developeSHG/Algorithm-Baekjoon_Programmers@784cca5