// Test of closest pair algorithms
// David Eppstein, UC Irvine, 20 Apr 1997
//
// Multi-fragment TSP application

#include "Algorithms.h"

extern CPApplication MultiFragment;

class MultiFragmentDistance : public PointSet {
	PointSet & base;
	point * partners;
	friend CPApplication MultiFragment;
	
 public:
 	MultiFragmentDistance(unsigned long npoints, PointSet & b);
 	~MultiFragmentDistance() { delete &base; delete partners; }
 	double operator() (point, point);	// compute dist modified by partners
 	void interact(point, point);		// merge two frags by repartnering
};