旅行商问题，两种方法实现，分别是递归回溯和用栈来代替递归的功能的程序-Traveling salesman problem, two methods to achieve, namely, retrospective and the use of recursive stack instead of recursive function procedures
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001577s ]
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.125181s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001392s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.002311s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001581s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.004380s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001448s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003768s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.022318s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001667s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 184746 [ RunTime:0.001201s ]
