该程序用贪心算法来求解最小生成树问题 采用贪婪准则：每次选择边权值最小边。如果该边加入后不构成环，则加入。-procedures with the greedy algorithm to solve the problem using the minimum spanning tree greedy guidelines : each side the right to choose the minimum value side. If the edge after the entry does not constitute a part, while accession.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001196s ]
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.063218s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001131s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001259s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000913s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003169s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000878s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003778s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.016321s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001447s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 125834 [ RunTime:0.017325s ]
