包括无向图的深度优先搜索，普里姆算法构造最小生成树，数据结构习题的答案-including undirected graph of the depth-first search, Primbetov tectonic minimum spanning tree algorithm and data structure Exercise answer!
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002059s ]
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.106154s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001278s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001990s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001217s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.004485s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001493s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003653s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.018211s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001590s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 144215 [ RunTime:0.001640s ]
