以邻接表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-table adjacent to the structure for storage, connectivity to the map without the depth and breadth of priority priority traversal. Users designated as a starting point node, the output of each traverse the nodes visit Spanning Tree sequence and the corresponding set of edges.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001011s ]
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.080033s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.000917s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001210s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001017s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003039s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001067s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.005540s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015378s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001115s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 68345 [ RunTime:0.021090s ]
