001    
002    package algo;
003    
004    /**
005     * Interface for TSP computing algorithms.
006     * @author Heinz Kredel.
007     */
008    public interface TSPInf {
009    
010        public Path actualBest();
011    
012        public void setBest(Path b);
013    
014    /**
015     * Search the best path for a TSP problem.
016     */
017        public Path getBest();
018    
019    
020    /**
021     * Search the best path for a TSP problem.
022     * @param max maximal number of iterations to be used or Long.MAX_VALUE.
023     */
024        public Path getBest(long max);
025    
026    
027    /**
028     * Search the best path for a TSP problem.
029     * Starting with path p.
030     */
031        public void getBest(Path p);
032    
033    
034        public long getIterations();
035    
036        public long getMaxIterations();
037    
038        public long setMaxIterations(long m);
039    
040    }