自己编写的，TSP问题的各种近似算法，有最近邻策略，最短链接策略-I have written, TSP approximation algorithm for a variety of issues, there are nearest-neighbor strategy, the shortest link strategy
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001104s ]
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.080613s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001020s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001106s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000945s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.002983s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000840s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003648s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014971s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001161s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 209890 [ RunTime:0.043922s ]
