本程序是数据结构的图的最小生成树的实现程序，非常方便使用，希望大家能够喜欢。-this program is the data structure of the minimum spanning tree procedures, is very convenient to use, hope that we can like.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002089s ]
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.084697s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.002362s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001894s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.002087s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003556s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.002203s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003477s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015353s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002663s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 260335 [ RunTime:0.001231s ]
