Cod sursa(job #2192241)
Utilizator | Data | 5 aprilie 2018 01:37:43 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int NMAX = 5e4 + 5;
int n, m, k;
int st[NMAX], viz[NMAX];
vector <int> v[NMAX];
void DFS(int nod)
{
viz[nod] = 1;
for(int i = 0; i < v[nod].size(); i++)
if(!viz[v[nod][i]])
DFS(v[nod][i]);
st[++k] = nod;
}
int main()
{
f >> n;
f >> m;
while(m--)
{
int x, y;
f >> x >> y;
v[x].push_back(y);
}
DFS(1);
for(int i = 1; i <= n; i++)
g << st[i] << " ";
}