A Nearest Neighbor procedure to solve the TSP problem A Nearest neighbor procedure + 2opt to solve the Travelling Salesman Problem (TSP)..docx TSP NN when the instances are given in a matrix way.cpp TSP NN when the instances are given with Euclidean distance.cpp
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001354s ]
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.087737s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001174s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001923s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001176s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003650s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001004s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003305s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.017582s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001383s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 55623 [ RunTime:0.001263s ]
