UVA 10305 拓扑排序(基础)
来源:互联网 发布:mac teamviewer官网 编辑:程序博客网 时间:2024/05/24 02:22
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 ≤ 100 and 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 with n = 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
书上167的例题。。。不过我貌似没有按照上面的敲(然后书上考虑的比较周全)
- UVA 10305 拓扑排序(基础)
- Uva 10305 拓扑排序
- UVA 10305 拓扑排序
- uva 10305 拓扑排序
- uva 10305 拓扑排序
- uva 10305 拓扑排序
- 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 10305 Ordering Tasks(拓扑排序)
- uva 10305 基本拓扑排序
- uva 10305 简单拓扑排序
- UVA 10305 拓扑排序 删边法
- Fresco之客户端与服务端的交互
- 北大百练+简单递归回溯+就是那个变量类型弄错了,才搞错的额
- PHP数组基础知识总结以及排序
- 计算复杂性学习1-单带图灵机模拟
- Fresco.initializeDrawee()的过程
- UVA 10305 拓扑排序(基础)
- 吴敬琏:中国经济改革为何出现开倒车现象--From凤凰财经20160430
- PipelineDraweeControllerBuilder.obtainController()源码分析
- 如何利用XAMPP本地建站的环境配置教程(详细的图文介绍)
- 生成排列
- SSH——mysql不能插入当前时间
- 1007. 素数对猜想 (20)
- Js中实现网页上导航条的切换功能
- c++ 智能指针用法详解