Link11724번 - 연결 요소의 개수 문제풀이(1) 재귀 구현let input = require("fs").readFileSync("/dev/stdin").toString().trim().split("\n");let idx = 0;const [N, M] = input[idx++].split(" ").map(Number);const graph = Array.from({ length: N + 1 }, () => []);const visited = Array.from({ length: N + 1 }, () => false);let answer = 0;for (let m = 0; m { visited[node] = true; for (let g of graph[node]) { if (visited..