Cod sursa(job #2445862)
Utilizator | Anghel Florin zxcsd12309 | Data | 5 august 2019 19:42:32 |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<int> v[50000];
bool viz[50000];
stack <int> s;
void DFS(int nod)
{
for(auto it : v[nod])
if(!viz[it]){
viz[it] = 1;
DFS(it);
}
s.push(nod);
}
int main()
{
int n; int m;
int x; int y;
fin>>n>>m;
for(int i = 1; i <= m; i++)
{
fin>>x>>y;
v[x].push_back(y);
}
for(int i=1;i<=n;i++)
{
if(viz[i]==0)
{
DFS(i);
}
}
while(s.size()!=0)
{
fout<<s.top() <<' ';
s.pop();
}
return 0;
}