prim算法的原理利用 prim算法构造最小生成树。有机的应用prim和数组存储生成树。-prim algorithm using the principle of Minimum Spanning Tree Algorithm prim. Application of organic prim and storage arrays spanning tree.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001331s ]
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.086985s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001222s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001872s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001141s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003499s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000965s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003338s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014888s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001228s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 211368 [ RunTime:0.001687s ]
