Cod sursa(job #2257576)
| Utilizator | Data | 10 octombrie 2018 10:46:48 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");
const int NMAX=50005;
int n,m,x,y,v[NMAX],nr;
bool viz[NMAX];
vector <int> G[NMAX];
void dfs (int nod)
{
viz[nod]=true;
for(int i=0;i<G[nod].size();i++)
if(!viz[G[nod][i]])
dfs(G[nod][i]);
v[++nr]=nod;
}
int main()
{
fin>>n>>m;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
G[x].push_back(y);
}
for(int i=1;i<=n;i++)
if(!viz[i])
dfs(i);
for(int i=n;i>=1;i--)
fout<<v[i]<<" ";
return 0;
}
