G
Geiser
hello everybody,
I am going to apply the hamiltonian cycle on Cayley graphs and
specially, on a Pancke graph which is a variant of cayley graphs.
for clearing the matter,I have considered the following code.but,it
does not satisfy the condition at all.
I would like to receive your advice and corrections ,if any.
tanx in advance!
Geiser
#include <stdio.h>
#define D 2 // dimension
#define N 8 // number of nodes
main()
{
int node[N];
int i=0;
for (i=0; i<N; i++)
node=i;
i=0;
do{
printf("%d\n",node);
}while(++i<N);
printf("%d\n",node[0]);
}
I am going to apply the hamiltonian cycle on Cayley graphs and
specially, on a Pancke graph which is a variant of cayley graphs.
for clearing the matter,I have considered the following code.but,it
does not satisfy the condition at all.
I would like to receive your advice and corrections ,if any.
tanx in advance!
Geiser
#include <stdio.h>
#define D 2 // dimension
#define N 8 // number of nodes
main()
{
int node[N];
int i=0;
for (i=0; i<N; i++)
node=i;
i=0;
do{
printf("%d\n",node);
}while(++i<N);
printf("%d\n",node[0]);
}