Pagini recente » Cod sursa (job #1008000) | Cod sursa (job #384304) | Cod sursa (job #357975) | Cod sursa (job #3205733) | Cod sursa (job #1329797)
#include <fstream>
#include <vector>
#define NMax 100005
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int N,M;
vector < int > G[NMax];
int Ordnung[NMax],Use[NMax],k;
void Read()
{
fin>>N>>M;
for(int i=1;i<=M;i++)
{
int x,y;
fin>>x>>y;
G[x].push_back(y);
}
}
void DFS(int Nod)
{
Use[Nod] = 1;
// Zona 1
for(int i = 0; i<(int)G[Nod].size();i++)
{
int Vecin = G[Nod][i];
if(!Use[Vecin])
{
//Zona 2
DFS(Vecin);
//Zona 3
}
}
//Zona 4
Ordnung[++k] = Nod;
}
void Print()
{
for(int i=k;i>=1;i--)
fout<<Ordnung[i]<<" ";
fout<<"\n";
}
int main()
{
Read();
for(int i=1;i<=N;i++)
if(!Use[i])
DFS(i);
Print();
return 0;
}