Pagini recente » Cod sursa (job #1328845) | Cod sursa (job #1481745) | Cod sursa (job #2710314) | Cod sursa (job #496435) | Cod sursa (job #755380)
Cod sursa(job #755380)
#include <iostream>
#include <fstream>
#include <vector>
#include <cstdlib>
using namespace std;
ifstream in("ciclueuler.in");
ofstream out("ciclueuler.out");
int n,m,x[550000],y[550000],lung,s[510000];
vector <int> b[110000];
bool fol[510000];
void euler(int nod)
{
int i;
for(i=0;i<b[nod].size();++i)
{
if(fol[b[nod][i]]==false)
{
fol[b[nod][i]]=true;
euler(x[b[nod][i]]+y[b[nod][i]]-nod);
}
}
s[++lung]=nod;
}
int main()
{
int i;
in>>n>>m;
for(i=1;i<=m;++i)
{
in>>x[i]>>y[i];
b[x[i]].push_back(i);
b[y[i]].push_back(i);
}
euler(1);
for(i=1;i<=lung;++i)
{
out<<s[i]<<" ";
}
return 0;
}