用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。-from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001357s ]
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.088315s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001253s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001953s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001234s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003605s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001124s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003236s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014772s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001369s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 92274 [ RunTime:0.001302s ]
