本程序是对经典的旅行商问题的一种解法,是学习数据结构算法的极佳材料,c语言编写-the procedures of the classic traveling salesman problem a solution is learning algorithm data structure of excellent material, language c
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001408s ]
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.090096s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001201s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001951s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001257s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003765s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001109s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003476s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.022779s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001609s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 199299 [ RunTime:0.001944s ]
