[프로그래머스 Lv.3] 깊이/너비 우선 탐색(DFS/BFS)- 네트워크

✨ 문제 ✨

✨ 정답 ✨

function solution(n, computers) {
    let graph=Array.from({length:n}, ()=>[])
    for (let i=0;i<n;i++){
        for (let j=0;j<n;j++){
            if (computers[i][j]===1){
            graph[i].push(j)
            }
        }
    }
    let visited=new Array(n).fill(false);
    let answer=0;
    for (let t=0;t<n;t++){
        if (visited[t]===false){
            answer++;
        }
        let next=graph[t];
        while(next.length){
            let current=next.shift();
            if (visited[current]===false){
                visited[current]=true;
                next=[...next, ...graph[current]]
            }
        }
    }
    return answer;
}

🧵 참고한 정답지 🧵

💡💡 기억해야 할 점 💡💡