Pagini recente » Cod sursa (job #2315049) | Cod sursa (job #2938893) | Cod sursa (job #2238491) | Cod sursa (job #1183976) | Cod sursa (job #2663150)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream citire("sortaret.in");
ofstream afisare("sortaret.out");
vector<int>nod;
vector<vector<int>>g(50001);//matricea de adiacenta
vector<int>viz(50001);//vector noduri vizitate
void dfs(int n)
{
viz[n] = 1;
for(int i=1; i<=g[n].size(); i++)
if(viz[g[n][i]]==0)
dfs(g[n][i]);
nod.push_back(n);
}
int main()
{
int vf,arc,x,y;
citire>>vf>>arc;
for(int i=1; i<=arc; i++)
{
citire>>x>>y;
g[x].push_back(y);
}
for(int i=1;i<=vf; i++)
if(viz[i]==0)
dfs(i);
for(int i=nod.size(); i>=1; i--)
afisare<<nod[i]<<" ";
}