题目：若要在n个城市之间建立通信网络，只需要假设n－1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。-topics : n if the city between communication networks, need only assume that n-1 line can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001302s ]
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.094111s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001133s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001535s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001139s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003552s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000948s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.004271s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014530s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001218s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 153495 [ RunTime:0.017225s ]
