/* For copyright information, see olden_v1.01/COPYRIGHT */
**********************
olden_v1.01/benchmarks/tsp/README
June 1996
Martin C. Carlisle

this directory contains the Traveling Salesman benchmark:

Adapted for Olden from code by J. Muller using algorithm by:

R. Karp, "Probabilistic analysis of partitioning algorithms for the traveling-
salesman problem in the plane."  Mathematics of Operations Research 
2(3):209-224, August 1977

**********************

Makefile - use "make tsp" to create executable

args.c - process command line args
build.c - build cities tree
tsp.[ch] - compute tsp
main.c - main routine