# 1. Topological Sort

There are a total of `numCourses` courses you have to take, labeled from `0` to `numCourses - 1`. You are given an array `prerequisites` where `prerequisites[i] = [ai, bi]` indicates that you **must** take course `bi` first if you want to take course `ai`.

* For example, the pair `[0, 1]`, indicates that to take course `0` you have to first take course `1`.

Return `true` if you can finish all courses. Otherwise, return `false`.

**Example 1:**

<pre><code><strong>Input: numCourses = 2, prerequisites = [[1,0]]
</strong><strong>Output: true
</strong><strong>Explanation: There are a total of 2 courses to take. 
</strong>To take course 1 you should have finished course 0. So it is possible.
</code></pre>

**Example 2:**

<pre><code><strong>Input: numCourses = 2, prerequisites = [[1,0],[0,1]]
</strong><strong>Output: false
</strong><strong>Explanation: There are a total of 2 courses to take. 
</strong>To take course 1 you should have finished course 0, and to take course 0 you should also have finished course 1. So it is impossible.
</code></pre>

**Constraints:**

* `1 <= numCourses <= 2000`
* `0 <= prerequisites.length <= 5000`
* `prerequisites[i].length == 2`
* `0 <= ai, bi < numCourses`
* All the pairs prerequisites\[i] are **unique**.

{% embed url="<https://leetcode.com/problems/course-schedule/>" %}

```javascript
/**
 * @param {number} numCourses
 * @param {number[][]} prerequisites
 * @return {boolean}
 */
var canFinish = function(numCourses, prerequisites) {
    const incommingEdges = new Array(numCourses).fill(0);
    const adjs = {};

    // create adjacent listx
    // couting num of edges incomming
    for (const [here, there] of prerequisites) {
        if (adjs[here] === undefined) adjs[here] = [];
        adjs[here].push(there);

        incommingEdges[there] += 1;
    }

    const q = [];
    // find vertexes incomming edges 0
    for (let i = 0; i < incommingEdges.length; i++) {
        if (incommingEdges[i] === 0) {
            q.push(i);
        }
    }

    // iterate queue until there is no vertex, whose the number of incomming edges is equal to zero
    const seq = [];
    while (q.length > 0) {
        const here = q.shift();
        seq.push(here);
        const adj = adjs[here] ?? [];

        // if (adj === undefined) continue;

        for (const there of adj) {
            incommingEdges[there] -= 1;
            if (incommingEdges[there] === 0) {
                q.push(there);
            }
        }
    }

    return seq.length === numCourses ? true : false;
    
}; 
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://algorithm.prettylog.com/algorithm-problems/daily-algorithms/1.-topological-sort.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.