citytour.h

来自「eC++编译器源码」· C头文件 代码 · 共 15 行

#pragma CityTour
#include <Graphics.h>
/* This program implements the travelling salesperson problem.*/
/* The program uses simulated annealing to solve the problem.  */
/*                                                             */

double RoundTrip (Coordinate &coord[], /*x-y positions*/
             unsigned int &visitOrder[],  /*output permutation vector*/
             unsigned int nOFCities);      /*number of cities*/

/* Finds the shortest round-trip path to NCITY cites whose coordinates are  */
/* in the array coord.  The array visitOrder(i) specifies the order in which */
/* the cities are visited.  This routine will return the best alternative    */ 
/* path it can find.                                                         */