解法一:dfs回溯法
dfs解拓扑排序在无环情况下很方便,反向存边然后dfs即可。但要判断有没有环时,需要用回溯的思路:对每个点dfs,若无环,回溯时将这个点视为安全。具体操作时,存一个flag,dfs进入时让它为1,结束安全了变成-1.
class Solution {
map<int, vector<int>> m;
map<int, int> F;
public:
int dfs(int n)
{
if(F[n] == -1)return true;
if(F[n] == 1)return false;
F[n] = 1;
for(auto node: m[n])
{
int ok = dfs(node);
if(!ok)return 0;
}
F[n] = -1;
return 1;
}
bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
for(int i=0;i<prerequisites.size();i++)
{
int a = prerequisites[i][0], b = prerequisites[i][1];
m[a].push_back(b);
}
for(int i=0;i<numCourses;i++)
{
int ok = dfs(i);
if(!ok)return false;
}
return true;
}
};
解法二:bfs
记录每个点的入度,每次选取入度为0的,就可以直接选取。选取后把指向的元素入度-1即可。如果没选完,但是入度没有为0的点了,说明存在环(可以思考一下)。
class Solution {
map<int, vector<int>> m;
public:
bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
int n = numCourses;
int indegrees[n];
memset(indegrees, 0, sizeof(indegrees));
for(int i=0;i<prerequisites.size();i++)
{
int a = prerequisites[i][0], b = prerequisites[i][1];
indegrees[a] += 1;
m[b].push_back(a);
}
queue<int> zeros;
int remains = n;
for(int i=0;i<n;i++)
{
if(indegrees[i] == 0)zeros.push(i);
}
while(!zeros.empty() && remains > 0)
{
int a = zeros.front();
zeros.pop();
remains--;
for(int i=0;i<m[a].size();i++)
{
indegrees[m[a][i]]--;
if(indegrees[m[a][i]] == 0)zeros.push(m[a][i]);
}
}
if(remains > 0)return false;
else return true;
}
};