具有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.001546s ]
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.116038s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001279s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001909s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001520s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.005362s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001249s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.007022s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.017204s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001105s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 127928 [ RunTime:0.011540s ]
