Cod sursa(job #1173056)
Utilizator | Data | 18 aprilie 2014 15:40:11 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include<fstream>
#include<vector>
#include<bitset>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m;
vector<int>v[50005];
bitset<50005>viz;
inline int DFS(int x)
{
int i,len;
viz[x]=1;
fout<<x<<" ";
len=v[x].size();
for (i=0;i<len;i++)
if (!viz[v[x][i]])
DFS(v[x][i]);
}
inline void Citire()
{
int i,x,y;
fin>>n>>m;
for (i=1;i<=m;i++)
{
fin>>x>>y;
v[x].push_back(y);
}
DFS(1);
}
int main()
{
Citire();
return 0;
}