Cod sursa(job #2715391)
| Utilizator | Data | 3 martie 2021 17:00:31 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> G[50001];
int sol[50001],n,m,k;
bool viz[50001];
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)
{viz[node]=1;
for(auto x:G[node])
DFS(x);
sol[++k]=node;
}
int main()
{int i;
read();
for(i=1;i<=n;i++)
if(!viz[i]) DFS(i);
for(i=k;i>=1;i--)
g<<sol[i]<<" ";
}
