There are a total of *n* courses you have to take, labeled from `0`

to `n - 1`

.

Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair: `[0,1]`

Given the total number of courses and a list of prerequisite **pairs**, return the ordering of courses you should take to finish all courses.

There may be multiple correct orders, you just need to return one of them. If it is impossible to finish all courses, return an empty array.

For example:

2, [[1,0]]

There are a total of 2 courses to take. To take course 1 you should have finished course 0. So the correct course order is `[0,1]`

4, [[1,0],[2,0],[3,1],[3,2]]

There are a total of 4 courses to take. To take course 3 you should have finished both courses 1 and 2. Both courses 1 and 2 should be taken after you finished course 0. So one correct course order is `[0,1,2,3]`

. Another correct ordering is`[0,2,1,3]`

.

**Note:**

- The input prerequisites is a graph represented by
**a list of edges**, not adjacency matrices. Read more about how a graph is represented. - You may assume that there are no duplicate edges in the input prerequisites.

**Hints:**

- This problem is equivalent to finding the topological order in a directed graph. If a cycle exists, no topological ordering exists and therefore it will be impossible to take all courses.
- Topological Sort via DFS - A great video tutorial (21 minutes) on Coursera explaining the basic concepts of Topological Sort.
- Topological sort could also be done via BFS.

在LeetCode Course Schedule的基础上，要求输出一种拓扑排序结果。

因为已经知道拓扑排序的Kahn解法，即BFS解法，那么输出一种拓扑排序的结果是很简单的事。在BFS的过程中，存储在队列中的点肯定都是入度为0的点，也就是这些课程可以在这一阶段完成，所以我们只需要在每轮BFS的时候，保存一下这一轮的节点就好了。

完整代码如下：

class Solution { public: vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) { vector<unordered_set<int>> pre(numCourses), next(numCourses); for (const auto& p : prerequisites) { pre[p.first].insert(p.second); next[p.second].insert(p.first); } vector<int> ans; queue<int> q; for (int i = 0; i < numCourses; ++i) { if (pre[i].empty())q.push(i); } int edges = prerequisites.size(); while (!q.empty()) { int n = q.size(); for (int i = 0; i < n; ++i) { int cur = q.front(); ans.push_back(cur); q.pop(); for (const auto& nxt : next[cur]) { pre[nxt].erase(cur); --edges; if (pre[nxt].empty())q.push(nxt); } } } if (edges > 0)return{}; else return ans; } };

本代码提交AC，用时23MS。