Pagini recente » Cod sursa (job #1265543) | Cod sursa (job #2588229) | Cod sursa (job #2025411) | Cod sursa (job #2836813) | Cod sursa (job #2530520)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("topsort.in");
ofstream fout("topsort.out");
vector<int>l[50001];
stack<int>s;
bitset<50001>ap;
int n, m, i, j;
void sortare(int v)
{
ap[v] = 1;
for(const int& it : l[v])
{
if(!ap[it])
{
sortare(it);
}
}
s.push(v);
}
void topSort()
{
for(int i = 1; i <= n; i++)
{
if(!ap[i])
{
sortare(i);
}
}
while(!s.empty())
{
fout << s.top() << ' ';
s.pop();
}
}
int main()
{
fin >> n >> m;
for(int i = 1; i <= m; i++)
{
fin >> i >> j;
l[i].push_back(j);
}
topSort();
return 0;
}