Cod sursa(job #3248600)
| Utilizator | Data | 12 octombrie 2024 10:59:25 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
#define SIZE 100001
#define cin fin
#define cout fout
int n, m;
bool v[SIZE];
vector<int> a[SIZE];
vector<int> l;
void dfs(int p){
v[p]=1;
cout<<p<<' ';
for(auto i : a[p]){
if(!v[i]){
dfs(i);
}
}
}
int main()
{
cin>>n>>m;
for(int i=1; i<=m; i++){
int x, y;
cin>>x>>y;
a[x].push_back(y);
}
dfs(1);
return 0;
}
