Cod sursa(job #1996035)
| Utilizator | Data | 29 iunie 2017 19:11:34 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,t[50005],cnt;
vector<int>L[50005];
bool viz[50005];
void Citire()
{
int x,y;
fin>>n>>m;
for(int i=1;i<=m;i++)
fin>>x>>y,
L[x].push_back(y),
L[y].push_back(x);
}
void Dfs(int k)
{
int i;
viz[k]=1;
for(i=0;i<L[k].size();i++)
if(!viz[L[k][i]])
Dfs(L[k][i]);
t[++cnt]=k;
}
int main()
{
Citire();
for(int i=1;i<=n;i++)
if(!viz[i])
Dfs(i);
for(int i=cnt;i>=1;i--)
fout<<t[i]<<" ";
return 0;
}
