Pagini recente » Cod sursa (job #2805983) | Istoria paginii runda/sim01 | Cod sursa (job #924064) | Cod sursa (job #2397598) | Cod sursa (job #2813717)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("ciclueuler.in");
ofstream out("ciclueuler.out");
vector<vector<int> > a(100001);
int r[500001];
int n,m;
int p;
int ad(int k,int i){
for(int j=0;j<a[k].size();j++){
if(a[k][j] == i)
return j;
}
return -1;
}
void Euler(int k){
for(int i = 1 ; i <= n ; i ++){
int ai = ad(k,i);
if(ai != -1)
{
a[k].erase(a[k].begin() + ai);
a[i].erase(a[i].begin() + ad(i,k));
Euler(i);
}
}
r[++p] = k;
}
int main(){
in >> n >> m;
for(int i=1;i<=m;i++){
int x,y;
in >> x >> y;
a[x].push_back(y);
a[y].push_back(x);
}
Euler(1);
for(int i=1;i<=p;i++){
out << r[i] << " ";
}
return 0;
}