Cod sursa(job #2204592)
| Utilizator | Data | 16 mai 2018 17:32:12 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m;
bool a[5000][5000];
void read(){
fin>>n>>m;
int x, y;
for(int i=1; i<=m; i++){
fin>>x>>y;
a[x][y]=1;
}
}
bool vizitat[30];
void adancime(int nod){
vizitat[nod]=true;
fout<<nod<<' ';
for(int i=1; i<=n; i++)
if(a[nod][i]==true && vizitat[i]==false)
adancime(i);
}
int main() {
read();
adancime(1);
}
