Pagini recente » Cod sursa (job #1452580) | Cod sursa (job #165649) | Cod sursa (job #1893651) | Cod sursa (job #331836) | Cod sursa (job #2528374)
#include <iostream>
#include <fstream>
#include <vector>
#define zero 0
#define unu 1
#define doi 2
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m;
vector<int> gr[50005], v;
bool viz[50005];
void citire() {
fin >> n >> m;
for (int i = 1; i <= m; i++) {
int x, y;
fin >> x >> y;
gr[x].push_back(y);
}
}
void DFS(int nod) {
viz[nod] = unu;
for (int i = 0; i < gr[nod].size(); i++) {
if (viz[gr[nod][i]] == zero) {
DFS(gr[nod][i]);
}
}
viz[nod] = doi;
v.push_back(nod);
}
void parcComp() {
for (int i = 1; i <= n; i++)
if (viz[i] == zero) {
DFS(i);
}
}
int main(int argc, const char * argv[]) {
citire();
parcComp();
for (int i = 0; i < v.size(); i++)
fout << v[i] << " ";
}