Cod sursa(job #1509601)
Utilizator | Data | 24 octombrie 2015 09:07:56 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
#include<vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,i,x,y,poz;
vector<int>fin;
bool viz[50005];
vector<int>a[50005];
void dfs(int k)
{
viz[k]=1;
fin.push_back(k);
for(i=0;i<a[k].size();i++)
if(viz[a[k][i]]==0)
dfs(a[k][i]);
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x].push_back(y);
}
for(i=1;i<=n;i++)
if(viz[i]==0)
dfs(i);
for(i=0;i<fin.size();i++)
g<<fin[i]<<" ";
return 0;
}