Pagini recente » Cod sursa (job #1428474) | Cod sursa (job #1441125) | Cod sursa (job #220405) | Cod sursa (job #1543473) | Cod sursa (job #2384728)
#include <fstream>
#include <vector>
#define NMAX 100005
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
int n,m;
struct nod{int varf,uz;};
vector <nod> g[NMAX];
vector <int> a;
void citire();
void rezolvare();
void dfs(int k);
int main()
{
citire();
rezolvare();
return 0;
}
void citire()
{
int i;
nod a,b;
a.uz=0;
b.uz=0;
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>a.varf>>b.varf;
g[a.varf].push_back(b);
g[b.varf].push_back(a);
}
}
void rezolvare()
{
int i;
for(i=1;i<=n;i++)
{
if(g[i].size())
{
dfs(i);
break;
}
}
for(i=0;i<a.size()-1;i++)
{
fout<<a[i]<<' ';
}
}
void dfs(int k)
{
int i,j,l;
for(i=0;i<g[k].size();i++)
{
if(g[k][i].uz==0)
{
g[k][i].uz=1;
l=g[k][i].varf;
for(j=0;j<g[l].size();j++)
{
if(g[l][j].varf==k&&g[l][j].uz==0)
{
g[l][j].uz=1;
break;
}
}
dfs(l);
}
}
a.push_back(k);
}