Mai intai trebuie sa te autentifici.
Cod sursa(job #795690)
| Utilizator | Data | 9 octombrie 2012 13:38:46 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <iostream>
#include <vector>
using namespace std;
struct nod
{
int x;
int y;
};
int n,m;
int viz[100005];
vector < int > graph[50000 * 2 +5];
void citire()
{
scanf("%d %d",&n,&m);
for(int i = 0 ; i < m;i++)
{
int x,y;
scanf("%d %d",&x,&y);
graph[x].push_back(y);
}
}
void dfs(int i)
{
printf("%d ",i);
viz[i] = 1;
for(int j = 0 ; j < graph[i].size();j++)
if(viz[graph[i][j]] == 0)
{
int v = graph[i][j];
dfs(v);
}
}
int main()
{
freopen("sortaret.in","r",stdin);
freopen("sortaret.out","w",stdout);
citire();
dfs(1);
return 0;
}
