Pagini recente » Cod sursa (job #2909753) | Cod sursa (job #2939686) | Cod sursa (job #3189316) | Cod sursa (job #2822133) | Cod sursa (job #2399988)
#include <fstream>
#define NMAX 1024
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
void citire();
void DFS(int x);
void rezolv(int x);
int MA[NMAX][NMAX];
bool uz[NMAX];
int sol[NMAX];
int n,m,k;
int main()
{
citire();
///for(int i=1; i<k; i++)
/// fout<<sol[i]<<" ";
///fout<<endl;
return 0;
}
void citire()
{
int i,x,y;
fin>>n>>m;
for(i=1; i<=m; i++)
{
fin>>x>>y;
MA[x][y]=MA[y][x]+=1;
}
rezolv(1);
}
void DFS(int x)
{
int i;
for(i=1; i<=n; i++)
if(uz[i]==0 && MA[x][i]==1)
{
uz[i]=1;
DFS(i);
}
}
void rezolv(int x)
{ int i;
for(i=1; i<=n; i++)
{
if(MA[x][i]>=1)
{
MA[x][i]--;
MA[i][x]--;
rezolv(i);
}
}
fout<<x<<" ";
///k++;
/// sol[k]=x;
}