Cod sursa(job #1865631)
Utilizator | Data | 1 februarie 2017 21:25:34 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
int n,m,x,y;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
bool sol[50001];
int c[50001],nr=0;
vector <vector <int> >v(50001);
void dfs(int k)
{
int f=v[k].size();
sol[k]=1;
for(int i=0;i<f;i++)
if(sol[v[k][i]]==0)
dfs(v[k][i]);
c[++nr]=k;
}
int main()
{
in>>n;
in>>m;
for(int i=1;i<=m;i++)
{
in>>x>>y;
v[x].push_back(y);
}
for(int i=1;i<=n;i++)
if(sol[i]==0)
dfs(i);
for(int i=nr;i>=1;i--)
out<<c[i]<<" ";
}