Pagini recente » Cod sursa (job #2347821) | Cod sursa (job #1920031) | Cod sursa (job #586005) | Cod sursa (job #2837139) | Cod sursa (job #373396)
Cod sursa(job #373396)
#include <stdio.h>
#include <stdlib.h>
#define max 100010
int i,j,n,m,k;
int *a[max];
void erase(int v,int w)
{
int i,aux;
for(i=1; i<=a[v][0]; i++)
if(a[v][i]==w)
{
a[v][i]=a[v][a[v][0]--];
break;
}
for(i=1; i<=a[w][0]; i++)
if(a[w][i]==v)
{
a[w][i]=a[w][a[w][0]--];
break;
}
}
void euler(int v)
{
int i,w;
for(i=1; i<=a[v][0]; i++)
{
w=a[v][i];
erase(v,w);
euler(w);
}
printf("%d ",v);
}
int main()
{
freopen("ciclueuler.in","r",stdin);
freopen("ciclueuler.out","w",stdout);
scanf("%d%d",&n,&m);
for(i=1; i<=n; i++)
{
a[i]=(int *)realloc(a[i],sizeof(int));
a[i][0]=0;
}
for(; m>0; m--)
{
scanf("%d%d",&i,&j);
a[i][0]++;
a[i]=(int *)realloc(a[i],(a[i][0]+1)*sizeof(int));
a[i][a[i][0]]=j;
a[j][0]++;
a[j]=(int *)realloc(a[j],(a[j][0]+1)*sizeof(int));
a[j][a[j][0]]=i;
}
euler(1);
return 0;
}