dirty.h

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

/*4:*/
#line 148 "./dirty.w"

#if !defined(_DIRTY_H_)
#define _DIRTY_H_
extern const char*dirty_rcs_id;
/*16:*/
#line 359 "./dirty.w"

#if DIRTY_SET==DIRTY_SET_SPLAY_ROOT
#include "dict.h"
#endif

/*:16*//*36:*/
#line 614 "./dirty.w"

#if DIRTY_SET==DIRTY_SET_FIFO
#include "prng.h"
#endif

/*:36*/
#line 152 "./dirty.w"

/*26:*/
#line 486 "./dirty.w"

typedef struct dirty_queue_node_s{
struct dirty_queue_node_s*next;
}dirty_queue_node_t;

/*:26*/
#line 153 "./dirty.w"

/*6:*/
#line 212 "./dirty.w"

typedef struct{
#if DIRTY_SET == DIRTY_SET_SPLAY_ROOT
/*15:*/
#line 355 "./dirty.w"

dict_t*dict;

/*:15*/
#line 215 "./dirty.w"

#else 
/*25:*/
#line 481 "./dirty.w"

dirty_queue_node_t*queue,*head,*tail;


/*:25*//*35:*/
#line 610 "./dirty.w"

prng_t*prng;

/*:35*/
#line 217 "./dirty.w"

#endif
int n;
int num_used;
const char*file;
int line;
}dirty_set_t;

/*:6*/
#line 154 "./dirty.w"

/*5:*/
#line 193 "./dirty.w"

dirty_set_t*dirty_create(int n,int full,int seed,const char*file,int line);
void dirty_make_full(dirty_set_t*ds,int seed);
void dirty_make_empty(dirty_set_t*ds);
int dirty_has_elements(dirty_set_t*ds);
int dirty_includes(dirty_set_t*ds,const int v);
void dirty_add(dirty_set_t*ds,const int v);
int dirty_remove(dirty_set_t*ds);
void dirty_destroy(dirty_set_t*ds);

/*:5*/
#line 155 "./dirty.w"

#endif

/*:4*/