Pagini recente » Cod sursa (job #1871846) | Cod sursa (job #2613843) | Cod sursa (job #2609933) | Cod sursa (job #102134) | Cod sursa (job #2344754)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream fi("ciclueuler.in");
ofstream fo("ciclueuler.out");
int nr,n,m,x,y;
int sol[1000010];
vector <int> a[100004];
void euler(int k)
{
while(!a[k].empty())
{
int urm=a[k].back();
a[k].pop_back();
for(int i=0; i<a[urm].size(); i++)
if(a[urm][i]==k)
{
a[urm].erase(a[urm].begin()+i);
break;
}
euler(urm);
}
sol[++nr]=k;
}
int main()
{
fi>>n>>m;
for(int i=1; i<=m; i++)
{
fi>>x>>y;
a[y].push_back(x);
a[x].push_back(y);
}
euler(1);
if(nr-1==m)
for(int i=nr; i>=1; i--)
fo<<sol[i]<<" ";
else
fo<<-1;
return 0;
}