题目:课程表
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.
- This problem is equivalent to finding if a cycle exists in a directed graph. If a cycle exists, no topological ordering exists and therefore it will be impossible to take all courses.
- Topological Sort via DFS - A great video tutorial (21 minutes) on Coursera explaining the basic concepts of Topological Sort.
- Topological sort could also be done via BFS.
题意:
总共有标记为0到n-1的n门课程需要你选择。
有些课程可能需要一些先决条件,例如,要想选课程0,你就必须要先选课程1,使用一个键值对[0, 1]表示这样的情况。
给定课程的总数和一些先决条件键值对,对你来说可能完成所有的课程吗?
Note:
输入的先决条件键值对是用一个图的边表示的,而不是使用邻接矩阵。阅读更多关于如何表示一个图。
Hints:
1、这个问题等效于找到有向图中是否有循环存在。如果存在一个循环,不存在拓扑排序,因此不可能将所有的可能学习完。
2、通过DFS实现拓扑排序,在Coursera上有一个21分钟左右的很好的视频教程,讲述了拓扑排序的基本概念。
3、拓扑排序也可以通过BFS实现。
转载:http://www.cnblogs.com/grandyang/p/4484571.html
思路一:
使用BFS实现,定义二维数组graph来表示这个有向图,一维数组in来表示每个顶点的入度。我们开始先根据输入来建立这个有向图,并将入度数组也初始化好。然后我们定义一个queue变量,将所有入度为0的点放入队列中,然后开始遍历队列,从graph里遍历其连接的点,每到达一个新节点,将其入度减一,如果此时该点入度为0,则放入队列末尾。直到遍历完队列中所有的值,若此时还有节点的入度不为0,则说明环存在,返回false,反之则返回true.
代码:C++版:24ms
class Solution { public: bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) { vector<vector<int>> graph(numCourses, vector<int>(0)); //存储有向图 vector<int> in(numCourses, 0); //表示每个顶点的入度 for (auto a : prerequisites) { //初始化有向图以及每个顶点的入度 graph[a.second].push_back(a.first); ++in[a.first]; } queue<int> q; //将所有入度为0的点放入队列中 for (int i = 0; i < numCourses; ++i) { if (in[i] == 0) q.push(i); } while (!q.empty()) { int t = q.front(); q.pop(); for (auto a : graph[t]) { --in[a]; if (in[a] == 0) q.push(a); } } for (int i = 0; i < numCourses; ++i) { if (in[i] != 0) return false; } return true; } };
思路二:
DFS的解法,也需要建立有向图,还是用二维数组来建立,和BFS不同的是,我们像现在需要一个一维数组visit来记录访问状态,大体思路是,先建立好有向图,然后从第一个门课开始,找其可构成哪门课,暂时将当前课程标记为已访问,然后对新得到的课程调用DFS递归,直到出现新的课程已经访问过了,则返回false,没有冲突的话返回true,然后把标记为已访问的课程改为未访问。
代码:C++版:24ms
class Solution { public: bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) { vector<vector<int> > graph(numCourses, vector<int>(0)); //存储有向图 vector<int> visit(numCourses, 0); //记录访问状态 for (auto a : prerequisites) { //初始化有向图 graph[a.second].push_back(a.first); } for (int i = 0; i < numCourses; ++i) { if (!canFinishDFS(graph, visit, i)) return false; } return true; } bool canFinishDFS(vector<vector<int> > &graph, vector<int> &visit, int i) { if (visit[i] == -1) return false; if (visit[i] == 1) return true; visit[i] = -1; for (auto a : graph[i]) { if (!canFinishDFS(graph, visit, a)) return false; } visit[i] = 1; return true; } };