Pagini recente » Cod sursa (job #2364297) | Cod sursa (job #2420097) | Cod sursa (job #3199057) | Cod sursa (job #995132) | Cod sursa (job #1165350)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
#define NMax 100005
#define MMax 500005
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");
int n,m;
bool muchie[MMax];
vector<int> v[NMax],w[NMax];
void Euler(int s)
{
for(int i=0;i<(int)v[s].size();i++)
{
if(muchie[w[s][i]]) continue;
muchie[w[s][i]]=1;
Euler(v[s][i]);
if(m--) g<<s<<" ";
}
}
int main()
{
int i,a,b;
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
w[a].push_back(i);
w[b].push_back(i);
}
Euler(1);
f.close();
g.close();
return 0;
}