⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 makefile.am,v

📁 Lin-Kernighan heuristic for the TSP and minimum weight perfect matching
💻 AM,V
📖 第 1 页 / 共 3 页
字号:
head	1.36;access;symbols	zero-five-zero:1.36	zero-four-seventeen:1.35	zero-four-ten:1.30	zero-four-nine:1.30	zero-four-eight:1.29	zero-four-five:1.28	zero-four-zero:1.25;locks	neto:1.36; strict;comment	@# @;1.36date	98.12.05.22.36.18;	author neto;	state Exp;branches;next	1.35;1.35date	98.10.16.20.44.23;	author neto;	state Exp;branches;next	1.34;1.34date	98.10.09.21.35.11;	author neto;	state Exp;branches;next	1.33;1.33date	98.10.09.19.22.06;	author neto;	state Exp;branches;next	1.32;1.32date	98.10.02.19.14.57;	author neto;	state Exp;branches;next	1.31;1.31date	98.08.28.19.24.45;	author neto;	state Exp;branches;next	1.30;1.30date	98.08.20.18.36.04;	author neto;	state Exp;branches;next	1.29;1.29date	98.08.09.22.31.55;	author neto;	state Exp;branches;next	1.28;1.28date	98.08.07.22.00.40;	author neto;	state Exp;branches;next	1.27;1.27date	98.07.31.17.30.37;	author neto;	state Exp;branches;next	1.26;1.26date	98.07.24.17.51.02;	author neto;	state Exp;branches;next	1.25;1.25date	98.05.23.16.24.54;	author neto;	state Exp;branches;next	1.24;1.24date	97.12.20.18.40.10;	author neto;	state Exp;branches;next	1.23;1.23date	97.12.13.19.44.52;	author neto;	state Exp;branches;next	1.22;1.22date	97.11.15.21.36.28;	author neto;	state Exp;branches;next	1.21;1.21date	97.06.19.19.51.01;	author neto;	state Exp;branches;next	1.20;1.20date	97.06.19.19.16.56;	author neto;	state Exp;branches;next	1.19;1.19date	97.05.21.14.12.05;	author neto;	state Exp;branches;next	1.18;1.18date	97.05.16.22.29.07;	author neto;	state Exp;branches;next	1.17;1.17date	97.05.16.21.59.13;	author neto;	state Exp;branches;next	1.16;1.16date	97.05.16.16.58.16;	author neto;	state Exp;branches;next	1.15;1.15date	97.05.16.16.53.42;	author neto;	state Exp;branches;next	1.14;1.14date	97.05.16.16.37.10;	author neto;	state Exp;branches;next	1.13;1.13date	97.05.16.16.22.47;	author neto;	state Exp;branches;next	1.12;1.12date	97.05.16.15.51.26;	author neto;	state Exp;branches;next	1.11;1.11date	97.05.16.15.37.47;	author neto;	state Exp;branches;next	1.10;1.10date	97.05.16.15.20.02;	author neto;	state Exp;branches;next	1.9;1.9date	97.05.14.20.51.29;	author neto;	state Exp;branches;next	1.8;1.8date	97.05.14.20.38.05;	author neto;	state Exp;branches;next	1.7;1.7date	97.05.14.20.06.50;	author neto;	state Exp;branches;next	1.6;1.6date	97.05.14.19.18.55;	author neto;	state Exp;branches;next	1.5;1.5date	97.05.14.18.38.51;	author neto;	state Exp;branches;next	1.4;1.4date	97.05.14.18.17.54;	author neto;	state Exp;branches;next	1.3;1.3date	97.05.13.22.29.18;	author neto;	state Exp;branches;next	1.2;1.2date	97.05.13.20.19.58;	author neto;	state Exp;branches;next	1.1;1.1date	97.05.13.20.08.19;	author neto;	state Exp;branches;next	;desc@Input to automake to create Makefile.in that is processed by configureto create Makefile, the makefile to create the program LK.@1.36log@More programs: instance generatros@text@## Process this file with automake to produce Makefile.in# Makefile for generating binary program LK from sources.# $Id: Makefile.am,v 1.35 1998/10/16 20:44:23 neto Exp neto $##   Copyright (C) 1994, 1995, 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.## AUTOMAKE_OPTIONS = no-dependencies ## AM_CFLAGS = -pgAM_CFLAGS=## These .w files are the *real* sources.## File cwebmac.tex is required to typeset CWEB programs.  It is taken from## the CWEB distribution.EXTRA_DIST = \	decluster.dvi \	array.w construct.w copyrt.w decluster.w dict.w distcalc.w dsort.w \	error.w fixincludes.w gb_flip.w gb_flip.ch \	clustcalc.w \	clusternoise.w \	infill.w \	clusterdiscount.w \	fullgrid.w ifs.w jbmr.w kdtree.w \	length.w lk.w mainlk.w memory.w nn.w pool.w read.w resource.w sier.w tspgen.w \	twolevel.w types.w unifd.w unif.w webdefs.w \	tabuhash.w \	dirty.w \	cwebmac.tex compile.c.in \	prng.w prngconfig.h \	jitter.w \	shake.w \	prolog.ps \	prolog.eps \	mkcwebch.pl \	tspps.w \	tsp2matrix.w \	match.w \	ascend.w \	pq.w \	clip.w \	milestone.w \	lgplnotice.tex \	myboiler.w \	scheme0.eps \	scheme1.eps \	scheme2.eps \	scheme3.eps \	scheme4.eps \	scheme5.eps \	scheme6.eps \	scheme7.eps \	scheme8.eps \	scheme9.eps \	scheme10.eps \	scheme11.eps \	scheme12.eps \	boilerplate.w# Docs should also include ifs.dvi, but that also needs# fern.eps nicecloud.eps tropicalfish.eps tropicalfisheye.epsDOCS = array.dvi construct.dvi decluster.dvi dict.dvi distcalc.dvi dsort.dvi \	error.dvi fixincludes.dvi gb_flip.dvi \	fullgrid.dvi jbmr.dvi kdtree.dvi \	length.dvi lk.dvi memory.dvi nn.dvi pool.dvi read.dvi resource.dvi  \	sier.dvi tspgen.dvi \	twolevel.dvi unifd.dvi unif.dvi \	dirty.dvi \	prng.dvi \	jitter.dvi \	shake.dvi \	tspps.dvi \	tsp2matrix.dvi \	match.dvi \	ascend.dvi \	pq.dvi \	clip.dvi \	tsp2rwm.dvi \	upper.dvibin_PROGRAMS = lk tspgen jitter tspps shake ifs fullgrid unifd unif sier distcalc clip dsorttest dicttest declustertest test_flip prngtest pqtest dirtytest tsp2rwm tsp2matrix kdtreetest clusternoise clusterdiscount clustcalc infillTESTS = test_flip dicttest declustertest prngtest dsorttest pqtest dirtytest kdtreetestlk_SOURCES = \	array.c \	array.h \	construct.c \	construct.h \	declevel.h \	decluster.c \	decluster.h \	dict.c \	dict.h \	dirty.c \	dirty.h \	dsort.c \	dsort.h \	error.c \	error.h \	fixincludes.h \	gb_flip.c \	gb_flip.h \	jbmr.c \	jbmr.h \	kdtree.c \	kdtree.h \	length.h \	match.c \	match.h \	milestone.c \	milestone.h \	mainlk.c \	lk.c \	lk.h \	lkconfig.h \	memory.c \	memory.h \	nn.c \	nn.h \	pool.c \	pool.h \	prng.c \	prng.h \	pq.h \	pq.c \	read.c \	read.h \	resource.c \	resource.h \	tabuhash.h \	tabuhash.c \	twolevel.c \	twolevel.h \	ascend.c \	ascend.h \	compile.c tspgen_SOURCES = \	dsort.c \	dsort.h \	error.c \	error.h \	memory.c \	memory.h \	gb_flip.c \	gb_flip.h \	tspgen.c# read needs gb_flip.tspps_SOURCES = \	length.h \	error.c \	error.h \	memory.c \	memory.h \	gb_flip.c \	gb_flip.h \	read.c \	read.h \	tspps.c# read needs gb_flip.clusternoise_SOURCES = \	length.h \	error.c \	error.h \	memory.c \	memory.h \	gb_flip.c \	gb_flip.h \	read.c \	read.h \	pq.c \	pq.h \	dsort.c \	dsort.h \	pool.c \	pool.h \	kdtree.c \	kdtree.h \	decluster.c \	decluster.h \	clusternoise.c# read needs gb_flip.infill_SOURCES = \	length.h \	error.c \	error.h \	memory.c \	memory.h \	gb_flip.c \	gb_flip.h \	read.c \	read.h \	pq.c \	pq.h \	dsort.c \	dsort.h \	pool.c \	pool.h \	kdtree.c \	kdtree.h \	decluster.c \	decluster.h \	infill.c# read needs gb_flip.clustcalc_SOURCES = \	length.h \	error.c \	error.h \	memory.c \	memory.h \	gb_flip.c \	gb_flip.h \	read.c \	read.h \	pq.c \	pq.h \	dsort.c \	dsort.h \	pool.c \	pool.h \	kdtree.c \	kdtree.h \	decluster.c \	decluster.h \	clustcalc.c# read needs gb_flip.clusterdiscount_SOURCES = \	length.h \	error.c \	error.h \	memory.c \	memory.h \	gb_flip.c \	gb_flip.h \	read.c \	read.h \	pq.c \	pq.h \	dsort.c \	dsort.h \	pool.c \	pool.h \	kdtree.c \	kdtree.h \	decluster.c \	decluster.h \	clusterdiscount.ctsp2matrix_SOURCES = \	length.h \	error.c \	error.h \	memory.c \	memory.h \	gb_flip.c \	gb_flip.h \	read.c \	read.h \	tsp2matrix.cjitter_SOURCES = \	decluster.h \	decluster.c \	dsort.c \	dsort.h \	error.c \	error.h \	kdtree.c \	kdtree.h \	memory.c \	memory.h \	gb_flip.c \	gb_flip.h \	pool.c \	pool.h \	prng.c \	prng.h \	prngconfig.h \	pq.c \	pq.h \	read.h \	read.c \	jitter.cshake_SOURCES = \	decluster.h \	decluster.c \	dsort.c \	dsort.h \	error.c \	error.h \	kdtree.c \	kdtree.h \	memory.c \	memory.h \	gb_flip.c \	gb_flip.h \	pool.c \	pool.h \	prng.c \	prng.h \	prngconfig.h \	pq.c \	pq.h \	read.h \	read.c \	shake.cdist-hook : 	rm -f $(distdir)/compile.c	cp -r RCS $(distdir)ifs_SOURCES = gb_flip.c gb_flip.h ifs.cunifd_SOURCES = gb_flip.c gb_flip.h unifd.cunif_SOURCES = gb_flip.c gb_flip.h unif.csier_SOURCES = gb_flip.c gb_flip.h sier.cfullgrid_SOURCES = fullgrid.cdistcalc_SOURCES = error.h error.c memory.h memory.c read.c read.h \	gb_flip.h gb_flip.c \	length.h distcalc.ctsp2rwm_SOURCES = error.h error.c memory.h memory.c read.c read.h \	gb_flip.h gb_flip.c \	length.h tsp2rwm.cclip_SOURCES = error.h error.c memory.h memory.c read.c read.h \	gb_flip.h gb_flip.c \	length.h clip.cBUILT_SOURCES = \	array.c \	array.h \	clustcalc.c \	clusterdiscount.c \	clusternoise.c \	compile.c \	construct.c \	construct.h \	decluster.c \	decluster.h \    declustertest.c \	dict.c \	dict.h \	dicttest.c \	dirty.c \	dirty.h \	dirtytest.c \	distcalc.c \	dsort.c \	dsort.h \	dsorttest.c \	error.c \	error.h \	fixincludes.h \	gb_flip.c \	gb_flip.h \	fullgrid.c \	ifs.c \	jbmr.c \	jbmr.h \	kdtree.c \	kdtree.h \	kdtreetest.c \	length.h \	lk.c \	lk.h \	memory.c \	memory.h \	nn.c \	nn.h \	pool.c \	pool.h \	prng.c \	prng.h \	prngtest.c \	read.c \	read.h \	resource.c \	resource.h \	sier.c \	test_flip.c \	tspgen.c \	twolevel.c \	twolevel.h \	unifd.c \	unif.c# Programs required to process the .w sources.# ctangle makes .w into .c and .h  (not necessarily both or either)# cweave makes .w into .tex (.idx and .scn)# tex makes .tex (and .idx and .scn) into .dviCTANGLE = @@CTANGLE@@CWEAVE = @@CWEAVE@@TEX = @@TEX@@# Get default flags from confgureCTANGLEFLAGS_DEFAULT = @@CTANGLEFLAGS_DEFAULT@@CWEAVEFLAGS_DEFAULT = @@CWEAVEFLAGS_DEFAULT@@# FIXME: separate tests test_flip_SOURCES = test_flip.c gb_flip.c gb_flip.h

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -