以邻接矩阵作为图的存储结构，根据键盘输入创建图，并深度优先、广度优先遍历该图-matrix as to the adjacent storage structure of the plan, according to the keyboard input to create map and depth of priority, breadth priority traversal of the plan
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001312s ]
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.088853s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001202s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.002006s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001133s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003624s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001005s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003253s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.024572s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002088s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 154685 [ RunTime:0.001606s ]
