本程序用另外一种算法即近邻算法解决ＴＳＰ，即旅行商问题，请高手指教．-this procedure with the other algorithms that solve the TSP neighbor algorithm, the traveling salesman problem, experts advise.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001099s ]
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.099241s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.012228s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.003221s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001432s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003520s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000904s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003569s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015160s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001209s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 215532 [ RunTime:0.019420s ]
