具有n 个顶点的无向网络G的每个生成树刚好具有n-1条边，采用三种不同的贪婪策略来选择这n-1条边。-n vertices to the non-G network spanning tree just with each n-1 edge, using three different strategies to choose greed that n-1 edge.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001176s ]
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.089934s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001244s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001969s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001285s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003749s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001089s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003202s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014433s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001357s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 127928 [ RunTime:0.001296s ]
