使用蚁群算法解决旅行商问题，mfc应用程序，城市数目及坐标在eil51.tsp里-use ant algorithm to solve the traveling salesman problem, and mfc applications, The number of cities and coordinates the eil51.tsp Lane
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001374s ]
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.092706s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001229s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001887s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001241s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003548s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001120s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003192s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015207s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001393s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 152004 [ RunTime:0.001250s ]
