Pagini recente » Cod sursa (job #2878402) | Cod sursa (job #87437) | Cod sursa (job #1354270) | Cod sursa (job #307484) | Cod sursa (job #2171124)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int n,m,eu,v[100005],x,y;
vector < int > g[100005];
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
void sterge(int nod, int w)
{
for(auto it=g[w].begin();it!=g[w].end(); )
{
if(*it==nod)
{
g[w].erase(it);
return;
}
}
}
void euler(int nod)
{
fout<<nod<<" ";
for(auto it=g[nod].begin();it!=g[nod].end(); )
{
int w=*it;
sterge(nod,w);
g[nod].erase(it);
euler(w);
}
}
int main()
{
fin>>n>>m;
for(int i=0;i<m;i++)
{
fin>>x>>y;
g[x].push_back(y);
if(x!=y)
g[y].push_back(x);
v[x]+=1;
v[y]+=1;
}
eu=1;
for(int i=1;i<=n;i++)
{
if(v[i]%2==1)
eu=0;
}
if(eu==1)
euler(1);
else
fout<<-1;
return 0;
}