拓扑--网络拓扑结构

207. Course Schedule

Medium

205295FavoriteShare

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.

class Solution {
public:
    bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) {
        vector<vector<int> > Graph(numCourses);
        queue<int> q;
        vector<int> InGrad(numCourses,0);
        for(int i = 0;i < prerequisites.size();i ++){
            Graph[prerequisites[i].second].push_back(prerequisites[i].first);
            InGrad[prerequisites[i].first]++;
        }
        for(int i = 0;i < InGrad.size();i ++){
            if(InGrad[i] == 0){
                q.push(i);
            }
        }
        while(!q.empty()){
            int temp = q.front();
            q.pop();
            for(int i = 0;i < Graph[temp].size();i ++){
                InGrad[Graph[temp][i]]--;
                if(InGrad[Graph[temp][i]] == 0){
                    q.push(Graph[temp][i]);
                }
            }
        }
        for(int i = 0;i < InGrad.size();i ++){
            if(InGrad[i] != 0){
                return false;
            }
        }
        return true;
    }
};

心得：当入度矩阵含有非零元素时，该图不能用拓扑的方式遍历每一个节点。