Concorde mlinkern.h functions
int CCedgegen_mlinkern (int ncount, CCdatagroup *dat, int wantlist,
int *ecount, int **elist, CCkdtree *kt, int iterations,
COMPUTES the edge set of union of Chained Lin-Kernighan matchings.
-ncount is the number of nodes in the graph
-dat gives the data to generate edge lengths
-if wantlist is nonzero, then the edgeset will be returned
-ecount will return the number of edges found (if wantlist)
-elist will return the matching in end end format (if wantlist)
-kt is a pointer to a kd-tree
-iterations is the number of Chained LK kicks matchings
Code is only set up for norms of CC_KD_NORM_TYPE.