UVA - 10305 Ordering Tasks(拓扑排序)
来源:互联网 发布:淘宝数据分析网站 编辑:程序博客网 时间:2024/06/07 19:47
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
对于拓扑排序,可以把他们的小于看成一条有向边,然后递归遍历。如果我们能找到环则不存在拓扑排序。借助于dfs,在访问完一个节点后可以把它加到当前排序好的首部。
AC
#include <algorithm>
#include <string>
#include <iostream>
#include <string.h>
#include<stdio.h>
#include<vector>
using namespace std;
#define maxn 1000
#define ll long long int
int vis[maxn],topo[maxn],pos,n,m,G[maxn][maxn];
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[pos--]=u;
return 1;
}
bool toposort()
{
pos=n;
memset(vis,0,sizeof(vis));
for(int u=1;u<=n;u++)
{
if(!vis[u])
{
if(!dfs(u)) return false;
}
}
return true;
}
int main()
{
while(scanf("%d%d",&n,&m)==2&&n)
{
int st,ed;
pos=n;
memset(G,0,sizeof(G));
memset(vis,0,sizeof(vis));
for(int i=0;i<m;i++)
{
scanf("%d%d",&st,&ed);
G[st][ed]=1;
}
toposort();
for(int i=pos+1;i<=n;i++)
{
if(i!=pos+1) printf(" ");
printf("%d",topo[i]);
}
printf("\n");
}
return 0;
}
#include <string>
#include <iostream>
#include <string.h>
#include<stdio.h>
#include<vector>
using namespace std;
#define maxn 1000
#define ll long long int
int vis[maxn],topo[maxn],pos,n,m,G[maxn][maxn];
{
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[pos--]=u;
return 1;
}
{
pos=n;
memset(vis,0,sizeof(vis));
for(int u=1;u<=n;u++)
{
if(!vis[u])
{
if(!dfs(u)) return false;
}
}
return true;
}
int main()
{
while(scanf("%d%d",&n,&m)==2&&n)
{
int st,ed;
pos=n;
memset(G,0,sizeof(G));
memset(vis,0,sizeof(vis));
for(int i=0;i<m;i++)
{
scanf("%d%d",&st,&ed);
G[st][ed]=1;
}
toposort();
for(int i=pos+1;i<=n;i++)
{
if(i!=pos+1) printf(" ");
printf("%d",topo[i]);
}
printf("\n");
return 0;
}
0 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 (拓扑排序)
- Ordering Tasks - UVa 10305 拓扑排序
- Uva 10305 Ordering Tasks(拓扑排序)
- Ordering Tasks From: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【拓扑排序】
- HDU 1272 小希的迷宫
- UML类图关系
- 第四周 项目1(2)
- inno setup判断软件是否安装过
- ROS学习(二)server和client的编写总结
- UVA - 10305 Ordering Tasks(拓扑排序)
- GitHub 的协同开发
- 初识mybatis
- 网络流24题之十三 星际转移 分层图网络流
- 项目中 登录注册逻辑判断
- 生成唯一id号解决方法
- 第5周项目1:三角形类雏形(4)
- Android中常见的异常
- 第五周项目二------游戏角色