最小生成树的prim算法
是求图中的最短路径的一个重要算法
但是是O(n2)复杂度的一个算法-minimum spanning tree algorithm is the prim map for the shortest path algorithm of an important but is O (n2) of a complex algorithm
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002130s ]
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.085397s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.002443s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001957s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.002363s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003736s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.002133s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003362s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.016559s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002536s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 313494 [ RunTime:0.001270s ]
