edu.gwu.algtest
Interface MTSPAlgorithm

All Superinterfaces:
edu.gwu.algtest.Algorithm
public interface MTSPAlgorithm
extends edu.gwu.algtest.Algorithm

Interface MTSPAlgorithm needs to be implemented by any algorithm that wishes to solve the MTSP problem.

See Also:
Algorithm

Method Summary
 int[][] computeTours(int m, edu.gwu.geometry.Pointd[] points)
          Method computeTours() is the only method in the interface.
 
Methods inherited from interface edu.gwu.algtest.Algorithm
getName, setPropertyExtractor
 

Method Detail

computeTours

int[][] computeTours(int m,
                     edu.gwu.geometry.Pointd[] points)
Method computeTours() is the only method in the interface. The number of salesmen, m, and the the locations of the points (cities) are passed in as parameters. You need to return a 2D array of ints, one row for each of the m salesmen. Each row will list in an array the points (cities) assigned in tour-order to that particular salesman. For example, suppose m=5, and array A (of type int[][]) is returned. Then, A[3] = {0, 4, 5} implies that cities 0, 4 and 5 were assigned to salesman 3 (the fourth salesman, counting from 0 onwards).

Parameters:
m - an int value
points - a Pointd[] value
Returns:
an int[][] value