用 Floyd 算法求任意两点间的最短路径及最短路长. D0 是图的邻接矩阵-Floyd algorithm used for any shortest path between two points and the most long-short-circuit. D0 is the graph adjacency matrix
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002219s ]
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.086673s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.002030s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001957s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.007506s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003743s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.002191s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003481s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015595s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002510s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 13182 [ RunTime:0.001547s ]
