Pagini recente » Cod sursa (job #1918662) | Cod sursa (job #1961201) | Cod sursa (job #2911427) | Cod sursa (job #1647377) | Cod sursa (job #2399906)
#include <fstream>
#define NMAX 1005
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
int n, m, nr;
int A[NMAX][NMAX];
int sol[NMAX];
void citire();
void parcurgere_euler(int);
int main()
{
citire();
parcurgere_euler(1);
for(int i=1; i <= nr; i++)
fout<<sol[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 parcurgere_euler(int start)
{
sol[++nr] = start;
for(int i=1; i <= n; i++)
{
bool ok = false;
while(A[start][i] && i != start)
{
ok = true;
A[start][i]--;
A[i][start]--;
}
if(ok)
parcurgere_euler(i);
}
}