Pagini recente » Cod sursa (job #1996422) | Cod sursa (job #159051) | Cod sursa (job #1977373) | Cod sursa (job #1479713) | Cod sursa (job #3284738)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
int n , x[500005] , y[500005] , e[500005] , m , lun , viz[500005];
vector<int> L[100005];
void Euler(int k)
{
for(int i : L[k])
if(!viz[i])
{
viz[i] = 1;
Euler(x[i] + y[i] - k);
}
e[++lun] = k;
}
int main()
{
int i , j , k;
fin >> n >> m;
for(k = 1;k <= m;k++)
{
fin >> i >> j;
x[k] = i;
y[k] = j;
L[i].push_back(k);
L[j].push_back(k);
}
Euler(1);
for(i = 1;i <= lun;i++)
fout << e[i] << " ";
return 0;
}