tabuhash.h

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

/*5:*/
#line 132 "./tabuhash.w"

#if !defined(_TABUHASH_H_)
#define _TABUHASH_H_
extern const char*tabuhash_rcs_id;
/*8:*/
#line 210 "./tabuhash.w"

#include "dirty.h"

/*:8*//*19:*/
#line 380 "./tabuhash.w"

#include "pool.h"

/*:19*/
#line 136 "./tabuhash.w"

/*7:*/
#line 195 "./tabuhash.w"

typedef struct tabu_hash_elem_s{
int u,v;
struct tabu_hash_elem_s*next;
}tabu_hash_elem_t;

typedef struct{
dirty_set_t*dirty;
tabu_hash_elem_t**chain;
int chain_limit;
/*13:*/
#line 292 "./tabuhash.w"

tabu_hash_elem_t*thread;
int size;
int max_size;

/*:13*/
#line 205 "./tabuhash.w"

/*18:*/
#line 376 "./tabuhash.w"

pool_t*elem_pool;

/*:18*/
#line 206 "./tabuhash.w"

}tabu_hash_t;

/*:7*/
#line 137 "./tabuhash.w"

/*6:*/
#line 173 "./tabuhash.w"

tabu_hash_t*tabu_hash_bd_create(int vertex_bound,int max_size);
void tabu_hash_bd_destroy(tabu_hash_t*th);
int tabu_hash_bd_includes(tabu_hash_t*th,int u,int v);
void tabu_hash_bd_add(tabu_hash_t*th,int u,int v);
void tabu_hash_bd_make_empty(tabu_hash_t*th);
tabu_hash_t*tabu_hash_unbd_create(int vertex_bound,int max_size);
void tabu_hash_unbd_destroy(tabu_hash_t*th);
int(*tabu_hash_unbd_includes)(tabu_hash_t*th,int u,int v);
void tabu_hash_unbd_add(tabu_hash_t*th,int u,int v);
void tabu_hash_unbd_make_empty(tabu_hash_t*th);

/*:6*/
#line 138 "./tabuhash.w"

#endif

/*:5*/