Mai intai trebuie sa te autentifici.
Cod sursa(job #1706772)
| Utilizator | Data | 23 mai 2016 09:28:52 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
bool viz[100000];
int n,x,y,m;
vector<int>v[50000];
void dfs(int nod){
viz[nod]=1;
for(int i=0;i<v[nod].size();i++){
if(!viz[v[nod][i]]){
viz[v[nod][i]]=1;
out<<v[nod][i]<<" ";
dfs(v[nod][i]);
}
}
}
int main()
{
in>>n>>m;
for(int i=1;i<=m;i++){
in>>x>>y;
v[x].push_back(y);
}
for(int i=1;i<=n;i++)
if(viz[i]==0)
{
out<<i<<" ";
dfs(i);
}
return 0;
}
