- 拓扑排序简介:
以上截图来自 leetcode。拓扑排序可用于判断有向图中是否有环。 - 题目:
- (1)深度优先搜索,遍历节点,每次把深度最大且未访问的节点 push_front 到 双端队列中。
class Solution {
private:
vector<vector<int>> graph;
vector<int> visit;
deque<int> deq;
bool flag = true;
void dfs(int v) {
visit[v] = 1;
for (int &u : graph[v]) {
if (visit[u]==0) {
dfs(u);
if (!flag) return;
} else if (visit[u]==1) {
flag = false;
return;
}
}
deq.push_front(v);
visit[v] = 2;
}
public:
vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {
graph.resize(numCourses);
visit.resize(numCourses);
for (auto &p : prerequisites) {
graph[p[1]].push_back(p[0]);
}
for (int i = 0; i < numCourses; ++i) {
if (visit[i] == 0) {
dfs(i);
if (!flag) return vector<int>();
}
}
vector<int> ans(deq.begin(), deq.end());
return ans;
}
};
- (2)广度优先搜索。基本思想:a. 将入度为 0 的节点 v 添加(push_back) 到 vector,并删除此节点;b. 删除图中所有以节点 v 为起点的边。c . 重复 步骤 a 和 b 。这样做,最后如果图中所有点都添加到了vector,那么就无环,否则有环。
class Solution {
private:
vector<vector<int>> graph;
vector<int> indes;
public:
vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {
graph.resize(numCourses);
indes.resize(numCourses);
for (auto &p : prerequisites) {
graph[p[1]].push_back(p[0]);
indes[p[0]]++;
}
queue<int> q;
for (int i = 0; i < numCourses; ++i) {
if (indes[i] == 0) {
q.push(i);
}
}
vector<int> ans;
while (!q.empty()) {
int t = q.front();
q.pop();
ans.push_back(t);
for (int &v : graph[t]) {
--indes[v];
if (indes[v] == 0) q.push(v);
}
}
return ans.size() == numCourses ? ans : vector<int>();
}
};