Cod sursa(job #2856533)
Utilizator | Data | 23 februarie 2022 23:24:09 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <bits/stdc++.h>
#include <fstream>
#define MAX 50100
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,x[MAX][MAX],viz[10];
void cit(){
f>>n>>m;
int a,b;
for(int i=1;i<=m;i++){
f>>a>>b;
x[a][b]=1;
x[b][a]=1;
}
}
/*void afis(){
for(int i=1; i<=n; i++){
for(int j=1;j<=n;j++)
g<<x[i][j]<<" ";
g<<'\n';
}
}
*/
void df(int i){
g<<i<<" ";
viz[i]=1;
for(int j=1;j<=n;j++)
if(x[i][j]==1&&!viz[j])
df(j);
}
int main()
{
cit();
df(1);
//afis();
return 0;
}