nn.h

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

/*7:*/
#line 238 "./nn.w"

extern const char*nn_rcs_id;
/*10:*/
#line 253 "./nn.w"

extern int nn_max_bound;


/*:10*/
#line 240 "./nn.w"

/*14:*/
#line 305 "./nn.w"

int*nn_list(int city,int*list_len);

/*:14*//*20:*/
#line 340 "./nn.w"

void nn_cleanup(void);

/*:20*//*22:*/
#line 386 "./nn.w"

void nn_build(int num_pure,int num_quadrant,int num_delauney);

/*:22*/
#line 241 "./nn.w"


/*:7*/