Pagini recente » Cod sursa (job #2327395) | Cod sursa (job #1164452) | Cod sursa (job #605451) | Cod sursa (job #1164072) | Cod sursa (job #2399967)
#include <fstream>
#define NMAX 1000
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
void citire();
void parcurgere(int x);
void afisare();
struct lista {int y; bool uz=0;};
lista LA[NMAX][NMAX];
int start=1,nr=0;//nr elem din solutie
int sol[NMAX];
int n,m;
int main()
{citire();
parcurgere(start);
afisare();
return 0;
}
void citire()
{fin>>n>>m;
int i,x,y;
for(i=1;i<=m;i++)
{fin>>x>>y;
LA[x][0].y++;
LA[x][LA[x][0].y].y=y;
LA[y][0].y++;
LA[y][LA[y][0].y].y=x;
}
}
void parcurgere(int x)
{int i;
nr++;
sol[nr]=x;
for(i=1;i<=LA[x][0].y;i++)//daca am muchie de la x la i si i nu e folosit
if(LA[x][i].uz==0)
{LA[x][i].uz=1;
LA[i][x].uz=1;
parcurgere(LA[x][i].y);
}
}
void afisare()
{int i;
for(i=1;i<=nr;i++)
fout<<sol[i]<<' ';
}