/farmR/src/glptsp.c

https://code.google.com/p/javawfm/ · C · 666 lines · 569 code · 21 blank · 76 comment · 303 complexity · 66465efec58ab0e61b3b5ecb5a775db6 MD5 · raw file 

    

  1. /* glptsp.c */
    2. 

  2. 

  3. /***********************************************************************
    4. 

  4. *  This code is part of GLPK (GNU Linear Programming Kit).
    5. 

  5. *
    6. 

  6. *  Copyright (C) 2000,01,02,03,04,05,06,07,08,2009 Andrew Makhorin,
    7. 

  7. *  Department for Applied Informatics, Moscow Aviation Institute,
    8. 

  8. *  Moscow, Russia. All rights reserved. E-mail: <mao@mai2.rcnet.ru>.
    9. 

  9. *
    10. 

  10. *  GLPK is free software: you can redistribute it and/or modify it
    11. 

  11. *  under the terms of the GNU General Public License as published by
    12. 

  12. *  the Free Software Foundation, either version 3 of the License, or
    13. 

  13. *  (at your option) any later version.
    14. 

  14. *
    15. 

  15. *  GLPK is distributed in the hope that it will be useful, but WITHOUT
    16. 

  16. *  ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
    17. 

  17. *  or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
    18. 

  18. *  License for more details.
    19. 

  19. *
    20. 

  20. *  You should have received a copy of the GNU General Public License
    21. 

  21. *  along with GLPK. If not, see <http://www.gnu.org/licenses/>.
    22. 

  22. ***********************************************************************/
    23. 

  23. 

  24. #define _GLPSTD_ERRNO
    25. 

  25. #define _GLPSTD_STDIO
    26. 

  26. #include "glplib.h"
    27. 

  27. #include "glptsp.h"
    28. 

  28. #define xfault xerror
    29. 

  29. 

  30. /*----------------------------------------------------------------------
    31. 

  31. -- tsp_read_data - read TSP instance data.
    32. 

  32. --
    33. 

  33. -- *Synopsis*
    34. 

  34. --
    35. 

  35. -- #include "glptsp.h"
    36. 

  36. -- TSP *tsp_read_data(char *fname);
    37. 

  37. --
    38. 

  38. -- *Description*
    39. 

  39. --
    40. 

  40. -- The routine tsp_read_data reads a TSP (or related problem) instance
    41. 

  41. -- data from the text file, whose name is the character string fname.
    42. 

  42. --
    43. 

  43. -- For detailed description of the format recognized by the routine see
    44. 

  44. -- the report: G.Reinelt, TSPLIB 95.
    45. 

  45. --
    46. 

  46. -- *Returns*
    47. 

  47. --
    48. 

  48. -- If no error occurred, the routine tsp_read_data returns a pointer to
    49. 

  49. -- the TSP instance data block, which contains loaded data. In the case
    50. 

  50. -- of error the routine prints an error message and returns NULL. */
    51. 

  51. 

  52. struct dsa
    53. 

  53. {     /* dynamic storage area used by the routine tsp_read_data */
    54. 

  54.       char *fname;
    55. 

  55.       /* name of the input text file */
    56. 

  56.       FILE *fp;
    57. 

  57.       /* stream assigned to the input text file */
    58. 

  58.       int seqn;
    59. 

  59.       /* line sequential number */
    60. 

  60.       int c;
    61. 

  61.       /* current character */
    62. 

  62.       char token[255+1];
    63. 

  63.       /* current token */
    64. 

  64. };
    65. 

  65. 

  66. static int get_char(struct dsa *dsa)
    67. 

  67. {     dsa->c = fgetc(dsa->fp);
    68. 

  68.       if (ferror(dsa->fp))
    69. 

  69.       {  xprintf("%s:%d: read error - %s\n",
    70. 

  70.             dsa->fname, dsa->seqn, strerror(errno));
    71. 

  71.          return 1;
    72. 

  72.       }
    73. 

  73.       if (feof(dsa->fp))
    74. 

  74.          dsa->c = EOF;
    75. 

  75.       else if (dsa->c == '\n')
    76. 

  76.          dsa->seqn++;
    77. 

  77.       else if (isspace(dsa->c))
    78. 

  78.          dsa->c = ' ';
    79. 

  79.       else if (iscntrl(dsa->c))
    80. 

  80.       {  xprintf("%s:%d: invalid control character 0x%02X\n",
    81. 

  81.             dsa->fname, dsa->seqn, dsa->c);
    82. 

  82.          return 1;
    83. 

  83.       }
    84. 

  84.       return 0;
    85. 

  85. }
    86. 

  86. 

  87. static int skip_spaces(struct dsa *dsa, int across)
    88. 

  88. {     while (dsa->c == ' ' || (across && dsa->c == '\n'))
    89. 

  89.          if (get_char(dsa)) return 1;
    90. 

  90.       return 0;
    91. 

  91. }
    92. 

  92. 

  93. static int scan_keyword(struct dsa *dsa)
    94. 

  94. {     int len = 0;
    95. 

  95.       if (skip_spaces(dsa, 0)) return 1;
    96. 

  96.       dsa->token[0] = '\0';
    97. 

  97.       while (isalnum(dsa->c) || dsa->c == '_')
    98. 

  98.       {  if (len == 31)
    99. 

  99.          {  xprintf("%s:%d: keyword `%s...' too long\n", dsa->fname,
    100. 

  100.                dsa->seqn, dsa->token);
    101. 

  101.             return 1;
    102. 

  102.          }
    103. 

  103.          dsa->token[len++] = (char)dsa->c, dsa->token[len] = '\0';
    104. 

  104.          if (get_char(dsa)) return 1;
    105. 

  105.       }
    106. 

  106.       if (len == 0)
    107. 

  107.       {  xprintf("%s:%d: missing keyword\n", dsa->fname, dsa->seqn);
    108. 

  108.          return 1;
    109. 

  109.       }
    110. 

  110.       return 0;
    111. 

  111. }
    112. 

  112. 

  113. static int check_colon(struct dsa *dsa)
    114. 

  114. {     if (skip_spaces(dsa, 0)) return 1;
    115. 

  115.       if (dsa->c != ':')
    116. 

  116.       {  xprintf("%s:%d: missing colon after `%s'\n", dsa->fname,
    117. 

  117.             dsa->seqn, dsa->token);
    118. 

  118.          return 1;
    119. 

  119.       }
    120. 

  120.       if (get_char(dsa)) return 1;
    121. 

  121.       return 0;
    122. 

  122. }
    123. 

  123. 

  124. static int scan_token(struct dsa *dsa, int across)
    125. 

  125. {     int len = 0;
    126. 

  126.       if (skip_spaces(dsa, across)) return 1;
    127. 

  127.       dsa->token[0] = '\0';
    128. 

  128.       while (!(dsa->c == EOF || dsa->c == '\n' || dsa->c == ' '))
    129. 

  129.       {  if (len == 255)
    130. 

  130.          {  dsa->token[31] = '\0';
    131. 

  131.             xprintf("%s:%d: token `%s...' too long\n", dsa->fname,
    132. 

  132.                dsa->seqn, dsa->token);
    133. 

  133.             return 1;
    134. 

  134.          }
    135. 

  135.          dsa->token[len++] = (char)dsa->c, dsa->token[len] = '\0';
    136. 

  136.          if (get_char(dsa)) return 1;
    137. 

  137.       }
    138. 

  138.       return 0;
    139. 

  139. }
    140. 

  140. 

  141. static int check_newline(struct dsa *dsa)
    142. 

  142. {     if (skip_spaces(dsa, 0)) return 1;
    143. 

  143.       if (!(dsa->c == EOF || dsa->c == '\n'))
    144. 

  144.       {  xprintf("%s:%d: extra symbols detected\n", dsa->fname,
    145. 

  145.             dsa->seqn);
    146. 

  146.          return 1;
    147. 

  147.       }
    148. 

  148.       if (get_char(dsa)) return 1;
    149. 

  149.       return 0;
    150. 

  150. }
    151. 

  151. 

  152. static int scan_comment(struct dsa *dsa)
    153. 

  153. {     int len = 0;
    154. 

  154.       if (skip_spaces(dsa, 0)) return 1;
    155. 

  155.       dsa->token[0] = '\0';
    156. 

  156.       while (!(dsa->c == EOF || dsa->c == '\n'))
    157. 

  157.       {  if (len == 255)
    158. 

  158.          {  xprintf("%s:%d: comment too long\n", dsa->fname, dsa->seqn)
    159. 

  159.                ;
    160. 

  160.             return 1;
    161. 

  161.          }
    162. 

  162.          dsa->token[len++] = (char)dsa->c, dsa->token[len] = '\0';
    163. 

  163.          if (get_char(dsa)) return 1;
    164. 

  164.       }
    165. 

  165.       return 0;
    166. 

  166. }
    167. 

  167. 

  168. static int scan_integer(struct dsa *dsa, int across, int *val)
    169. 

  169. {     if (scan_token(dsa, across)) return 1;
    170. 

  170.       if (strlen(dsa->token) == 0)
    171. 

  171.       {  xprintf("%s:%d: missing integer\n", dsa->fname, dsa->seqn);
    172. 

  172.          return 1;
    173. 

  173.       }
    174. 

  174.       if (str2int(dsa->token, val))
    175. 

  175.       {  xprintf("%s:%d: integer `%s' invalid\n", dsa->fname, dsa->seqn
    176. 

  176.             , dsa->token);
    177. 

  177.          return 1;
    178. 

  178.       }
    179. 

  179.       return 0;
    180. 

  180. }
    181. 

  181. 

  182. static int scan_number(struct dsa *dsa, int across, double *val)
    183. 

  183. {     if (scan_token(dsa, across)) return 1;
    184. 

  184.       if (strlen(dsa->token) == 0)
    185. 

  185.       {  xprintf("%s:%d: missing number\n", dsa->fname, dsa->seqn);
    186. 

  186.          return 1;
    187. 

  187.       }
    188. 

  188.       if (str2num(dsa->token, val))
    189. 

  189.       {  xprintf("%s:%d: number `%s' invalid\n", dsa->fname, dsa->seqn,
    190. 

  190.             dsa->token);
    191. 

  191.          return 1;
    192. 

  192.       }
    193. 

  193.       return 0;
    194. 

  194. }
    195. 

  195. 

  196. TSP *tsp_read_data(char *fname)
    197. 

  197. {     struct dsa _dsa, *dsa = &_dsa;
    198. 

  198.       TSP *tsp = NULL;
    199. 

  199.       dsa->fname = fname;
    200. 

  200.       xprintf("tsp_read_data: reading TSP data from `%s'...\n",
    201. 

  201.          dsa->fname);
    202. 

  202.       dsa->fp = fopen(dsa->fname, "r");
    203. 

  203.       if (dsa->fp == NULL)
    204. 

  204.       {  xprintf("tsp_read_data: unable to open `%s' - %s\n",
    205. 

  205.             dsa->fname, strerror(errno));
    206. 

  206.          goto fail;
    207. 

  207.       }
    208. 

  208.       tsp = xmalloc(sizeof(TSP));
    209. 

  209.       tsp->name = NULL;
    210. 

  210.       tsp->type = TSP_UNDEF;
    211. 

  211.       tsp->comment = NULL;
    212. 

  212.       tsp->dimension = 0;
    213. 

  213.       tsp->edge_weight_type = TSP_UNDEF;
    214. 

  214.       tsp->edge_weight_format = TSP_UNDEF;
    215. 

  215.       tsp->display_data_type = TSP_UNDEF;
    216. 

  216.       tsp->node_x_coord = NULL;
    217. 

  217.       tsp->node_y_coord = NULL;
    218. 

  218.       tsp->dply_x_coord = NULL;
    219. 

  219.       tsp->dply_y_coord = NULL;
    220. 

  220.       tsp->tour = NULL;
    221. 

  221.       tsp->edge_weight = NULL;
    222. 

  222.       dsa->seqn = 1;
    223. 

  223.       if (get_char(dsa)) goto fail;
    224. 

  224. loop: if (scan_keyword(dsa)) goto fail;
    225. 

  225.       if (strcmp(dsa->token, "NAME") == 0)
    226. 

  226.       {  if (tsp->name != NULL)
    227. 

  227.          {  xprintf("%s:%d: NAME entry multiply defined\n", dsa->fname,
    228. 

  228.                dsa->seqn);
    229. 

  229.             goto fail;
    230. 

  230.          }
    231. 

  231.          if (check_colon(dsa)) goto fail;
    232. 

  232.          if (scan_token(dsa, 0)) goto fail;
    233. 

  233.          if (strlen(dsa->token) == 0)
    234. 

  234.          {  xprintf("%s:%d: NAME entry incomplete\n", dsa->fname,
    235. 

  235.                dsa->seqn);
    236. 

  236.             goto fail;
    237. 

  237.          }
    238. 

  238.          tsp->name = xmalloc(strlen(dsa->token) + 1);
    239. 

  239.          strcpy(tsp->name, dsa->token);
    240. 

  240.          xprintf("tsp_read_data: NAME: %s\n", tsp->name);
    241. 

  241.          if (check_newline(dsa)) goto fail;
    242. 

  242.       }
    243. 

  243.       else if (strcmp(dsa->token, "TYPE") == 0)
    244. 

  244.       {  if (tsp->type != TSP_UNDEF)
    245. 

  245.          {  xprintf("%s:%d: TYPE entry multiply defined\n", dsa->fname,
    246. 

  246.                dsa->seqn);
    247. 

  247.             goto fail;
    248. 

  248.          }
    249. 

  249.          if (check_colon(dsa)) goto fail;
    250. 

  250.          if (scan_keyword(dsa)) goto fail;
    251. 

  251.          if (strcmp(dsa->token, "TSP") == 0)
    252. 

  252.             tsp->type = TSP_TSP;
    253. 

  253.          else if (strcmp(dsa->token, "ATSP") == 0)
    254. 

  254.             tsp->type = TSP_ATSP;
    255. 

  255.          else if (strcmp(dsa->token, "TOUR") == 0)
    256. 

  256.             tsp->type = TSP_TOUR;
    257. 

  257.          else
    258. 

  258.          {  xprintf("%s:%d: data type `%s' not recognized\n",
    259. 

  259.                dsa->fname, dsa->seqn, dsa->token);
    260. 

  260.             goto fail;
    261. 

  261.          }
    262. 

  262.          xprintf("tsp_read_data: TYPE: %s\n", dsa->token);
    263. 

  263.          if (check_newline(dsa)) goto fail;
    264. 

  264.       }
    265. 

  265.       else if (strcmp(dsa->token, "COMMENT") == 0)
    266. 

  266.       {  if (tsp->comment != NULL)
    267. 

  267.          {  xprintf("%s:%d: COMMENT entry multiply defined\n",
    268. 

  268.                dsa->fname, dsa->seqn);
    269. 

  269.             goto fail;
    270. 

  270.          }
    271. 

  271.          if (check_colon(dsa)) goto fail;
    272. 

  272.          if (scan_comment(dsa)) goto fail;
    273. 

  273.          tsp->comment = xmalloc(strlen(dsa->token) + 1);
    274. 

  274.          strcpy(tsp->comment, dsa->token);
    275. 

  275.          xprintf("tsp_read_data: COMMENT: %s\n", tsp->comment);
    276. 

  276.          if (check_newline(dsa)) goto fail;
    277. 

  277.       }
    278. 

  278.       else if (strcmp(dsa->token, "DIMENSION") == 0)
    279. 

  279.       {  if (tsp->dimension != 0)
    280. 

  280.          {  xprintf("%s:%d: DIMENSION entry multiply defined\n",
    281. 

  281.                dsa->fname, dsa->seqn);
    282. 

  282.             goto fail;
    283. 

  283.          }
    284. 

  284.          if (check_colon(dsa)) goto fail;
    285. 

  285.          if (scan_integer(dsa, 0, &tsp->dimension)) goto fail;
    286. 

  286.          if (tsp->dimension < 1)
    287. 

  287.          {  xprintf("%s:%d: invalid dimension\n", dsa->fname,
    288. 

  288.                dsa->seqn);
    289. 

  289.             goto fail;
    290. 

  290.          }
    291. 

  291.          xprintf("tsp_read_data: DIMENSION: %d\n", tsp->dimension);
    292. 

  292.          if (check_newline(dsa)) goto fail;
    293. 

  293.       }
    294. 

  294.       else if (strcmp(dsa->token, "EDGE_WEIGHT_TYPE") == 0)
    295. 

  295.       {  if (tsp->edge_weight_type != TSP_UNDEF)
    296. 

  296.          {  xprintf("%s:%d: EDGE_WEIGHT_TYPE entry multiply defined\n",
    297. 

  297.                dsa->fname, dsa->seqn);
    298. 

  298.             goto fail;
    299. 

  299.          }
    300. 

  300.          if (check_colon(dsa)) goto fail;
    301. 

  301.          if (scan_keyword(dsa)) goto fail;
    302. 

  302.          if (strcmp(dsa->token, "GEO") == 0)
    303. 

  303.             tsp->edge_weight_type = TSP_GEO;
    304. 

  304.          else if (strcmp(dsa->token, "EUC_2D") == 0)
    305. 

  305.             tsp->edge_weight_type = TSP_EUC_2D;
    306. 

  306.          else if (strcmp(dsa->token, "ATT") == 0)
    307. 

  307.             tsp->edge_weight_type = TSP_ATT;
    308. 

  308.          else if (strcmp(dsa->token, "EXPLICIT") == 0)
    309. 

  309.             tsp->edge_weight_type = TSP_EXPLICIT;
    310. 

  310.          else if (strcmp(dsa->token, "CEIL_2D") == 0)
    311. 

  311.             tsp->edge_weight_type = TSP_CEIL_2D;
    312. 

  312.          else
    313. 

  313.          {  xprintf("%s:%d: edge weight type `%s' not recognized\n",
    314. 

  314.                dsa->fname, dsa->seqn, dsa->token);
    315. 

  315.             goto fail;
    316. 

  316.          }
    317. 

  317.          xprintf("tsp_read_data: EDGE_WEIGHT_TYPE: %s\n", dsa->token);
    318. 

  318.          if (check_newline(dsa)) goto fail;
    319. 

  319.       }
    320. 

  320.       else if (strcmp(dsa->token, "EDGE_WEIGHT_FORMAT") == 0)
    321. 

  321.       {  if (tsp->edge_weight_format != TSP_UNDEF)
    322. 

  322.          {  xprintf(
    323. 

  323.                "%s:%d: EDGE_WEIGHT_FORMAT entry multiply defined\n",
    324. 

  324.                dsa->fname, dsa->seqn);
    325. 

  325.             goto fail;
    326. 

  326.          }
    327. 

  327.          if (check_colon(dsa)) goto fail;
    328. 

  328.          if (scan_keyword(dsa)) goto fail;
    329. 

  329.          if (strcmp(dsa->token, "UPPER_ROW") == 0)
    330. 

  330.             tsp->edge_weight_format = TSP_UPPER_ROW;
    331. 

  331.          else if (strcmp(dsa->token, "FULL_MATRIX") == 0)
    332. 

  332.             tsp->edge_weight_format = TSP_FULL_MATRIX;
    333. 

  333.          else if (strcmp(dsa->token, "FUNCTION") == 0)
    334. 

  334.             tsp->edge_weight_format = TSP_FUNCTION;
    335. 

  335.          else if (strcmp(dsa->token, "LOWER_DIAG_ROW") == 0)
    336. 

  336.             tsp->edge_weight_format = TSP_LOWER_DIAG_ROW;
    337. 

  337.          else
    338. 

  338.          {  xprintf("%s:%d: edge weight format `%s' not recognized\n",
    339. 

  339.                dsa->fname, dsa->seqn, dsa->token);
    340. 

  340.             goto fail;
    341. 

  341.          }
    342. 

  342.          xprintf("tsp_read_data: EDGE_WEIGHT_FORMAT: %s\n", dsa->token);
    343. 

  343.          if (check_newline(dsa)) goto fail;
    344. 

  344.       }
    345. 

  345.       else if (strcmp(dsa->token, "DISPLAY_DATA_TYPE") == 0)
    346. 

  346.       {  if (tsp->display_data_type != TSP_UNDEF)
    347. 

  347.          {  xprintf("%s:%d: DISPLAY_DATA_TYPE entry multiply defined\n",
    348. 

  348.                dsa->fname, dsa->seqn);
    349. 

  349.             goto fail;
    350. 

  350.          }
    351. 

  351.          if (check_colon(dsa)) goto fail;
    352. 

  352.          if (scan_keyword(dsa)) goto fail;
    353. 

  353.          if (strcmp(dsa->token, "COORD_DISPLAY") == 0)
    354. 

  354.             tsp->display_data_type = TSP_COORD_DISPLAY;
    355. 

  355.          else if (strcmp(dsa->token, "TWOD_DISPLAY") == 0)
    356. 

  356.             tsp->display_data_type = TSP_TWOD_DISPLAY;
    357. 

  357.          else
    358. 

  358.          {  xprintf("%s:%d: display data type `%s' not recognized\n",
    359. 

  359.                dsa->fname, dsa->seqn, dsa->token);
    360. 

  360.             goto fail;
    361. 

  361.          }
    362. 

  362.          xprintf("tsp_read_data: DISPLAY_DATA_TYPE: %s\n", dsa->token);
    363. 

  363.          if (check_newline(dsa)) goto fail;
    364. 

  364.       }
    365. 

  365.       else if (strcmp(dsa->token, "NODE_COORD_SECTION") == 0)
    366. 

  366.       {  int n = tsp->dimension, k, node;
    367. 

  367.          if (n == 0)
    368. 

  368.          {  xprintf("%s:%d: DIMENSION entry not specified\n",
    369. 

  369.                dsa->fname, dsa->seqn);
    370. 

  370.             goto fail;
    371. 

  371.          }
    372. 

  372.          if (tsp->node_x_coord != NULL)
    373. 

  373.          {  xprintf("%s:%d: NODE_COORD_SECTION multiply specified\n",
    374. 

  374.                dsa->fname, dsa->seqn);
    375. 

  375.             goto fail;
    376. 

  376.          }
    377. 

  377.          if (check_newline(dsa)) goto fail;
    378. 

  378.          tsp->node_x_coord = xcalloc(1+n, sizeof(double));
    379. 

  379.          tsp->node_y_coord = xcalloc(1+n, sizeof(double));
    380. 

  380.          for (node = 1; node <= n; node++)
    381. 

  381.             tsp->node_x_coord[node] = tsp->node_y_coord[node] = DBL_MAX;
    382. 

  382.          for (k = 1; k <= n; k++)
    383. 

  383.          {  if (scan_integer(dsa, 0, &node)) goto fail;
    384. 

  384.             if (!(1 <= node && node <= n))
    385. 

  385.             {  xprintf("%s:%d: invalid node number %d\n", dsa->fname,
    386. 

  386.                   dsa->seqn, node);
    387. 

  387.                goto fail;
    388. 

  388.             }
    389. 

  389.             if (tsp->node_x_coord[node] != DBL_MAX)
    390. 

  390.             {  xprintf("%s:%d: node number %d multiply specified\n",
    391. 

  391.                   dsa->fname, dsa->seqn, node);
    392. 

  392.                goto fail;
    393. 

  393.             }
    394. 

  394.             if (scan_number(dsa, 0, &tsp->node_x_coord[node]))
    395. 

  395.                goto fail;
    396. 

  396.             if (scan_number(dsa, 0, &tsp->node_y_coord[node]))
    397. 

  397.                goto fail;
    398. 

  398.             if (check_newline(dsa)) goto fail;
    399. 

  399.          }
    400. 

  400.       }
    401. 

  401.       else if (strcmp(dsa->token, "DISPLAY_DATA_SECTION") == 0)
    402. 

  402.       {  int n = tsp->dimension, k, node;
    403. 

  403.          if (n == 0)
    404. 

  404.          {  xprintf("%s:%d: DIMENSION entry not specified\n",
    405. 

  405.                dsa->fname, dsa->seqn);
    406. 

  406.             goto fail;
    407. 

  407.          }
    408. 

  408.          if (tsp->dply_x_coord != NULL)
    409. 

  409.          {  xprintf("%s:%d: DISPLAY_DATA_SECTION multiply specified\n",
    410. 

  410.                dsa->fname, dsa->seqn);
    411. 

  411.             goto fail;
    412. 

  412.          }
    413. 

  413.          if (check_newline(dsa)) goto fail;
    414. 

  414.          tsp->dply_x_coord = xcalloc(1+n, sizeof(double));
    415. 

  415.          tsp->dply_y_coord = xcalloc(1+n, sizeof(double));
    416. 

  416.          for (node = 1; node <= n; node++)
    417. 

  417.             tsp->dply_x_coord[node] = tsp->dply_y_coord[node] = DBL_MAX;
    418. 

  418.          for (k = 1; k <= n; k++)
    419. 

  419.          {  if (scan_integer(dsa, 0, &node)) goto fail;
    420. 

  420.             if (!(1 <= node && node <= n))
    421. 

  421.             {  xprintf("%s:%d: invalid node number %d\n", dsa->fname,
    422. 

  422.                   dsa->seqn, node);
    423. 

  423.                goto fail;
    424. 

  424.             }
    425. 

  425.             if (tsp->dply_x_coord[node] != DBL_MAX)
    426. 

  426.             {  xprintf("%s:%d: node number %d multiply specified\n",
    427. 

  427.                   dsa->fname, dsa->seqn, node);
    428. 

  428.                goto fail;
    429. 

  429.             }
    430. 

  430.             if (scan_number(dsa, 0, &tsp->dply_x_coord[node]))
    431. 

  431.                goto fail;
    432. 

  432.             if (scan_number(dsa, 0, &tsp->dply_y_coord[node]))
    433. 

  433.                goto fail;
    434. 

  434.             if (check_newline(dsa)) goto fail;
    435. 

  435.          }
    436. 

  436.       }
    437. 

  437.       else if (strcmp(dsa->token, "TOUR_SECTION") == 0)
    438. 

  438.       {  int n = tsp->dimension, k, node;
    439. 

  439.          if (n == 0)
    440. 

  440.          {  xprintf("%s:%d: DIMENSION entry not specified\n",
    441. 

  441.                dsa->fname, dsa->seqn);
    442. 

  442.             goto fail;
    443. 

  443.          }
    444. 

  444.          if (tsp->tour != NULL)
    445. 

  445.          {  xprintf("%s:%d: TOUR_SECTION multiply specified\n",
    446. 

  446.                dsa->fname, dsa->seqn);
    447. 

  447.             goto fail;
    448. 

  448.          }
    449. 

  449.          if (check_newline(dsa)) goto fail;
    450. 

  450.          tsp->tour = xcalloc(1+n, sizeof(int));
    451. 

  451.          for (k = 1; k <= n; k++)
    452. 

  452.          {  if (scan_integer(dsa, 1, &node)) goto fail;
    453. 

  453.             if (!(1 <= node && node <= n))
    454. 

  454.             {  xprintf("%s:%d: invalid node number %d\n", dsa->fname,
    455. 

  455.                   dsa->seqn, node);
    456. 

  456.                goto fail;
    457. 

  457.             }
    458. 

  458.             tsp->tour[k] = node;
    459. 

  459.          }
    460. 

  460.          if (scan_integer(dsa, 1, &node)) goto fail;
    461. 

  461.          if (node != -1)
    462. 

  462.          {  xprintf("%s:%d: extra node(s) detected\n", dsa->fname,
    463. 

  463.                dsa->seqn);
    464. 

  464.             goto fail;
    465. 

  465.          }
    466. 

  466.          if (check_newline(dsa)) goto fail;
    467. 

  467.       }
    468. 

  468.       else if (strcmp(dsa->token, "EDGE_WEIGHT_SECTION") == 0)
    469. 

  469.       {  int n = tsp->dimension, i, j, temp;
    470. 

  470.          if (n == 0)
    471. 

  471.          {  xprintf("%s:%d: DIMENSION entry not specified\n",
    472. 

  472.                dsa->fname, dsa->seqn);
    473. 

  473.             goto fail;
    474. 

  474.          }
    475. 

  475.          if (tsp->edge_weight_format == TSP_UNDEF)
    476. 

  476.          {  xprintf("%s:%d: EDGE_WEIGHT_FORMAT entry not specified\n",
    477. 

  477.                dsa->fname, dsa->seqn);
    478. 

  478.             goto fail;
    479. 

  479.          }
    480. 

  480.          if (tsp->edge_weight != NULL)
    481. 

  481.          {  xprintf("%s:%d: EDGE_WEIGHT_SECTION multiply specified\n",
    482. 

  482.                dsa->fname, dsa->seqn);
    483. 

  483.             goto fail;
    484. 

  484.          }
    485. 

  485.          if (check_newline(dsa)) goto fail;
    486. 

  486.          tsp->edge_weight = xcalloc(1+n*n, sizeof(int));
    487. 

  487.          switch (tsp->edge_weight_format)
    488. 

  488.          {  case TSP_FULL_MATRIX:
    489. 

  489.                for (i = 1; i <= n; i++)
    490. 

  490.                {  for (j = 1; j <= n; j++)
    491. 

  491.                   {  if (scan_integer(dsa, 1, &temp)) goto fail;
    492. 

  492.                      tsp->edge_weight[(i - 1) * n + j] = temp;
    493. 

  493.                   }
    494. 

  494.                }
    495. 

  495.                break;
    496. 

  496.             case TSP_UPPER_ROW:
    497. 

  497.                for (i = 1; i <= n; i++)
    498. 

  498.                {  tsp->edge_weight[(i - 1) * n + i] = 0;
    499. 

  499.                   for (j = i + 1; j <= n; j++)
    500. 

  500.                   {  if (scan_integer(dsa, 1, &temp)) goto fail;
    501. 

  501.                      tsp->edge_weight[(i - 1) * n + j] = temp;
    502. 

  502.                      tsp->edge_weight[(j - 1) * n + i] = temp;
    503. 

  503.                   }
    504. 

  504.                }
    505. 

  505.                break;
    506. 

  506.             case TSP_LOWER_DIAG_ROW:
    507. 

  507.                for (i = 1; i <= n; i++)
    508. 

  508.                {  for (j = 1; j <= i; j++)
    509. 

  509.                   {  if (scan_integer(dsa, 1, &temp)) goto fail;
    510. 

  510.                      tsp->edge_weight[(i - 1) * n + j] = temp;
    511. 

  511.                      tsp->edge_weight[(j - 1) * n + i] = temp;
    512. 

  512.                   }
    513. 

  513.                }
    514. 

  514.                break;
    515. 

  515.             default:
    516. 

  516.                goto fail;
    517. 

  517.          }
    518. 

  518.          if (check_newline(dsa)) goto fail;
    519. 

  519.       }
    520. 

  520.       else if (strcmp(dsa->token, "EOF") == 0)
    521. 

  521.       {  if (check_newline(dsa)) goto fail;
    522. 

  522.          goto done;
    523. 

  523.       }
    524. 

  524.       else
    525. 

  525.       {  xprintf("%s:%d: keyword `%s' not recognized\n", dsa->fname,
    526. 

  526.             dsa->seqn, dsa->token);
    527. 

  527.          goto fail;
    528. 

  528.       }
    529. 

  529.       goto loop;
    530. 

  530. done: xprintf("tsp_read_data: %d lines were read\n", dsa->seqn-1);
    531. 

  531.       fclose(dsa->fp);
    532. 

  532.       return tsp;
    533. 

  533. fail: if (tsp != NULL)
    534. 

  534.       {  if (tsp->name != NULL) xfree(tsp->name);
    535. 

  535.          if (tsp->comment != NULL) xfree(tsp->comment);
    536. 

  536.          if (tsp->node_x_coord != NULL) xfree(tsp->node_x_coord);
    537. 

  537.          if (tsp->node_y_coord != NULL) xfree(tsp->node_y_coord);
    538. 

  538.          if (tsp->dply_x_coord != NULL) xfree(tsp->dply_x_coord);
    539. 

  539.          if (tsp->dply_y_coord != NULL) xfree(tsp->dply_y_coord);
    540. 

  540.          if (tsp->tour != NULL) xfree(tsp->tour);
    541. 

  541.          if (tsp->edge_weight != NULL) xfree(tsp->edge_weight);
    542. 

  542.          xfree(tsp);
    543. 

  543.       }
    544. 

  544.       if (dsa->fp != NULL) fclose(dsa->fp);
    545. 

  545.       return NULL;
    546. 

  546. }
    547. 

  547. 

  548. /*----------------------------------------------------------------------
    549. 

  549. -- tsp_free_data - free TSP instance data.
    550. 

  550. --
    551. 

  551. -- *Synopsis*
    552. 

  552. --
    553. 

  553. -- #include "glptsp.h"
    554. 

  554. -- void tsp_free_data(TSP *tsp);
    555. 

  555. --
    556. 

  556. -- *Description*
    557. 

  557. --
    558. 

  558. -- The routine tsp_free_data frees all the memory allocated to the TSP
    559. 

  559. -- instance data block, which the parameter tsp points to. */
    560. 

  560. 

  561. void tsp_free_data(TSP *tsp)
    562. 

  562. {     if (tsp->name != NULL) xfree(tsp->name);
    563. 

  563.       if (tsp->comment != NULL) xfree(tsp->comment);
    564. 

  564.       if (tsp->node_x_coord != NULL) xfree(tsp->node_x_coord);
    565. 

  565.       if (tsp->node_y_coord != NULL) xfree(tsp->node_y_coord);
    566. 

  566.       if (tsp->dply_x_coord != NULL) xfree(tsp->dply_x_coord);
    567. 

  567.       if (tsp->dply_y_coord != NULL) xfree(tsp->dply_y_coord);
    568. 

  568.       if (tsp->tour != NULL) xfree(tsp->tour);
    569. 

  569.       if (tsp->edge_weight != NULL) xfree(tsp->edge_weight);
    570. 

  570.       xfree(tsp);
    571. 

  571.       return;
    572. 

  572. }
    573. 

  573. 

  574. /*----------------------------------------------------------------------
    575. 

  575. -- tsp_distance - compute distance between two nodes.
    576. 

  576. --
    577. 

  577. -- *Synopsis*
    578. 

  578. --
    579. 

  579. -- #include "glptsp.h"
    580. 

  580. -- int tsp_distance(TSP *tsp, int i, int j);
    581. 

  581. --
    582. 

  582. -- *Description*
    583. 

  583. --
    584. 

  584. -- The routine tsp_distance computes the distance between i-th and j-th
    585. 

  585. -- nodes for the TSP instance, which tsp points to.
    586. 

  586. --
    587. 

  587. -- *Returns*
    588. 

  588. --
    589. 

  589. -- The routine tsp_distance returns the computed distance. */
    590. 

  590. 

  591. #define nint(x) ((int)((x) + 0.5))
    592. 

  592. 

  593. static double rad(double x)
    594. 

  594. {     /* convert input coordinate to longitude/latitude, in radians */
    595. 

  595.       double pi = 3.141592, deg, min;
    596. 

  596.       deg = (int)x;
    597. 

  597.       min = x - deg;
    598. 

  598.       return pi * (deg + 5.0 * min / 3.0) / 180.0;
    599. 

  599. }
    600. 

  600. 

  601. int tsp_distance(TSP *tsp, int i, int j)
    602. 

  602. {     int n = tsp->dimension, dij;
    603. 

  603.       if (!(tsp->type == TSP_TSP || tsp->type == TSP_ATSP))
    604. 

  604.          xfault("tsp_distance: invalid TSP instance\n");
    605. 

  605.       if (!(1 <= i && i <= n && 1 <= j && j <= n))
    606. 

  606.          xfault("tsp_distance: node number out of range\n");
    607. 

  607.       switch (tsp->edge_weight_type)
    608. 

  608.       {  case TSP_UNDEF:
    609. 

  609.             xfault("tsp_distance: edge weight type not specified\n");
    610. 

  610.          case TSP_EXPLICIT:
    611. 

  611.             if (tsp->edge_weight == NULL)
    612. 

  612.                xfault("tsp_distance: edge weights not specified\n");
    613. 

  613.             dij = tsp->edge_weight[(i - 1) * n + j];
    614. 

  614.             break;
    615. 

  615.          case TSP_EUC_2D:
    616. 

  616.             if (tsp->node_x_coord == NULL || tsp->node_y_coord == NULL)
    617. 

  617.                xfault("tsp_distance: node coordinates not specified\n");
    618. 

  618.             {  double xd, yd;
    619. 

  619.                xd = tsp->node_x_coord[i] - tsp->node_x_coord[j];
    620. 

  620.                yd = tsp->node_y_coord[i] - tsp->node_y_coord[j];
    621. 

  621.                dij = nint(sqrt(xd * xd + yd * yd));
    622. 

  622.             }
    623. 

  623.             break;
    624. 

  624.          case TSP_CEIL_2D:
    625. 

  625.             if (tsp->node_x_coord == NULL || tsp->node_y_coord == NULL)
    626. 

  626.                xfault("tsp_distance: node coordinates not specified\n");
    627. 

  627.             {  double xd, yd;
    628. 

  628.                xd = tsp->node_x_coord[i] - tsp->node_x_coord[j];
    629. 

  629.                yd = tsp->node_y_coord[i] - tsp->node_y_coord[j];
    630. 

  630.                dij = (int)ceil(sqrt(xd * xd + yd * yd));
    631. 

  631.             }
    632. 

  632.             break;
    633. 

  633.          case TSP_GEO:
    634. 

  634.             if (tsp->node_x_coord == NULL || tsp->node_y_coord == NULL)
    635. 

  635.                xfault("tsp_distance: node coordinates not specified\n");
    636. 

  636.             {  double rrr = 6378.388;
    637. 

  637.                double latitude_i = rad(tsp->node_x_coord[i]);
    638. 

  638.                double latitude_j = rad(tsp->node_x_coord[j]);
    639. 

  639.                double longitude_i = rad(tsp->node_y_coord[i]);
    640. 

  640.                double longitude_j = rad(tsp->node_y_coord[j]);
    641. 

  641.                double q1 = cos(longitude_i - longitude_j);
    642. 

  642.                double q2 = cos(latitude_i - latitude_j);
    643. 

  643.                double q3 = cos(latitude_i + latitude_j);
    644. 

  644.                dij = (int)(rrr * acos(0.5 * ((1.0 + q1) * q2 -
    645. 

  645.                   (1.0 - q1) *q3)) + 1.0);
    646. 

  646.             }
    647. 

  647.             break;
    648. 

  648.          case TSP_ATT:
    649. 

  649.             if (tsp->node_x_coord == NULL || tsp->node_y_coord == NULL)
    650. 

  650.                xfault("tsp_distance: node coordinates not specified\n");
    651. 

  651.             {  int tij;
    652. 

  652.                double xd, yd, rij;
    653. 

  653.                xd = tsp->node_x_coord[i] - tsp->node_x_coord[j];
    654. 

  654.                yd = tsp->node_y_coord[i] - tsp->node_y_coord[j];
    655. 

  655.                rij = sqrt((xd * xd + yd * yd) / 10.0);
    656. 

  656.                tij = nint(rij);
    657. 

  657.                if (tij < rij) dij = tij + 1; else dij = tij;
    658. 

  658.             }
    659. 

  659.             break;
    660. 

  660.          default:
    661. 

  661.             xassert(tsp->edge_weight_type != tsp->edge_weight_type);
    662. 

  662.       }
    663. 

  663.       return dij;
    664. 

  664. }
    665. 

  665. 

  666. /* eof */
    667.