Cod sursa(job #2485489)
| Utilizator | Data | 1 noiembrie 2019 17:52:02 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
vector <vector <int > >la;
list <int> topo;
vector <bool> used;
int n,m;
void citire()
{
int x,y;
cin >> n >> m;
la.resize(n+1);
used.resize(n+1);
for(int i=1;i<=m;++i)
{
cin >> x >> y;
la[x].push_back(y);
}
}
void dfs(int x)
{
used[x] = 1;
for(int &i : la[x])
if(!used[i])dfs(i);
topo.push_front(x);
}
int main()
{
freopen("sortaret.in","r",stdin);
citire();
dfs(1);
freopen("sortaret.out","w",stdout);
for(int &i : topo)cout << i << ' ';
}
