Pagini recente » Cod sursa (job #76359) | Cod sursa (job #1105531) | Cod sursa (job #2432860) | Cod sursa (job #920174) | Cod sursa (job #2662466)
#include <iostream>
#include <fstream>
#include <vector>
#define O 50005
using namespace std;
vector<vector<int> > G;
bool viz[O];
int TS[O];
int N, M, k;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
void citire()
{
in >> N >> M;
G.resize(N + 2);
int x, y;
for(int i = 1; i <= M; i++)
{
in >> x >> y;
G[x].push_back(y);
// G[y].push_back(x);
}
}
void DFS(int z)
{
viz[z] = 1;
for(int i = 0; i < G[z].size(); i++)
{
int Vecin = G[z][i];
if(!viz[Vecin])
DFS(Vecin);
}
TS[++k] = z;
}
int main()
{
citire();
for(int i = 1; i <= N; i++)
if(!viz[i])
DFS(i);
DFS(1);
for(int i = N; i >= 1; i--)
out << TS[i] << ' ';
}