这是一个求最短路和最小生成树的C++的原代码,经过调试可以在机子上使用.-This is the most short-circuit for a minimum spanning tree and the original C code, after testing the use of loom.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002718s ]
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.113053s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.003085s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.003350s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.003219s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.006289s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.004555s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.006117s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.025646s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.003397s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 90921 [ RunTime:0.006396s ]