Network Dfs

📌 Source Code: graph/prg2-network-dfs.js

function dfs(computers, visited, node) {
  visited[node] = true;

  for (let idx = 0; idx < computers.length; idx++) {
    if (computers[node][idx] && !visited[idx]) {
      dfs(computers, visited, idx);
    }
  }
}

function solution(n, computers) {
  let visited = Array(n).fill(false);
  let answer = 0;

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

  return answer;
}

console.log("result : ", solution());