Uva10305 - Ordering Tasks(拓扑排序经典例题)
2015-11-10 15:22
357 查看
AC代码:
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int map[110][110],vis[110];
int top[110];
int n,m,t;
bool dfs(int u)
{
vis[u]=-1;
for(int i=1;i<=n;i++)
{
if(map[u][i])
{
if(vis[i]<0) return false;
else if(!vis[i]&&!dfs(i)) return false;
}
}
vis[u]=1;
top[--t]=u;
return true;
}
bool solve()
{
t=n;
memset(vis,0,sizeof(vis));
for(int i=1;i<=n;i++)
{
if(!vis[i])
if(dfs(i)!=1)
return false;
}
return 1;
}
int main()
{
while(~scanf("%d%d",&n,&m))
{
memset(map,0,sizeof(map));
if(n==0&&m==0)
break;
int s,e;
for(int i=0;i<m;i++)
{
scanf("%d%d",&s,&e);
map[s][e]=1;
}
if(solve())
{
int flag=0;
for(int i=0;i<n;i++)
{
if(flag==0)
{
printf("%d",top[i]);
flag=1;
}
else printf(" %d",top[i]);
}
printf("\n");
}
}
}
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int map[110][110],vis[110];
int top[110];
int n,m,t;
bool dfs(int u)
{
vis[u]=-1;
for(int i=1;i<=n;i++)
{
if(map[u][i])
{
if(vis[i]<0) return false;
else if(!vis[i]&&!dfs(i)) return false;
}
}
vis[u]=1;
top[--t]=u;
return true;
}
bool solve()
{
t=n;
memset(vis,0,sizeof(vis));
for(int i=1;i<=n;i++)
{
if(!vis[i])
if(dfs(i)!=1)
return false;
}
return 1;
}
int main()
{
while(~scanf("%d%d",&n,&m))
{
memset(map,0,sizeof(map));
if(n==0&&m==0)
break;
int s,e;
for(int i=0;i<m;i++)
{
scanf("%d%d",&s,&e);
map[s][e]=1;
}
if(solve())
{
int flag=0;
for(int i=0;i<n;i++)
{
if(flag==0)
{
printf("%d",top[i]);
flag=1;
}
else printf(" %d",top[i]);
}
printf("\n");
}
}
}
相关文章推荐
- 1.10055 - Hashmat the brave warrior
- 2.10071 - Back to High School Physics
- 3.458 - The Decoder
- 4.694 - The Collatz Sequence
- 6.494 - Kindergarten Counting Game
- 7.490 - Rotating Sentences
- 8.414 - Machined Surfaces
- 9.488 - Triangle Wave
- A.457 - Linear Cellular Automata
- B.489 - Hangman Judge
- C.445 - Marvelous Mazes
- 1.10494 - If We Were a Child Again
- 2.424 - Integer Inquiry
- 3.10250 - The Other Two Trees
- 5.465 - Overflow
- 6.113 - Power of Cryptography
- 7.10161 - Ant on a Chessboard
- 8.621 - Secret Research
- 9.401 - Palindromes
- A.537 - Artificial Intelligence?