Cod sursa(job #2715193)
| Utilizator | Data | 3 martie 2021 10:49:10 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int sol[50001],k;
vector <int> G[50001];
int n,m;
void read()
{
int a,b;
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>a>>b;
G[a].push_back(b);
}
}
void DFS(int node)
{
sol[++k]=node;
for(auto x:G[node])
{
DFS(x);
}
}
int main()
{
read();
DFS(1);
for(int i=1;i<=k;i++)
g<<sol[i]<<" ";
}
