拓扑排序

public int[] findOrder(int numCourses, int[][] prerequisites) {
        int[][] adjacent = new int[numCourses][numCourses];
        int[] indegree = new int[numCourses];

        for (int i = 0; i < prerequisites.length; i++) {
            int from = prerequisites[i][1];
            int to   = prerequisites[i][0];

            if (adjacent[from][to] == 0)
                indegree[to]++;

            adjacent[from][to] = 1;
        }

        int[] res = new int[numCourses];
        Queue<Integer> queue = new LinkedList<>();

        for (int i = 0; i < numCourses; i++) {
            if (indegree[i] == 0)
                queue.offer(i);
        }

        int visited = 0;
        while (!queue.isEmpty()) {
            int from = queue.poll();
            res[visited++] = from;

            for (int i = 0; i < numCourses; i++) {
                if (adjacent[from][i] != 0) {
                    if (--indegree[i] == 0) {
                        queue.offer(i);
                    }
                }
            }
        }

        return visited == numCourses ? res : new int[0];
    }