Cod sursa(job #1499445)
| Utilizator | Data | 10 octombrie 2015 17:20:06 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include<vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector<int> v[50001];
int n,m,x,y,i, a[50001],viz[50001],k;
void df(int x){
viz[x]=1;
for(int i=0;i<v[x].size();i++)
if(viz[v[x][i]]==0)
df(v[x][i]);
a[++k]=x;
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++){
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(i=1;i<=n;i++)
if(viz[i]==0)
df(i);
for(i=k;i>=1;i--)
g<<a[i]<<" ";
return 0;
}
