Pagini recente » Cod sursa (job #1913085) | Cod sursa (job #2047861) | Cod sursa (job #242379) | Cod sursa (job #134672) | Cod sursa (job #2269643)
#include <fstream>
#include <vector>
using namespace std;
ifstream fi("sortaret.in");
ofstream fo("sortaret.out");
vector<int> topo;
vector<int> graph[50000];
bool visited[50000];
void DFS(int node)
{
for(auto i:graph[node])
{
if(!visited[i])
{
topo.push_back(i);
visited[i] = 1;
DFS(i);
}
}
}
int main()
{
int n, m,a,b;
fi>>n>>m;
for(int i = 1; i <= m; ++i)
{
fi>>a>>b;
graph[a].push_back(b);
}
for(int i = 1; i <= n; ++i)
{
if(!visited[i])
{
visited[i] = 1;
topo.push_back(i);
DFS(i);
}
}
for(auto i:topo)
{
fo<<i<<' ';
}
}