Cod sursa(job #1882457)
Utilizator | Data | 17 februarie 2017 11:08:40 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
struct nod{int inf;nod*leg;}*v[50003];
bool viz[50003];
int n,m;
inline void add(int x,int y)
{nod*nou;
nou=new nod;
nou->inf=x;
nou->leg=v[y];
v[y]=nou;
}
inline void dfs(int x)
{ nod*p;
viz[x]=1;
for(p=v[x];p;p=p->leg)
if(viz[p->inf]==0)dfs(p->inf);
g<<x<<" ";
}
int main()
{ f>>n>>m;
int x,y,i;
for(i=1;i<=m;i++)
{f>>x>>y;add(x,y);}
for(i=1;i<=n;i++)
if(viz[i]==0)dfs(i);
}