46-Course Schedule

题目地址：Course Schedule
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, is it possible for you to finish all courses?
Example 1:
Input: 2, [[1,0]]
Output: true
Explanation: There are a total of 2 courses to take.
To take course 1 you should have finished course 0. So it is possible.
Example 2:
Input: 2, [[1,0],[0,1]]
Output: false
Explanation: There are a total of 2 courses to take.
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.
大意：给一个科目总数和科目集合，科目之间有先后顺序，求科目的合理性。
------------------------------------------------------------------答案借鉴于此--------------------------------------------------------------

import java.util.ArrayList;
import java.util.LinkedList;

public class CourseSchedule1 {
    public static void main(String[] args) {
        int[][] pres = {{0, 2}, {2, 1}, {1, 3}};
        boolean flag = canFinishBFS(4, pres);
        boolean flag1 = canFinishDFS(4, pres);
        System.out.println(flag);
        System.out.println(flag1);
    }

    public static boolean canFinishDFS(int numCourses, int[][] pres) {
        ArrayList[] graph = new ArrayList[numCourses];
        //初始化图
        for (int i = 0; i < numCourses; i++) {
            graph[i] = new ArrayList();
        }
        boolean[] visited = new boolean[numCourses];
        for (int i = 0; i < pres.length; i++) {
            graph[pres[i][1]].add(pres[i][0]);
        }
        for (int i = 0; i < numCourses; i++) {
            if (!dfs(graph, visited, i)) return false;
        }
        return true;
    }

    private static boolean dfs(ArrayList[] graph, boolean[] visited, int course) {
        if (visited[course])
            return false;
        visited[course] = true;
        for (int i = 0; i < graph[course].size(); i++) {
            if (!dfs(graph, visited, (int) graph[course].get(i))) return false;
        }
        visited[course] = false;
        return true;
    }

    //BFS
    public static boolean canFinishBFS(int numCourses, int[][] prerequisites) {
        int count = 0;
        ArrayList[] graph = new ArrayList[numCourses];
        int[] disgree = new int[numCourses];
        LinkedList queue = new LinkedList();
        //初始化图
        for (int i = 0; i < numCourses; i++) {
            graph[i] = new ArrayList();
        }
        //根据边进行图赋值，并计算入度
        for (int i = 0; i < prerequisites.length; i++) {
            graph[prerequisites[i][0]].add(prerequisites[i][1]);
            disgree[prerequisites[i][1]]++;
        }
        //找出图的入口
        for (int i = 0; i < disgree.length; i++) {
            if (disgree[i] == 0) {
                queue.add(i);
                count++;
            }
        }
        //使用BFS遍历图
        while (!queue.isEmpty()) {
            int course = (int) queue.poll();
            for (int i = 0; i < graph[course].size(); i++) {
                int pointer = (int) graph[course].get(i);
                disgree[pointer]--;
                if (disgree[pointer] == 0) {
                    queue.add(pointer);
                    count++;
                }
            }
        }
        System.out.println(count);
        return count == numCourses;
    }
}