Cod sursa(job #1610656)
| Utilizator | Data | 23 februarie 2016 17:59:05 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int x,y,a[5001][5001],viz[5001],i,n,m;
void dfs(int x)
{
int i;
g<<x<<" ";
viz[x]=1;
for(i=1;i<=n;i++)
if(!viz[i] and a[x][i]==1) dfs(i);
}
int main()
{
f>>n>>m;
while(m)
{
f>>x>>y;
a[x][y]=1;
m--;
}
for(i=1;i<=n;i++)
if(!viz[i]) dfs(i);
return 0;
}
