Cod sursa(job #902408)
Utilizator | Macovei Claudiu nutipasa16 | Data | 1 martie 2013 14:03:54 |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
#include<vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,x,y,viz[500002];
vector<int> v[50002],sol;
void dfs(int i)
{
if(!viz[i])
{
g<<i<<" ";
viz[i]=1;
for(unsigned int j=0;j<v[i].size();j++)
{
dfs(v[i][j]);
}
}
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
}
dfs(1);
}