![]() | 10305-Ordering Tasks | 10119 |
46.70%
| 3784 |
91.94%
|
题目:
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 <= 100andm.nis the number of tasks (numbered from1ton) andmis the number of direct precedence relations between tasks. After this, there will bemlines with two integersiandj, representing the fact that taskimust be executed before taskj. An instance withn = m = 0will finish the input.
Output
For each instance, print a line withnintegers 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
拓扑排序的定义:对一个有向无环图(Directed Acyclic Graph简称DAG)G进行拓扑排序,是将G中所有顶点排成一个线性序列,使得图中任意一对顶点u和v,若<u,v> ∈E(G),则u在线性序列中出现在v之前。
以上的定义比较“学术“,简单的说,就是一些事件,某些必须在另外某些发生之前; 比如穿袜和穿鞋;再比如大学选课,选修某门课的前提必须先修完其他一些相关连的课程才可以。
所以,拓扑排序在现实生活中有着十分广泛的应用。
一般的题目可能会给一些事件,和一些发生次序,来求一个拓扑排序;
b)当栈非空时:
输出栈顶元素v,出栈;
检查v的出边,将每条出边的终端顶点的入度减1,若该顶点入度为0,入栈;
c)当栈空时,若输出的顶点小于顶点数,则说明AOV网有回路,否则拓扑排序完成。
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int G[110][110],n,m,a,b;
int vis[110],c[110], topo[110], cnt[110];
void topoSort(){
int count=0;
while(count < n){
for(int i=1; i<=n; ++i) if(!cnt[i]){ // 如果是入度为0的
--cnt[i];
topo[count++] = i;
for(int j=1; j<=n; ++j){
if(i!=j && G[i][j]){
G[i][j] = 0;
--cnt[j];
}
}
}
}
}
int main(){
#ifdef LOCAL
freopen("input.txt","r",stdin);
#endif
while(~scanf("%d %d",&n,&m) && n+m){
memset(G, 0, sizeof(G));
memset(cnt, 0, sizeof(cnt));
for(int i=0; i<m; ++i){
scanf("%d %d",&a,&b);
G[a][b] = 1;
++cnt[b]; // 记录入度数量
}
if(topoSort()) {
printf("%d",topo[0]);
for(int i=1; i<n; ++i)
printf(" %d",topo[i]);
printf("\n");
}
}
return 0;
}
然后根据结束时间从大到小排序即可。这种方法时间效率更高,更推荐。
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int G[110][110],n,m,a,b;
int vis[110],c[110], topo[110], t;
bool dfs(int u){
vis[u] = -1; //表示正在访问
for(int v=1; v<=n; ++v) if(G[u][v]){
if(vis[v] == -1) return false; // 如果存在有向环,失败退出
else if(!vis[v] && !dfs(v)) return false;
}
// 结束访问
vis[u] = 1; topo[--t] = u;
return true;
}
bool topoSort(){
t = n;
memset(vis, 0, sizeof(vis));
for(int u=1; u<=n; ++u)
if(!vis[u] && !dfs(u)) return false;
return true;
}
int main(){
#ifdef LOCAL
freopen("input.txt","r",stdin);
#endif
// 注意输入那里的结束条件不能是 n&&m,因为m可能是0
while(~scanf("%d %d",&n,&m) && n+m){
memset(G, 0, sizeof(G));
for(int i=0; i<m; ++i){
scanf("%d %d",&a,&b);
G[a][b] = 1;
}
if(topoSort()) {
printf("%d",topo[0]);
for(int i=1; i<n; ++i)
printf(" %d",topo[i]);
printf("\n");
}
}
return 0;
}