题目描述
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?
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 it is possible.
2, [[1,0],[0,1]]
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.
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.
click to show more hints.
题目分析
经典拓扑排序问题
算法描述
https://en.wikipedia.org/wiki/Topological_sorting#Algorithms
的Kahn’s algorithm
具体实现
class Solution {
public:
bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) {
vector<vector <int>> adj(numCourses);
vector<int> inDegree(numCourses, 0);
//vector<int> L; // Empty list that will contain the sorted elements
vector<int> S; // Set of all nodes with no incoming edge
// initialize
for (auto pre : prerequisites) {
inDegree[pre.second]++;
adj[pre.first].push_back(pre.second);
}
for (int i = 0; i < adj.size(); i++)
//L.push_back(i);
if (inDegree[i] == 0)
S.push_back(i);
// Kahn's algorithm
while (!S.empty()) {
int node = S[0];
S.erase(S.begin());
//L.push_back(node);
for (int i = 0; i < adj[node].size(); i++) {
int m = adj[node][i];
inDegree[m]--;
if (inDegree[m] == 0)
S.push_back(m);
}
adj[node].clear();
}
for (int i = 0; i < adj.size(); i++)
if (adj[i].size() != 0)
return false;
return true;
}
};