c语言程序 旅游售货员问题 实验报告～区域交通网中顶点的数据域在这里不是我们关心的内容，我们关心的只是连接2个顶点的弧的代价。由于涉及到顶点间边或狐，我们可以用一个二维数组存放顶点间关系（边或弧）的数据――邻接矩阵实现该区域交通网的存储。-c language program travel salesman problem Experimental Report ~ regional transportation network in the vertex of the data field here is not our concern, we care about is connecting two vertices arc price. As it relates to inter-vertex edge or fox, we can use a two-dimensional array storing the relationship between the vertex (edge or arc) data- adjacency matrix to achieve the region s transportation network storage.