Pagini recente » Cod sursa (job #1747940) | Cod sursa (job #2289949) | Cod sursa (job #1505759) | Cod sursa (job #2973181) | Cod sursa (job #1201032)
#include <cstdio>
FILE* in=fopen("ciclueuler.in","r");
FILE* out=fopen("ciclueuler.out","w");
int nod,muc;
const int Q=500001,W=100001;
struct muchie
{
int x,y;
bool f;
} v[Q];
int urm[Q],val[Q],lst[W],nr;
void add(int t)
{
nr++;
val[nr]=t;
urm[nr]=lst[v[t].x ];
lst[v[t].x]=nr;
nr++;
val[nr]=t;
urm[nr]=lst[v[t].y];
lst[v[t].y]=nr;
}
void euler(int act)
{
int p,m;
p=lst[act];
while(p!=0)
{
m=val[p];
if(v[m].f==0)
{
v[m].f=1;
if(v[m].x==act)
euler(v[m].y);
else
euler(v[m].x);
}
p=urm[p];
}
fprintf(out,"%d ",act);
}
int main()
{
fscanf(in,"%d%d",&nod,&muc);
int a,b;
for(int i=1; i<=muc; i++)
{
fscanf(in,"%d%d",&v[i].x,&v[i].y);
add(i);
}
euler(1);
return 0;
}