先构造一个图 用邻接矩阵存储 然后用分别普利姆算法和克努斯卡尔算法构造其最小生成树-First construct a map with the adjacency matrix is stored separately plym algorithm and then construct the minimum spanning tree algorithm克努斯卡尔
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001391s ]
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.097142s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001189s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.007825s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001541s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003275s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000964s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.005281s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015098s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001128s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 213457 [ RunTime:0.015557s ]
