Cod sursa(job #2443521)
Utilizator | Data | 28 iulie 2019 13:51:43 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,graf[1000][1000];
void citire()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;
f>>x>>y;
graf[x][y]=1;
}
}
int vizitat[1000];
void dfs(int nod)
{vizitat[nod]=1;
cout<<nod<<" ";
for(int i=1;i<=n;i++)
if(!vizitat[i] && graf[nod][i])
dfs(i);
}
int main()
{citire();
int i,j;
dfs(1);
return 0;
}