掌握图的邻接矩阵的存储结构；实现图的两种遍历：深度优先遍历和广度优先遍历。-master plan adjacency matrix storage structure; Implementation plans of the two traverse : depth-first traversal and breadth traversal priority.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001273s ]
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.087424s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001243s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001886s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001225s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003592s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001051s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003396s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014579s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001291s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 159287 [ RunTime:0.001239s ]
