Concorde heldkarp.h functions
int CCheldkarp_small (int ncount, CCdatagroup *dat, double *upbound,
double *optval, int *foundtour, int anytour, int nodelimit,
-ncount is the number of nodes in the graph.
-dat specifies the information needed to compute the edge lengths.
-upbound is an upperbound on the optimal tour length (it can be
-optval returns the length of an optimal tour (or the upperbound
if no better tour is found, or the value of the first tour found
that it better than upbound if anytour = 1 is specified)
-foundtour will be set to 1 if a tour better than upbound is found
-anytour should be set to 1 to cut off the search after any tour
better than upbound is found (it may not be an optimal tour)
-nodelimit specifies a limit on the number of search nodes (use -1
to impose no limit)
-silent should be set to 1 to restrict the output and 2 to
disable all normal output
int CCheldkarp_small_elist (int ncount, int ecount, int *elist,
int *elen, int *upbound, int *optval, int *foundtour,
int anytour, int nodelimit, int silent)
USES edgelist rather than datagroup.
-ecount is the number of edges in the graph.
-elist is the list of edges in end0 end1 format.
-elen is a list of the edge lengths.
NOTES: The upperbound will be converted to an int.
Graph can have at most MAX_NODES with edge lengths no greater
The code was designed for problems in the range of 25 to 35