旅行商问题的源代码及其说明。给出空间中给定n个点，画一条简单路径，包括所有的点，使得路径最短-Traveling Salesman Problem and its description of the source code. Given space in a given n points, draw a simple path, including all the points, making the shortest path
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001102s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.082689s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.010270s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001233s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001053s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003350s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000913s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.004088s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.024075s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001484s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 233775 [ RunTime:0.014525s ]
