Pagini recente » Cod sursa (job #780818) | Cod sursa (job #2497895) | Cod sursa (job #2840118) | Cod sursa (job #742025) | Cod sursa (job #2355563)
#include <cstdio>
#include <vector>
using namespace std;
vector<int> Adj[100005];
vector<int> lista;
int n,m;
bool viz[100005];
void citire()
{
scanf("%d %d",&n,&m);
int a,b;
for(int i=0;i<m;i++)
{
scanf("%d %d",&a,&b);
Adj[a].push_back(b);
}
}
void parc(int nr)
{
if(viz[nr]==0)
viz[nr]=1;
for(auto it:Adj[nr])
{
if(viz[it]==0)
parc(it);
}
lista.push_back(nr);
}
void DFS()
{
for(int i=1;i<=n;i++)
{
if(viz[i]==0)
{
parc(i);
}
}
}
void afis()
{
for(auto it=lista.end()-1;it>=lista.begin();it--)
printf("%d ",*it);
}
int main()
{
//freopen("dfs.in","r",stdin);
freopen("sortaret.in","r",stdin);
freopen("sortaret.out","w",stdout);
citire();
DFS();
afis();
return 0;
}