Pagini recente » Cod sursa (job #1404508) | Cod sursa (job #1494754) | Cod sursa (job #324908) | Cod sursa (job #323685) | Cod sursa (job #2723167)
#include <iostream>
#include<vector>
#include<fstream>
using namespace std;
vector<int>v[100001];
vector<int>r;
bool viz[10001];
int x[10001], y[10001];
void euler(int nod) {
while(v[nod].size()){
int muc=v[nod].back();
v[nod].pop_back();
if(viz[muc]==0) {
viz[muc]=1;
int vec;
if(x[muc]==nod) {
vec=y[muc];
}
else {
vec=x[muc];
}
euler(vec);
}
}
r.push_back(nod);
}
int main(){
int i, n, m;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
fin>>n>>m;
for(i=1;i<=m;i++) {
fin>>x[i]>>y[i];
v[x[i]].push_back(i);
v[y[i]].push_back(i);
}
viz[1]=1;
euler(1);
for(i=0;i<r.size();i++) {
fout<<r[i]<<" ";
}
return 0;
}