[Baekjoon] [1766] 위상정렬 골드2 - 문제집

https://www.acmicpc.net/problem/1766

1766번: 문제집

const fs = require('fs');
const input = fs.readFileSync('/dev/stdin').toString().trim().split("\n");

const [N, M] = input.shift().split(" ").map(n => Number(n));
const graph = new Array(N+1).fill(0).map(i => []);
const indegree = new Array(N+1).fill(0);

for(let i = 0 ; i < M ; i++) {
    const [to, from] = input[i].split(' ').map(n => Number(n));
    graph[to].push(from);
    indegree[from]++;
}

const tOrder = [];
const queue = [];

for(let i = 1; i < graph.length ; i ++) {
    if(indegree[i] === 0) {
        queue.push(i);
        break;
    }
}

while(queue.length) {
    const node = queue.shift();
    indegree[node] = -1;

    const targetNode = graph[node];
    targetNode.forEach((i) => {
       indegree[i]--;
    });
    tOrder.push(node);

    for(let i = 1; i < graph.length ; i ++) {
        if(indegree[i] === 0) {
            queue.push(i);
            break;
        }
    }
}

console.log(tOrder.join(" "))