TSP

  求解TSP问题，即在N个城市中各经历一次回到出发点，使所经过的路程最短。采用连续的Hopfield网络实现以5个城市为例的TSP问题。(TSP problem, that each of the N cities experiencing a return to the starting point, so that the shortest distance elapsed. Use continuous Hopfield networks to five cities as an example of the TSP.)