declevel.h,v

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

head	1.2;
access;
symbols
	zero-five-zero:1.2
	zero-four-seventeen:1.2
	zero-four-ten:1.2
	zero-four-nine:1.2
	zero-four-eight:1.2
	zero-four-five:1.2
	zero-four-zero:1.2;
locks
	neto:1.2; strict;
comment	@ * @;


1.2
date	97.07.02.20.51.28;	author neto;	state Exp;
branches;
next	1.1;

1.1
date	97.06.17.20.53.09;	author neto;	state Exp;
branches;
next	;


desc
@Specify how much of the declustering heuristic should be used.
@


1.2
log
@Default is to decluster everything.
@
text
@/* declevel.h 
 *
 * Level of declustering support.
 * vi: set tabstop=4 shiftwidth=4:
 * 
 * $Id: declevel.h,v 1.1 1997/06/17 20:53:09 neto Exp neto $
 * 
 *    Copyright (C) 1996, 1997 David Neto
 *
 *    This program is free software; you can redistribute it and/or modify
 *    it under the terms of the GNU General Public License as published by
 *    the Free Software Foundation; either version 2, or (at your option)
 *    any later version.
 *
 *    This program is distributed in the hope that it will be useful, but
 *    WITHOUT ANY WARRANTY; without even the implied warranty of
 *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 *    General Public License for more details.
 * 
 *    You should have received a copy of the GNU General Public License
 *    along with this program; if not, write to the Free Software
 *    Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
 *    USA.
 * 
 * 
 * This file sets the compile-time options for declustering support.
 * I've designed a way to compensate for clustering present in the TSP
 * instance.  It is explained in decluster.w (and in my PhD thesis).
 *
 * Define JBMR_DECLUSTER_IN_ELIGIBILITY_TEST to compensate for clustering
 * when deciding whether an edge is feasible.
 *
 * Define JBMR_DECLUSTER_IN_GREEDY to compensate for clustering when
 * choosing among eligible edges.  If the GREEDY setting is on, then the
 * ELIGIBILITY setting must also be on.
 *
 * Defaults:
	#define JBMR_DECLUSTER_IN_ELIGIBILITY_TEST 1
	#define JBMR_DECLUSTER_IN_GREEDY 1
 */

#if !defined(JBMR_DECLUSTER_IN_GREEDY)
#define JBMR_DECLUSTER_IN_GREEDY 1
#endif

#if !defined(JBMR_DECLUSTER_IN_ELIGIBILITY_TEST)
#define JBMR_DECLUSTER_IN_ELIGIBILITY_TEST 1
#endif


/* Define LK_BUILD_DECLUSTER_STRUCTURES to a non-zero value to always 
 * build the decluster data structures, even if declustering is not used.
 * This is useful for some verbose output, and normally should be disabled.
 *
 * Default:
	#define LK_BUILD_DECLUSTER_STRUCTURES 0
 */
#define LK_BUILD_DECLUSTER_STRUCTURES 0


/* Don't touch the following. */
#if JBMR_DECLUSTER_IN_GREEDY
#undef JBMR_DECLUSTER_IN_ELIGIBILITY_TEST
#define JBMR_DECLUSTER_IN_ELIGIBILITY_TEST 1
#endif
@


1.1
log
@Initial revision
@
text
@d6 1
a6 1
 * $Id$
d43 1
a43 1
#define JBMR_DECLUSTER_IN_GREEDY 0
d47 1
a47 1
#define JBMR_DECLUSTER_IN_ELIGIBILITY_TEST 0
d49 10
@