Cod sursa(job #1579990)
| Utilizator | Data | 25 ianuarie 2016 12:20:35 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream>
#include<vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,x,y,i,j;
bool viz[50005];
vector<int>a[50005];
void dfs(int nod)
{
//viz[nod]=1;
g<<nod<<" ";
for(j=0;j<a[nod].size();j++)
if(viz[a[nod][j]]==0)
dfs(a[nod][j]);
viz[nod]=1;
}
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)
{
//viz[i]=1;
dfs(i);
}
return 0;
}
