Cod sursa(job #2377668)
Utilizator | Petrea Calin petrea1551 | Data | 10 martie 2019 19:58:04 |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
vector<int> v[50001], q;
int viz[50001];
void dfs(int nod)
{
viz[nod] = 1;
for (int i = 0; i < v[nod].size(); i++)
if (viz[v[nod][i]] == 0)
dfs(v[nod][i]);
q.push_back(nod);
}
int main()
{
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++)
{
int x, y;
cin >> x >> y;
v[x].push_back(y);
}
dfs(1);
for (int i = 0; i < q.size(); i++)
cout << q[i] << ' ';
return 0;
}