采用邻接矩阵实现有向网的存储，建立有向网，并实现单源 最短路径算法-adjacency matrix used to achieve a storage network, to establish a network and to achieve single source shortest path algorithm
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.007861s ]
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.434448s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.033980s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.011637s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.008646s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.010966s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.009654s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.013746s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.026788s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001458s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 243909 [ RunTime:0.004571s ]
