旅行商问题的源代码及其说明。给出空间中给定n个点，画一条简单路径，包括所有的点，使得路径最短-Traveling Salesman Problem and its descr iption of the source code. Given space in a given n points, draw a simple path, including all the points, making the shortest path

A* is a shortesr path algorithm. it is useful to find a shortest path.

JAVA编写的Dijkstra算法，可用于求解最短路径。-Dijkstra by using java which can be applied to solve the shortest path

最短路劲的使用，基于java的可视化最短路径开发(The use of the shortest road, based on java visualization of the shortest path development)