Pagini recente » Cod sursa (job #2550178) | Cod sursa (job #810092) | Cod sursa (job #424413) | Cod sursa (job #2477714) | Cod sursa (job #1321324)
#include <fstream>
#include <list>
#include <vector>
std::ifstream in ("sortaret.in");
std::ofstream out("sortaret.out");
int n, m;
std::vector< std::list<int> > x;
std::vector<int> seen;
std::list<int> sorted;
void dfs (int i)
{
seen[i] = true;
for (std::list<int>::iterator it=x[i].begin(); it != x[i].end(); it++)
if (!seen[*it]) dfs (*it);
sorted.push_front (i);
}
int main()
{
in >> n >> m;
x.resize (n+1);
seen.resize (n+1, false);
int a, b, i;
for (i=0; i<m; i++) {
in >> a >> b;
x[a].push_back(b);
}
for (i=1; i<=n; i++) if (!seen[i]) dfs (i);
for (std::list<int>::iterator it=sorted.begin(); it != sorted.end(); it++) out << *it << " ";
}