Cod sursa(job #1988506)
| Utilizator | Data | 3 iunie 2017 10:54:43 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fi("sortaret.in");
ofstream fo("sortaret.out");
int n,m;
vector<int> V[50001],S;
int VIZ[50001];
void dfs(int v)
{
VIZ[v]=1;
for(int i=0;i<V[v].size();i++)
if(!VIZ[V[v][i]])
dfs(V[v][i]);
S.push_back(v);
}
int main()
{
fi>>n>>m;
for(int i=1;i<=m;i++)
{
int a,b;
fi>>a>>b;
V[a].push_back(b);
}
for(int i=1;i<=n;i++)
if(!VIZ[i])
dfs(i);
for(int i=n-1;i>=0;i--)
fo<<S[i]<<" ";
fi.close();
fo.close();
return 0;
}
