文件名称:traveller-problem-1-
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
介绍说明－－下载内容均来自于网络，请自行研究使用
The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
traveller problem-1-
....................\fonctions.h
....................\graphe11.txt
....................\main (2).c
....................\makefile.txt
....................\READ ME.txt
....................\structures.h
....................\test1.c
....................\test2.c