207. Course Schedule 图的dfs算法
2016-04-03 14:32
225 查看
There are a total of n courses you have to take, labeled from
Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair:
Given the total number of courses and a list of prerequisite pairs, is it possible for you to finish all courses?
For example:
There are a total of 2 courses to take. To take course 1 you should have finished course 0. So it is possible.
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.
click to show more hints.
Subscribe to see which companies asked this question
分析;
问题的实质是有向图判环,若存在曾经被访问过的node,则存在环。每个节点有三个状态0(白色,未访问),1(灰色,正在访问),2(黑色,访问结束)。对于无向图还需多一条当前曾被访问过的节点不是当前节点的父亲的判断。
整个算法需要先构建邻接矩阵。所以比较快。需要注意的是状态向量需要实时更新,因此在dfs中是被引用的存在。
代码:
class Solution {
public:
void dfs(int t,vector<int>& visit,vector<vector<int>>& graph,bool& index){
if(visit[t]==1) {index=true;return;}
visit[t]=1;
for(int i=0;i<graph[t].size();++i)
{
dfs(graph[t][i],visit,graph,index);
if(index)
return ;
}
visit[t]=2;
}
bool canFinish(int numCourses, vector<pair<int, int>>& pre) {
vector<vector<int>> graph(numCourses);
for(int i=0;i<pre.size();++i)
graph[pre[i].first].push_back(pre[i].second);
vector<int> visit(numCourses,0);
bool index=false;
for(int i=0;i<numCourses;++i)
{
if(index) return false;
if(visit[i]==0) dfs(i,visit,graph,index);
}
return true;
}
};
0to
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.
click to show more hints.
Subscribe to see which companies asked this question
分析;
问题的实质是有向图判环,若存在曾经被访问过的node,则存在环。每个节点有三个状态0(白色,未访问),1(灰色,正在访问),2(黑色,访问结束)。对于无向图还需多一条当前曾被访问过的节点不是当前节点的父亲的判断。
整个算法需要先构建邻接矩阵。所以比较快。需要注意的是状态向量需要实时更新,因此在dfs中是被引用的存在。
代码:
class Solution {
public:
void dfs(int t,vector<int>& visit,vector<vector<int>>& graph,bool& index){
if(visit[t]==1) {index=true;return;}
visit[t]=1;
for(int i=0;i<graph[t].size();++i)
{
dfs(graph[t][i],visit,graph,index);
if(index)
return ;
}
visit[t]=2;
}
bool canFinish(int numCourses, vector<pair<int, int>>& pre) {
vector<vector<int>> graph(numCourses);
for(int i=0;i<pre.size();++i)
graph[pre[i].first].push_back(pre[i].second);
vector<int> visit(numCourses,0);
bool index=false;
for(int i=0;i<numCourses;++i)
{
if(index) return false;
if(visit[i]==0) dfs(i,visit,graph,index);
}
return true;
}
};
相关文章推荐
- Win2003利用dfs(分布式文件系统)在负载均衡下的文件同步配置方案
- win2003分布式文件系统(dfs)配置方法[图文详解]
- win2003分布式文件系统及其部署 图文教程
- Hadoop2.6+jdk8的安装部署(1)——使用jar包安装部署【详细】
- Hadoop FS Shell
- DFS使用方法总结
- FastDFS注意事项
- 无忧技术带您预览DFS(分布式文件系统)管理控制台
- C 语言实现迷宫 DFS算法
- 一幅图弄清DFT与DTFT,DFS的关系
- HDFS---Namenode
- HDFS ---- Services startup
- POJ1523 SPF dfs
- poj1731 Orders dfs
- Surrounded Regions
- Binary Tree Zigzag Level Order Traversal,Restore IP Addresses,Word Search,Simplify Path
- DFS基础(1)
- HDU1241 Oil Deposits
- DFS算法有趣小题目
- ZOJ Problem Set - 1711 解题报告