Cod sursa(job #3213291)
Utilizator | Gabriel Stefan Tita gabriel.9619 | Data | 12 martie 2024 20:52:28 |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <int> l[50001];
int viz[50001], sol[50001];
int a;
void dfs(int nod)
{
viz[nod]=1;
for(int i=0;i<l[nod].size();i++)
{
int vecin=l[nod][i];
if(viz[vecin]==0)
{
dfs(vecin);
}
}
sol[++a]=nod;
}
int main()
{
int n, m, x, y, i;
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
l[x].push_back(y);
l[y].push_back(x);
}
dfs(1);
for(i=n;i>=1;i--)
{
fout<<sol[i]<<" ";
}
return 0;
}