readme

一个非常好的

1. Overview

This is a java applet to solve the traveling salesman problem. Two
algorithmen are implemented:
  - Simulated Annealing 
  - Ant Colony Optimization (ant-cycle)
The Solutions of the algorithmen are displayed in the applet.

2. License.

This program is licensed by General Public License Version 2 
(see license file). 
View online at http://www.gnu.org/licenses/licenses.html.

3. Preparation.

You need at least the Java Runtime Enviroment 1.4.1 to run the applet and
the Java Standard Developing Kit 1.4.1 to compile.

4. Compilation.

Change to the directory where you have unzipped the source files and
enter "javac *.java" to compile all files.
DO NOT USE "javac *.tsp"!

5. Running.

There are two possiblities to get the applet started:
  - Run the appletviewer programm, that comes with your java installation.
    It is located in the bin directory of your java path.
    Enter in commandline: "appletviewer ($SourceDirectory)/tsp.html"
  - Run the applet in your browser.
    Load the address of the "tsp.html" file

6. Troubleshooting.

Feel free to write me :)
[e-mail]