Pagini recente » Cod sursa (job #1900294) | Cod sursa (job #693457) | Cod sursa (job #3333617) | Cod sursa (job #1666489) | Cod sursa (job #3333944)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
vector<vector<pair<int, int>>> la;
vector<int> viz, ciclu, grad, vizDfs;
void euler (int v) {
while (la[v].size() > 0) {
int w = la[v].back().first;
int idx = la[v].back().second;
la[v].pop_back();
if (viz[idx] == 0) {
viz[idx] = 1;
euler(w);
}
}
ciclu.push_back(v);
}
int main() {
int N, M;
fin >> N >> M;
la.resize(N + 1);
viz.assign(M, 0);
grad.assign(N + 1, 0);
for (int i = 0; i < M; i++) {
int x, y;
fin >> x >> y;
la[x].push_back({y, i});
la[y].push_back({x, i});
grad[x]++;
grad[y]++;
}
for (int i = 1; i <= N; i++) {
if (grad[i] % 2 != 0) {
fout << "-1";
return 0;
}
}
euler(1);
ciclu.pop_back();
for (auto& n : ciclu) {
fout << n << ' ';
}
return 0;
}