Pagini recente » Cod sursa (job #2869943) | Cod sursa (job #2550069) | Cod sursa (job #1168980) | Cod sursa (job #147174) | Cod sursa (job #2570684)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("sortare.in");
ofstream out("sortare.out");
int n, m, d_ext[50001], coada[50001];
vector<int> mat[50001];
void sortare_topologica(){
for(int i = 1; i <= n; i++)
if(d_ext[i] == 0) coada[++coada[0]] = i;
for(int i = 1; i <= n; i++){
int x = coada[i];
for(vector<int>::iterator it = mat[x].begin(); it != mat[x].end(); ++it)
{
d_ext[*it]--;
if(d_ext[*it] == 0) coada[++coada[0]] = *it;
}
}
}
void citire(){
int a, b;
in >> n >> m;
for(int i = 1; i <= m; i++){
in >> a >> b;
mat[b].push_back(a);//facem graful transpus
d_ext[a]++;
}
}
void afisare(){
for(int i = n; i >= 1; i--)
out << coada[i]<<' ';
}
int main()
{
citire();
sortare_topologica();
afisare();
return 0;
}