uva 10305 - Ordering Tasks
来源:互联网 发布:mac美国官网价格 编辑:程序博客网 时间:2024/05/16 12:42
John has n tasks to do. Unfortunately, the tasks are not independent and the execution of one task is only possible if other tasks have already been executed.
Input
The input will consist of several instances of the problem. Each instance begins with a line containing two integers, 1 <= n <= 100and m. n is the number of tasks (numbered from 1 to n) and m is the number of direct precedence relations between tasks. After this, there will be m lines with two integers i and j, representing the fact that task i must be executed before task j. An instance withn = m = 0 will finish the input.
Output
For each instance, print a line with n integers representing the tasks in a possible order of execution.
Sample Input
5 4
1 2
2 3
1 3
1 5
0 0
Sample Output
1 4 2 5 3
纯拓扑排序,我按着刘汝佳那个写的,哈哈学习了。
#include<stdio.h>#include<stdlib.h>#include<string.h>#define maxn 105int topo[maxn],c[maxn],G[maxn][maxn],n,t;bool dfs(int u){ c[u]=-1; //-1表示正在访问中 for(int v=1;v<=n;v++)if(G[u][v])//查看是否存在关系 { if(c[v]<0)return false; if(!c[v]&&!dfs(v))return false; } c[u]=1;topo[--t]=u;//处理 return true;}bool toposort(){ t=n; memset(c,0,sizeof(c));//初始化,0代表还未被访问 for(int i=1;i<=n;i++) if(!c[i]&&!dfs(i))return false; return true; }int main(){ int m,u,v; while(scanf("%d%d",&n,&m)==2&&(m||n)){ memset(G,0,sizeof(G)); for(int i=1;i<=m;i++){ scanf("%d%d",&u,&v); G[u][v]=1; } if(toposort()){//是否存在这样的拓扑排序,主要看有无有向环 for(int i=0;i<n-1;i++)printf("%d ",topo[i]); printf("%d\n",topo[n-1]); } } return 0;}
- uva 10305 - Ordering Tasks
- uva 10305 - Ordering Tasks
- uva 10305 - Ordering Tasks
- UVa 10305 - Ordering Tasks
- uva-10305 - Ordering Tasks
- UVa 10305 - Ordering Tasks
- UVa 10305 - Ordering Tasks
- UVA 10305 Ordering Tasks
- UVa 10305Ordering Tasks
- Uva 10305 - Ordering Tasks
- uva 10305Ordering Tasks
- uva 10305 - Ordering Tasks
- uva 10305 Ordering Tasks
- UVa 10305 - Ordering Tasks
- UVA 10305 - Ordering Tasks
- Ordering Tasks UVA 10305
- UVA - 10305 Ordering Tasks
- UVA - 10305 Ordering Tasks
- Android事务 IMMEDIATE与EXCLUSIVE模式
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions(素数筛的简单应用)
- rails 中的respond_to 对不同的文件要求给予相应
- 获取 Linux命令源代码
- 短小精悍的线性时间素数筛法(转)
- uva 10305 - Ordering Tasks
- dl.google.com,dl-ssl.google.com连不上的解决办法
- UVa350 Pseudo-Random Numbers
- 链接对网站自身权重的影响
- POJ 1861 Network(Kruskal)
- HDOJ 1004 Water~
- 结合实例谈SqlParameters的使用
- Android自定义扁平化对话框
- HDU 1102 Constructing Roads(prim)