Cod sursa(job #2126707)
| Utilizator | Data | 9 februarie 2018 21:16:03 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,a[101][101],viz[1001],v[1001],p=1;
void citire()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;
f>>x>>y;
a[x][y]=1;
}
}
void df(int k)
{
viz[k]=1;
for(int i=1;i<=n;i++)
if(a[k][i] && !viz[i])
{
v[++p]=i;df(i);
}
}
int main()
{citire();
v[1]=1;
for(int i=1;i<=n;i++)
{
if(!viz[i]) df(i);
}
for(int i=1;i<=n;i++)
g<<v[i]<<" ";
return 0;
}
