Pagini recente » Cod sursa (job #3294796) | Cod sursa (job #3297191) | Cod sursa (job #3137211) | Cod sursa (job #3265604) | Cod sursa (job #3299678)
#include <bits/stdc++.h>
#define cin ci
#define cout co
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n, m, x, y;
vector<vector<int>> graf;
vector<int> grad;
queue<int> q;
void sorttop()
{
for(int i=1; i<=n; i++)
if(!grad[i])
q.push(i);
while(!q.empty())
{
int node = q.front();
q.pop();
cout << node << " ";
for(auto next:graf[node])
{
grad[next]--;
if(!grad[next])
q.push(next);
}
}
}
int main()
{
cin >> n >> m;
graf.assign(n+1, vector<int>());
grad.resize(n+1);
for(int i=1; i<=m; i++)
{
cin >> x >> y;
graf[x].push_back(y);
grad[y]++;
}
sorttop();
return 0;
}