Cod sursa(job #2704242)
| Utilizator | Data | 10 februarie 2021 08:27:56 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("sortaret.int");
ofstream cout("sortaret.out");
int n,m,vizitat[50001],solutie[50001],h;
vector <int> lista[50010];
void dfs(int x)
{
vizitat[x]=1;
for(int i : lista[x])
if(vizitat[i]==0)
dfs(i);
solutie[++h]=x;
}
int main()
{
cin>>n>>m;
for(int i=0;i<m;i++)
{
int x,y;
cin>>x>>y;
lista[x].push_back(y);
}
for(int i=1;i<=n;i++)
if(vizitat[i]==0)
dfs(i);
for(int i=n;i>=1;i--)
cout<<solutie[i]<<" ";
return 0;
}
