Pagini recente » Cod sursa (job #1579577) | Cod sursa (job #1536163) | Cod sursa (job #2294674) | Cod sursa (job #1734681) | Cod sursa (job #2399930)
#include <fstream>
using namespace std;
ifstream fin ("ciclueuler.in");
ofstream fout ("ciclueuler.out");
int n, nr, m;
int start1;
int L[5000];
int A[250][250];
void citire();
void Euler(int);
int main()
{
citire();
start1 = 1;
Euler(start1);
for(int i=1; i < nr; i++)
fout<<L[i]<<' ';
return 0;
}
void citire()
{
int x, y;
fin>>n>>m;
for(int i=1; i <= m; i++)
{
fin>>x>>y;
A[x][y]++;
A[y][x]++;
}
}
void Euler(int k)
{
for(int i = 1 ; i <= n ; i ++)
if(A[k][i])
{
A[k][i]--;
A[i][k]--;
Euler(i);
}
L[++nr] = k;
}