array.h

Lin-Kernighan heuristic for the TSP and minimum weight perfect matching

/*5:*/
#line 156 "./array.w"

extern const char*array_rcs_id;
/*14:*/
#line 219 "./array.w"

void array_setup(int num_vertices);
void array_cleanup(void);

/*:14*//*16:*/
#line 252 "./array.w"


int array_next(int a);
int array_prev(int a);

/*:16*//*18:*/
#line 279 "./array.w"

int array_between(int a,int b,int c);

/*:18*//*25:*/
#line 381 "./array.w"

void array_flip(int a,int b,int c,int d);

/*:25*//*27:*/
#line 399 "./array.w"

void array_set(int const*tour);

/*:27*/
#line 158 "./array.w"


/*:5*/