Cod sursa(job #2369719)
Utilizator | Data | 6 martie 2019 08:57:21 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f ("sortaret.in");
ofstream g ("sortaret.out");
const int nmax=5e4+3;
int viz[nmax],st[nmax],k,n,m,a,b;
vector <int> v[nmax];
void dfs(int nod)
{
viz[nod]=1;
for(int i=0;i<v[nod].size();++i)
{
int urm=v[nod][i];
if(!viz[urm]) dfs(urm);
}
st[++k]=nod;
}
int main()
{
ios::sync_with_stdio(false);
f>>n>>m;
while(m--)
{
f>>a>>b;
v[a].push_back(b);
}
for(int i=1;i<=n;++i) if(!viz[i]) dfs(i);
for(int i=n;i>=1;--i) g<<st[i]<<' ';
return 0;
}