在vc++平台下,用分支限界法和回溯法实现的旅行售货员问题。经本人测试运行无误,包括运行文档。-In vc++ Platform, using branch and bound and backtracking realize the travel salesman problem. After I run the correct tests, including the operation of the document.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001392s ]
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.092650s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001040s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001132s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000989s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003106s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000906s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003655s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014408s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001213s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 57349 [ RunTime:0.014065s ]